Skip to main content Accessibility help
×
  1. Home
  2. Books
  3. Enumerative Combinatorics
  • Cited by 284
      • Volume 1, 2nd edition
      Show more authors
      • You may already have access via personal or institutional login
    • Select format
    • Publisher:
      Cambridge University Press
      Publication date:
      June 2012
      December 2011
      ISBN:
      9781139058520
      9781107015425
      9781107602625
      DOI:
      https://doi.org/10.1017/CBO9781139058520
      Dimensions:
      (228 x 152 mm)
      Weight & Pages:
      0.96kg, 642 Pages
      Dimensions:
      (228 x 152 mm)
      Weight & Pages:
      0.85kg, 642 Pages
      • Subjects:
      Mathematics (general), Mathematics, Algorithmics, Complexity, Computer Algebra, Computational Geometry, Computer Science, Discrete Mathematics Information Theory and Coding
      Series:
      Cambridge Studies in Advanced Mathematics (49)
    You may already have access via personal or institutional login
    • Selected: Digital
    Add to cart View cart Buy from Cambridge.org
    Subjects:
    Mathematics (general), Mathematics, Algorithmics, Complexity, Computer Algebra, Computational Geometry, Computer Science, Discrete Mathematics Information Theory and Coding
    Series:
    Cambridge Studies in Advanced Mathematics (49)
    Information

    Book description

    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.

    Reviews

    ‘… sure to become a standard as an introductory graduate text in combinatorics.'

    Source: Bulletin of the American Mathematical Society

    ‘… will engage from start to finish the attention of any mathematician who will open it at page one.'

    Gian-Carlo Rota

    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
    References

    Metrics

    Altmetric attention score

    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.