Enumerative combinatorics

Author(s)

• Stanley, Richard P.

Bibliographic Information

Enumerative combinatorics

Richard P. Stanley

（Cambridge studies in advanced mathematics, 49, 62）

Cambridge University Press, 1997-1999

• v. 1 : hardcover
• v. 2 : hardcover

Note

Originally published: Monterey, Calif. : Wadsworth & Brooks/Cole Advanced Books & Software, c1986-. (The Wadsworth & Brooks/Cole mathematics series)

Includes bibliographical references and index

Description and Table of Contents

Volume

v. 1 : hardcover ISBN 9780521553094

Description

This book is the first of a two-volume basic introduction to enumerative combinatorics at a level suitable for graduate students and research mathematicians. It concentrates on the theory and application of generating functions, a fundamental tool in enumerative combinatorics. The book covers those parts of enumerative combinatorics of greatest applicability to other areas of mathematics. The four chapters are devoted to an introduction to enumeration (suitable for advanced undergraduates), sieve methods (including the Principle of Inclusion-Exclusion), partially ordered sets, and rational generating functions. There are a large number of exercises, almost all with solutions, which greatly augment the text and provide entry into many areas not covered directly. Graduate students and research mathematicians who wish to apply combinatorics to their work will find this an authoritative reference.

Table of Contents

• 1. What is enumerative combinatorics?
• 2. Sieve methods
• 3. Partially ordered sets
• 4. Rational generating functions.

Volume

v. 2 : hardcover ISBN 9780521560696

Description

This second volume of a two-volume basic introduction to enumerative combinatorics covers the composition of generating functions, trees, algebraic generating functions, D-finite generating functions, noncommutative generating functions, and symmetric functions. The chapter on symmetric functions provides the only available treatment of this subject suitable for an introductory graduate course on combinatorics, and includes the important Robinson-Schensted-Knuth algorithm. Also covered are connections between symmetric functions and representation theory. An appendix by Sergey Fomin covers some deeper aspects of symmetric function theory, including jeu de taquin and the Littlewood-Richardson rule. As in Volume 1, the exercises play a vital role in developing the material. There are over 250 exercises, all with solutions or references to solutions, many of which concern previously unpublished results. Graduate students and research mathematicians who wish to apply combinatorics to their work will find this an authoritative reference.

Table of Contents

• 5. Composition of generating functions
• 6. Algebraic, D-finite, and noncommutative generating functions
• 7. Symmetric functions
• Appendix Sergey Fomin.

by "Nielsen BookData"

Details

• NCID: BA3106484X
• ISBN:
  • 9780521553094
  • 0521560691
• LCCN: 96044267
• Country Code: uk
• Title Language Code: eng
• Text Language Code: eng
• Place of Publication: Cambridge ; New York
• Pages/Volumes: 2 v.
• Size: 24 cm
• Classification:
  • NDC9 : 411.22
  • LCC : QA164.8
  • DC20 : 511/.62
• Subject Headings:
  • LCSH : Combinatorial enumeration problems
• Parent Bibliography ID:
  • BA00109761