Scribd
Upload
133 views3 pages

Combinatorics

This document is an introduction to the second edition of a textbook on enumerative combinatorics. It provides an overview of the topics covered in the book, including counting techniques, sieve methods, partially ordered sets, rational generating functions and more. It has been expanded with new sections and over 350 exercises.

Uploaded by

Kedar Tatwawadi
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as EHTML, PDF, TXT or read online on Scribd
133 views3 pages

Combinatorics

This document is an introduction to the second edition of a textbook on enumerative combinatorics. It provides an overview of the topics covered in the book, including counting techniques, sieve methods, partially ordered sets, rational generating functions and more. It has been expanded with new sections and over 350 exercises.

Uploaded by

Kedar Tatwawadi
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as EHTML, PDF, TXT or read online on Scribd
You are on page 1/ 3

Enumerative Combinatorics second edition Richard P. Stanley version of 15 July 2011 Yes, wonderful things.

Howard Carter when asked if he saw anything, upon his first glimpse into the tomb of Tutankhamun. CONTENTS Preface 6 Acknowledgments 7 Chapter 1 What is Enumerative Combinatorics? 1.1 How to count 9 1.2 Sets and multisets 23 1.3 Cycles and inversions 29 1.4 Descents 38 1.5 Geometric representations of permutations 48 1.6 Alternating permutations, Euler numbers, 54 and the cd-index of Sn 1.6.1 Basic properties 54 1.6.2 Flip equivalence of increasing binary trees 56 1.6.3 Min-max trees and the cd-index 57 1.7 Permutations of multisets 62 1.8 Partition identities 68 1.9 The Twelvefold Way 79 Two q-analogues of permutations 89 1.10 1.10.1 A q-analogue of permutations as bijections 1.10.2 A q-analogue of permutations as words 89 100 Notes Exercises 2.1 114 Solutions to exercises Chapter 2 105 160 Sieve Methods Inclusion-Exclusion 223 3 2.2 Examples and Special Cases 227 2.3 Permutations with Restricted Positions 231 2.4 Ferrers Boards 235 2.5 V -partitions and Unimodal Sequences 238 2.6 Involutions 242 2.7 Determinants 246 Notes 249 Exercises 253 Solutions to exercises 266 Chapter 3 Partially Ordered Sets 3.1 Basic Concepts 277

3.2 New Posets from Old 283 3.3 Lattices 285 3.4 Distributive Lattices 290 3.5 Chains in Distributive Lattices 295 3.6 Incidence Algebras 299 3.7 The M bius Inversion Formula 303 o 3.8 Techniques for Computing M bius Functions 305 o 3.9 Lattices and Their M bius Functions 314 o 3.10 The M bius Function of a Semimodular Lattice 317 o 3.11 Hyperplane Arrangements 321 3.11.1 Basic definitions 321 3.11.2 The intersection poset and characteristic polynomial 322 3.11.3 Regions 325 3.11.4 The finite field method 328 3.12 Zeta Polynomials 333 3.13 Rank Selection 335 3.14 R-labelings 338 3.15 (P, )-partitions 341 3.15.1 The main generating function 341 3.15.2 Specializations 344 3.15.3 Reciprocity 346 3.15.4 Natural labelings 348 3.16 Eulerian Posets 353 3.17 The cd-index of an Eulerian Poset 359 4 3.18 Binomial Posets and Generating Functions 364 3.19 An Application to Permutation Enumeration 371 3.20 Promotion and Evacuation 374 3.21 Differential Posets 379 Notes 391 Exercises 401 Solutions to exercises 468 Chapter 4 Rational Generating Functions 4.1 Rational Power Series in One Variable 535 4.2 Further Ramifications 539 4.3 Polynomials 543 4.4 Quasipolynomials 546 4.5 Linear Homogeneous Diophantine Equations 548 4.6 Applications 561 4.6.1 Magic squares 561 4.6.2 The Ehrhart quasipolynomial of a rational polytope 566 4.7 The Transfer-matrix Method 573 4.7.1 Basic principles 573 4.7.2 Undirected graphs 575 4.7.3 Simple applications 576 4.7.4 Factorization in free monoids 580 4.7.5 Some sums over compositions 591 Notes 597 Exercises 605

Solutions to exercises 629 Appendix Graph Theory Terminology 655 First Edition Numbering 658 List of Notation 670 Index 5 Preface Enumerative combinatorics has undergone enormous development since the publication of the first edition of this book in 1986. It has become more clear what are the essential topics, and many interesting new ancillary results have been discovered. This second edition is an attempt to bring the coverage of the first volume more up-to-date and to impart a wide variety of additional applications and examples. The main difference between this volume and the previous is the addition of ten new sections (six in Chapter 1 and four in Chapter 3) and over 350 new exercises. In response to complaints about the difficulty of assigning homework problems whose solutions are included, I have added some relatively easy exercises without solutions, marked by an asterisk. There are also a few organizational changes, the most notable being the transfer of the section on P -partitions from Chapter 4 to Chapter 3, and extending this section to the theory of (P, )-partitions for any labeling . In addition, the old Section 4.6 has been split into Sections 4.5 and 4.6. There will be no second edition of volume 2 nor a volume 3. Since the references in volume 2 to information in volume 1 are no longer valid for this second edition, I have included a table entitled First Edition Numbering which gives the conversion between the two editions for all numbered results (theorems, examples, exercises, etc., but not equations). Exercise 4.12 has some sentimental meaning for me. This result, and related results connected to other linear recurrences with constant coefficients, is a product of my earliest research, done around the age of 17 when I was a student at Savannah High School. I have written my work, not as an essay which is to win the applause of the moment, but as a possession for all time. It is ridiculous to compare Enumerative Combinatorics with History of the Peloponnesian War, but I can appreciate the sentiment of Thucydides. I hope this book will bring enjoyment to many future generations of mathematicians and aspiring mathematicians as they are exposed to the beauties and pleasures of enumerative combinatorics. 6 Acknowledgments It is impossible to acknowledge the innumerable people who have contributed to this new volume. A number of persons provided special help by proofreading large portions of the text, namely, (1) Donald Knuth, (2) the Five Eagles ( ): Yun Ding ( ), Rosena Ruo Xia Du ( ), Susan Yi Jun Wu ( ), Jin Xia Xie ( ), and Dan Mei Yang ( ), (3) Henrique Pond de Oliveira Pinto, and (4) Sam Wong ( e ). To these persons I am especially grateful. Undoubtedly many errors remain, whose fault is my own.

You might also like