Enumerative Combinatorics: v. 2

by Richard P. Stanley (Author)

Imported Edition

Delivered in 14-21 working days

Free shipping

Online price: ₹Rs3,304 ₹Rs3,205

You save ₹Rs99

Login/Register to add this product to a wishlist.

You will be asked to pay the full amount when your item is delivered. Only cash is accepted for this type of order. Pay Cash on Delivery

Format: Paperback

Synopsis of Enumerative Combinatorics: v. 2

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.

Product details

  • Pages: 600
  • Publisher: Cambridge University Press
  • Published: 4th June 2001
  • Language: English
  • ISBN: 9780521789875
  • Category: Mathematics

Reviews of Enumerative Combinatorics: v. 2

Read customer reviews on this product. If you have read this book, why not post your own review?

Be the first to review this product

Also by Richard P. Stanley

Recently viewed by you

Wishlist (x items)
  • hello
Compare (0 items, 0 selected)
Compare selected Deselect all Remove all

Only items of the same type can be compared.