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 advanced topics, ranging from algebra to statistical physics.

Includes supplementary material: sn.pub/extras

Autorentext

Prof. Dr. Martin Aigner, Institut für Mathematik, Freie Universität Berlin

Inhalt
Basics.- Fundamental Coefficients.- Formal Series and Infinite Matrices.- Methods.- Generating Functions.- Hypergeometric Summation.- Sieve Methods.- Enumeration of Patterns.- Topics.- The Catalan Connection.- Symmetric Functions.- Counting Polynomials.- Models from Statistical Physics.