A Course in Enumeration [electronic resource] /by Martin Aigner.
by Aigner, Martin [author.]; SpringerLink (Online service).
Material type:
Item type | Current location | Call number | Status | Date due | Barcode |
---|---|---|---|---|---|
MAIN LIBRARY | QA164-167.2 (Browse shelf) | Available |
Browsing MAIN LIBRARY Shelves Close shelf browser
RM1-950 Encyclopedia of Molecular Pharmacology | QA75.5-76.95 Parallel Problem Solving from Nature - PPSN IX | A Short Course in Quantum Information Theory | QA164-167.2 A Course in Enumeration | QB1-991 Gamma-Ray Bursts | Q334-342 Text, Speech and Dialogue | QA76.6-76.66 Recent Advances in Parallel Virtual Machine and Message Passing Interface |
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.
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.
There are no comments for this item.