Skip to main content Accessibility help
×
  1. Home
  2. Books
  3. Enumerative Combinatorics
  • Cited by 1506
Publisher:
Cambridge University Press
Online publication date:
January 2010
Print publication year:
1999
Online ISBN:
9780511609589
DOI:
https://doi.org/10.1017/CBO9780511609589
Subjects:
Mathematics (general), Mathematics, Discrete Mathematics Information Theory and Coding, Algebra
Series:
Cambridge Studies in Advanced Mathematics (62)
Information

Book 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.

Reviews

‘This magnificent two-volume work is best described by a quote from Gian-Carlo Rota’s Forward to Volume 2: I find it impossible to predict when Richard Stanley’s two-volume exposition of combinatorics may be superseded. No one will dare try, let alone be able, to match the thoroughness of coverage, the care for detail, the definitiveness of proof, the elegance of presentation.’

J. E. Graver

‘As a researcher, Stanley has few peers in combinatorics; as at once, to pack every page with information, connect with the reader’s intuition, and communicate the underlying, unifying philosophy of the subject.’

D. V. Feldman - University of New Hampshire

‘What else is to be added to our comments on this excellent book? Perhaps a quotation from G.-C. Rota’s foreword: ‘Every once in a long while, a textbook worthy of the name comes along … Weber, Bertini, van der Waerden, Feller, Dunford and Schwartz, Ahlfors, Stanley.’

Source: European Mathematical Society

‘… an authoritative account of enumerative combinatorics.’

George E. Andrews Source: Bulletin of the London Mathematical Society

'What else can be added to the comments upon this excellent book?'

Source: EMS Newsletter

Refine List

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

Contents

Contents

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Book summary page views

Total views: 0 *
Loading metrics...

* Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

Usage data cannot currently be displayed.

Accessibility standard: Unknown

Why this information is here

This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.

Accessibility Information

Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.