Diskret matematik
Filter
Regular polytopes and their symmetry have a long history stretching back two and a half millennia, to the classical regular polygons and polyhedra. Much of modern research focuses …
This is a revised edition of McEliece's classic. It is a self-contained introduction to all basic results in the theory of information and coding (invented by Claude Shannon in …
The study of graph structure has advanced in recent years with great strides: finite graphs can be described algebraically, enabling them to be constructed out of more basic …
Polycycles and symmetric polyhedra appear as generalisations of graphs in the modelling of molecular structures, such as the Nobel prize winning fullerenes, occurring in chemistry …
The rapidly expanding area of structural graph theory uses ideas of connectivity to explore various aspects of graph theory and vice versa. It has links with other areas of …
This collaborative volume presents trends arising from the fruitful interaction between the themes of combinatorics on words, automata and formal language theory, and number …
This volume, the third in a sequence that began with The Theory of Matroids and Combinatorial Geometries, concentrates on the applications of matroid theory to a variety of topics …
Combinatorics on words has arisen independently within several branches of mathematics, for instance number theory, group theory and probability, and appears frequently in problems …
This 1997 work explores the role of probabilistic methods for solving combinatorial problems. These methods not only provide the means of efficiently using such notions as …
Internationally recognised researchers look at developing trends in combinatorics with applications in the study of words and in symbolic dynamics. They explain the important …