Bücher von Martin Aigner

Combinatorial enumeration is a readily accessible subject full of easily stated, but sometimes tantalizingly difficult problems. This book leads the reader in a leisurely way from the basic notions to a variety of topics, ranging from algebra to statistical physics. Its aim is to introduce the student to a fascinating field, and to be a source of information for the professional mathematician who wants to learn more about the subject. The book is organized in three parts: Basics, Methods, and Topics. There are 666 exercises, and as a special feature every chapter ends with a highlight, discussing a particularly beautiful or famous result.

This book takes the reader on a mathematical journey from the number-theoretic setting of the Theorem of Markov and its Uniqueness Conjecture, gradually unfolding many beautiful connections, until in the proof of the Theorem everything falls into place.

First, there exist several older books on the subject, such as Ryser [1] (which I still think is the most seductive introduction to combinatorics), Hall [2], and more recent ones such as Cameron-Van Lint [1] on groups and designs, and Blake-Mullin [1] on coding theory, whereas no compre hensive book exists on (a) and (b).

Combinatorial enumeration is a readily accessible subject full of easily stated, but sometimes tantalizingly difficult problems. This book leads the reader in a leisurely way from basic notions of combinatorial enumeration to a variety of topics, ranging from algebra to statistical physics.

Proceedings of the NATO Advanced Study Institute, Berlin, Germany, September 1-10, 1976