
At a Glance
576 Pages
23.5 x 16.51 x 3.81
Hardcover
$109.00
or 4 interest-free payments of $27.25 with
orShips in 5 to 7 business days
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. The book is organized in three parts: Basics, Methods, and Topics. The aim is to introduce readers to a fascinating field, and to offer a sophisticated source of information for professional mathematicians desiring to learn more. There are 666 exercises, and every chapter ends with a highlight section, discussing in detail a particularly beautiful or famous result.
Industry Reviews
"I loved Martin Aigner's Proofs from THE BOOK, a showcase of some of the most elegant and appealing proofs from across mathematics, and it has a similar feel to that. The presentations of ideas and proofs have the kind of clarity and luminousness which makes one feel, after reading them, that they are the natural if not the only ones. Each chapter also ends with a 'highlight', tackling a famous and attractive problem using the tools developed." (Danny Yee, dannyreviews.com, July, 2018)
"It provides mathematical analysis of combinatorial sets ... . Martin Aigner has a reputation as a good expositor of mathematics ... and the book does not disappoint. The explanations, while often brief, are quite good. ... As the book gets more and more advanced, the explanations grow correspondingly in size. ... contains the clearest explanation of graph polynomials that I have ever found. ... the book contains good and readable expositions of an interesting and beautiful subject." (PeterBoothe, SIGACT News, Vol. 41 (2), 2010)
"The goal of the text is present enumerative combinatorics together with its many applications, including chapters not common in enumerative combinatorics texts, like the ones on hypergeometric summations, on the Tutte polynomial, and on models from statistical physics. ... good number of exercises carry additional material, and a number of selected exercises are given a solution at the end. ... A nice trend in recent books - closing chapters with some spectacular 'book proofs' - is followed and will help at keeping the attention of the students." (Laszlo A. Szekely, Zentralblatt MATH, Vol. 1123 (1), 2008)
"The book is divided into three parts ... . the structure and topics of this book are well-designed, and there are nearly 700 exercises sprinkled throughout - many with hints and solutions in the back - which make the book far more appealing. I think it would be a good ... textbook for any graduate student wishing to learn about enumerative combinatorics." (Darren Glass, MathDL, January, 2008)
"In this graduate textbook on enumerative combinatorics, the author follows the classic structure of basics-methods-special topics. ... Each chapter ends with a 'Highlight', which is a specific, high-level application of the material learned in that chapter. This will benefit instructors and interested students alike. ... the book will broaden access to several special topics and will turn them into more mainstream knowledge. The scope of the book is large, so most readers will find several sections that will teach them many facts, methods and theories." (Miklos Bona, Mathematical Reviews, Issue 2008 f)
"The techniques one needs to be an expert in enumeration are very involved, sometimes quite genius. ... This book moves this important technique much closer to the classrooms than it used to be. ... The arguments throughout the book are very clear, many exercises are presented ... . This way the lecturers with talented audience will find many ideas how to hold out the beauty behind the dry techniques. We highly recommend this book for anyone related to enumeration ... ." (Peter Hajnal, Acta Scientiarum Mathematicarum, Vol. 74, 2008)
| Introduction | p. 1 |
| Basics | |
| Fundamental Coefficients | p. 5 |
| Elementary Counting Principles | p. 5 |
| Exercises | p. 9 |
| Subsets and Binomial Coefficients | p. 10 |
| Exercises | p. 18 |
| Set-partitions and Stirling Numbers Sn,k | p. 20 |
| Exercises | p. 23 |
| Permutations and Stirling Numbers Sn,k | p. 24 |
| Exercises | p. 29 |
| Number-Partitions | p. 31 |
| Exercises | p. 35 |
| Lattice Paths and Gaussian Coefficients | p. 36 |
| Exercises | p. 42 |
| Highlight: Aztec Diamonds | p. 44 |
| Notes and References | p. 51 |
| Formal Series and Infinite Matrices | p. 53 |
| Algebra of Formal Series | p. 53 |
| Exercises | p. 59 |
| Types of Formal Series | p. 60 |
| Exercises | p. 65 |
| Infinite Sums and Products | p. 66 |
| Exercises | p. 70 |
| Infinite Matrices and Inversion of Sequences | p. 71 |
| Exercises | p. 76 |
| Probability Generating Functions | p. 77 |
| Exercises | p. 84 |
| Highlight: The Point of (No) Return | p. 85 |
| Notes and References | p. 90 |
| Methods | |
| Generating Functions | p. 93 |
| Solving Recurrences | p. 93 |
| Exercises | p. 102 |
| Evaluating Sums | p. 105 |
| Exercises | p. 110 |
| The Exponential Formula | p. 112 |
| Exercises | p. 122 |
| Number-Partitions and Infinite Products | p. 124 |
| Exercises | p. 132 |
| Highlight: Ramanujan's Most Beautiful Formula | p. 136 |
| Notes and References | p. 141 |
| Hypergeometric Summation | p. 143 |
| Summation by Elimination | p. 143 |
| Exercises | p. 148 |
| Indefinite Sums and Closed Forms | p. 148 |
| Exercises | p. 155 |
| Recurrences for Hypergeometric Sums | p. 155 |
| Exercises | p. 161 |
| Hypergeometric Series | p. 162 |
| Exercises | p. 168 |
| Highlight: New Identities from Old | p. 171 |
| Notes and References | p. 178 |
| Sieve Methods | p. 179 |
| Inclusion-Exclusion | p. 179 |
| Exercises | p. 189 |
| Möbius Inversion | p. 191 |
| Exercises | p. 200 |
| The Involution Principle | p. 202 |
| Exercises | p. 215 |
| The Lemma of Gessel-Viennot | p. 217 |
| Exercises | p. 229 |
| Highlight: Tutte's Matrix-Tree Theorem | p. 231 |
| Notes and References | p. 237 |
| Enumeration of Patterns | p. 239 |
| Symmetries and Patterns | p. 239 |
| Exercises | p. 248 |
| The Theorem of Pólya-Redfield | p. 249 |
| Exercises | p. 260 |
| Cycle Index | p. 262 |
| Exercises | p. 269 |
| Symmetries on N and R | p. 270 |
| Exercises | p. 276 |
| Highlight: Patterns of Polyominoes | p. 278 |
| Notes and References | p. 285 |
| Topics | |
| The Catalan Connection | p. 289 |
| Catalan Matrices and Orthogonal Polynomials | p. 290 |
| Exercises | p. 297 |
| Catalan Numbers and Lattice Paths | p. 300 |
| Exercises | p. 305 |
| Generating Functions and Operator Calculus | p. 306 |
| Exercises | p. 320 |
| Combinatorial Interpretation of Catalan Numbers | p. 323 |
| Exercises | p. 333 |
| Highlight: Chord Diagrams | p. 337 |
| Notes and References | p. 344 |
| Symmetric Functions | p. 345 |
| Symmetric Polynomials and Functions | p. 345 |
| Exercises | p. 349 |
| Homogeneous Symmetric Functions | p. 350 |
| Exercises | p. 355 |
| Schur Functions | p. 356 |
| Exercises | p. 366 |
| The RSK Algorithm | p. 367 |
| Exercises | p. 378 |
| Standard Tableaux | p. 380 |
| Exercises | p. 383 |
| Highlight: Hook-Length Formulas | p. 385 |
| Notes and References | p. 391 |
| Counting Polynomials | p. 393 |
| The Tutte Polynomial of Graphs | p. 393 |
| Exercises | p. 405 |
| Eulerian Cycles and the Interlace Polynomial | p. 407 |
| Exercises | p. 419 |
| Plane Graphs and Transition Polynomials | p. 420 |
| Exercises | p. 432 |
| Knot Polynomials | p. 434 |
| Exercises | p. 443 |
| Highlight: The Best Theorem | p. 445 |
| Notes and References | p. 449 |
| Models from Statistical Physics | p. 451 |
| The Dimer Problem and Perfect Matchings | p. 451 |
| Exercises | p. 465 |
| The Ising Problem and Eulerian Subgraphs | p. 467 |
| Exercises | p. 480 |
| Hard Models | p. 481 |
| Exercises | p. 489 |
| Square Ice | p. 490 |
| Exercises | p. 504 |
| Highlight: The Rogers-Ramanujan Identities | p. 506 |
| Notes and References | p. 517 |
| Solutions to Selected Exercises | p. 519 |
| p. 519 | |
| p. 521 | |
| p. 524 | |
| p. 528 | |
| p. 529 | |
| p. 533 | |
| p. 536 | |
| p. 540 | |
| p. 544 | |
| p. 547 | |
| Notation | p. 553 |
| Index | p. 557 |
| Table of Contents provided by Ingram. All Rights Reserved. |
ISBN: 9783540390329
ISBN-10: 3540390324
Series: Graduate Texts In Mathematics
Published: 26th June 2007
Format: Hardcover
Language: English
Number of Pages: 576
Audience: College, Tertiary and University
Publisher: Springer Nature B.V.
Country of Publication: DE
Dimensions (cm): 23.5 x 16.51 x 3.81
Weight (kg): 0.96
Shipping
| Standard Shipping | Express Shipping | |
|---|---|---|
| Metro postcodes: | $9.99 | $14.95 |
| Regional postcodes: | $9.99 | $14.95 |
| Rural postcodes: | $9.99 | $14.95 |
Orders over $79.00 qualify for free shipping.
How to return your order
At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.
Additional postage charges may be applicable.
Defective items
If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.
For more info please visit our Help Centre.
























