Enumerative combinatorics, vol I
Stanley, Richard P.
Enumerative combinatorics, vol I Richard P. Stanley. - 2nd ed. - Cambridge : Cambridge University Press, ©2012. - xiii, 626 p. : ill. ; 24 cm. - Cambridge studies in advanced mathematics ; 49 .
Includes bibliographical references and index.
Machine generated contents note: 1. What is enumerative combinatorics?; 2. Sieve methods; 3. Partially ordered sets; 4. Rational generating functions.
"Richard Stanley's two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for students and experts alike. This thoroughly revised second edition of Volume 1 includes ten new sections and more than 300 new exercises, most with solutions, reflecting numerous new developments since the publication of the first edition in 1986. The author brings the coverage up to date and includes a wide variety of additional applications and examples, as well as updated and expanded chapter bibliographies. Many of the less difficult new exercises have no solutions so that they can more easily be assigned to students. The material on P-partitions has been rearranged and generalized; the treatment of permutation statistics has been greatly enlarged; and there are also new sections on q-analogues of permutations, hyperplane arrangements, the cd-index, promotion and evacuation and differential posets"--
9781107602625
2011037989
Combinatorial enumeration problems.
MATHEMATICS / Discrete Mathematics.
QA164.8 / .S73 2012
511.62 / STA-E
Enumerative combinatorics, vol I Richard P. Stanley. - 2nd ed. - Cambridge : Cambridge University Press, ©2012. - xiii, 626 p. : ill. ; 24 cm. - Cambridge studies in advanced mathematics ; 49 .
Includes bibliographical references and index.
Machine generated contents note: 1. What is enumerative combinatorics?; 2. Sieve methods; 3. Partially ordered sets; 4. Rational generating functions.
"Richard Stanley's two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for students and experts alike. This thoroughly revised second edition of Volume 1 includes ten new sections and more than 300 new exercises, most with solutions, reflecting numerous new developments since the publication of the first edition in 1986. The author brings the coverage up to date and includes a wide variety of additional applications and examples, as well as updated and expanded chapter bibliographies. Many of the less difficult new exercises have no solutions so that they can more easily be assigned to students. The material on P-partitions has been rearranged and generalized; the treatment of permutation statistics has been greatly enlarged; and there are also new sections on q-analogues of permutations, hyperplane arrangements, the cd-index, promotion and evacuation and differential posets"--
9781107602625
2011037989
Combinatorial enumeration problems.
MATHEMATICS / Discrete Mathematics.
QA164.8 / .S73 2012
511.62 / STA-E