Research Catalog

Enumerative combinatorics

Title
Enumerative combinatorics / Richard P. Stanley.
Author
Stanley, Richard P., 1944-
Publication
Cambridge ; New York : Cambridge University Press, ©1997-1999.

Items in the Library & Off-site

Filter by

2 Items

StatusVol/DateFormatAccessCall NumberItem Location
vol. 2, 2nd ed. (2024)TextUse in library QA164.8 .S73 1997 vol. 2, 2nd ed. (2024)Off-site
vol. 1TextUse in library QA164.8 .S73 1997 vol. 1Off-site

Details

Description
2 volumes : illustrations; 24 cm
Summary
Publisher Description (unedited publisher data) 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. Library of Congress subject headings for this publication: Combinatorial enumeration problems.
Series Statement
Cambridge studies in advanced mathematics ; 49, 62
Uniform Title
Cambridge studies in advanced mathematics ; 49, 62.
Subjects
Note
  • Originally published: Monterey, Calif. : Wadsworth & Brooks/Cole Advanced Books & Software, c1986- . (The Wadsworth & Brooks/Cole mathematics series).
Bibliography (note)
  • Includes bibliographical references and indexes.
Contents
v. 1. What is enumerative combinatorics? -- Sieve methods -- Partially ordered sets -- Rational generating functions -- Graph theory terminology -- v. 2. Trees and the composition of generating functions -- Algebraic, D-finite, and noncommutative generating functions -- Symmetric functions -- Knuth equivalence, Jeu de Taquin, and the Littlewood-Richardson rule -- The characters of GL (n, C).
ISBN
  • 0521553091
  • 9780521553094
  • 0521560691
  • 9780521560696
  • 0521663512
  • 9780521663519
LCCN
96044267
OCLC
  • ocm35637026
  • 35637026
  • SCSB-2123748
Owning Institutions
Princeton University Library