Skip to content
Cart

Your Cart

×

You have 0 items in your cart.

Register Sign in Wishlist
Enumerative Combinatorics

Enumerative Combinatorics

Volume 2

$67.00 (P)

Part of Cambridge Studies in Advanced Mathematics

Sergey Fomin
View all contributors
  • Date Published: June 2001
  • availability: Available
  • format: Paperback
  • isbn: 9780521789875

$ 67.00 (P)
Paperback

Add to cart Add to wishlist

Other available formats:
Hardback, eBook


Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • 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.

    • Coverage of many topics not available in textbook form, plus the most accessible and thorough introduction available to the theory of symmetric functions
    • Over 250 exercises with solutions or references to solutions, many of which cover previously unpublished material
    • Section on Catalan numbers will appeal to amateur as well as professional mathematicians
    Read more

    Reviews & endorsements

    "...sure to become a standard as an introductory graduate text in combinatorics."
    Bulletin of the AMS"

    "As a researcher, Stanley has few peers in combinatorics...the trove of exercises with solutions will form a vital resource; indeed, exercise 6.19 on the Catalan numbers, in 66 (!) parts, justifies the investment by itself. Both volumes highly recommended for all libraries."
    Choice

    "Volume 2 not only lives up to the high standards set by Volume 1, but surpasses them... Stanley's book is a valuable contribution to enumerative combinatorics. Beginners will find it an accessible introduction to the subject, and experts will still find much to learn from it."
    Mathematical Reviews

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: June 2001
    • format: Paperback
    • isbn: 9780521789875
    • length: 600 pages
    • dimensions: 229 x 152 x 38 mm
    • weight: 0.88kg
    • availability: Available
  • Table of Contents

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

  • Author

    Richard P. Stanley, Massachusetts Institute of Technology

    Appendix by

    Sergey Fomin

    Contributors

    Sergey Fomin

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×