Enumerative Combinatorics

Name: Enumerative Combinatorics
Price: 376.2 USD
Availability: InStock
ISBN: 9780521560696

ISBN-10: 0521560691

ISBN-13: 9780521560696

Edition: 1999

Authors: Richard P. Stanley, Sergey Fomin, B. Bollobas, W. Fulton, A. Katok

List price: $199.99

30 day, 100% satisfaction guarantee!

Marketplace

1 new & used from $376.20

what's this?

Rush Rewards U
Members Receive:

You have reached 400 XP and carrot coins. That is the daily max!

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…

Book details

List price: $199.99
Copyright year: 1999
Publisher: Cambridge University Press
Publication date: 1/13/1999
Binding: Hardcover
Pages: 600
Size: 6.50" wide x 9.50" long x 1.50" tall
Weight: 2.134
Language: English




Composition of generating functions



Algebraic, D-finite, and noncommutative generating functions



Symmetric functions


Appendix Sergey Fomin