Filter
Diskret matematik
Filter
A transfinite graph or electrical network of the first rank is obtained conceptually by connecting conventionally infinite graphs and networks together at their infinite …
Over the course of the last century, the systematic exploration of the relationship between Fourier analysis and other branches of mathematics has lead to important advances in …
One of the major concerns of theoretical computer science is the classifi- cation of problems in terms of how hard they are. The natural measure of difficulty of a function is the …
"e;102 Combinatorial Problems"e; consists of carefully selected problems that have been used in the training and testing of the USA International Mathematical Olympiad …
Recently, a variety ofresults on the complexitystatusofthegraph isomorphism problem has been obtained. These results belong to the so-called structural part of Complexity Theory. …
Some remarkable connections between commutative algebra and combinatorics have been discovered in recent years. This book provides an overview of two of the main topics in this …
Because of its wide applicability, graph theory is one of the fast-growing areas of modern mathematics. Graphs arise as mathematical models in areas as diverse as management …
The action of a compact Lie group, G, on a compact sympletic manifold gives rise to some remarkable combinatorial invariants. The simplest and most interesting of these is the …
Taking into account the various criss-crossing among mathematical subject, Physical Combinatorics presents new results and exciting ideas from three viewpoints; representation …
Examines in detail those topics in convex geometry that are concerned with Euclidean spaceEnriched by numerous examples, illustrations, and exercises, with a good bibliography and …