Stanley, Richard P. Enumerative combinatorics. Vol. 1. 2nd ed. (English) Zbl 1247.05003 Cambridge Studies in Advanced Mathematics 49. Cambridge: Cambridge University Press (ISBN 978-1-107-60262-5/pbk; 978-1-107-01542-5/hbk; 978-1-139-20056-1/ebook). xiii, 626 p. (2012). The first edition of this book has become established as the standard introduction to enumerative combinatorics. Since the publication in 1986, the field has developed rapidly. The present new edition takes this fact into account.The first chapter “What is enumerative combinatorics?” has been enlarged by six new sections which mainly treat permutation statistics but also \(q\)-analogues of permutations. The third chapter “Partially ordered sets” now includes additional sections on hyperplane arrangements, the \(cd\)-index, promotion and evacuations, and differential posets. The new edition comes with more than 350 new exercises; less difficult exercises are without solutions now.See the reviews of the first editions in [Zbl 0945.05006; Zbl 0608.05001; Zbl 0889.05001]. Reviewer: Astrid Reifegerste (Magdeburg) Cited in 12 ReviewsCited in 856 Documents MSC: 05-02 Research exposition (monographs, survey articles) pertaining to combinatorics 05A15 Exact enumeration problems, generating functions 05A16 Asymptotic enumeration 06A07 Combinatorics of partially ordered sets Keywords:enumerative combinatorics; counting; sieve methods; partially ordered sets; generating functions Citations:Zbl 0945.05006; Zbl 0608.05001; Zbl 0889.05001 PDFBibTeX XMLCite \textit{R. P. Stanley}, Enumerative combinatorics. Vol. 1. 2nd ed. Cambridge: Cambridge University Press (2012; Zbl 1247.05003) Full Text: Link Online Encyclopedia of Integer Sequences: Rectangular array A read by upward antidiagonals: A(k,n) = (2^k-1)^n, n,k >= 1. Möbius function of absolute order. Number of pairs (p,q) of partitions such that q is a partition of n and p <= q (diagram containment). Numbers a(n) which count the linear extensions of the zigzag poset Z of length 2n where each minimal element in Z additionally covers a new element. a(n) is the number of linear extensions of the zigzag poset Z of length 2n where each minimal element in Z additionally covers two new elements.