| Enumerative Combinatorics: Volume 2 Contributor(s): Stanley, Richard P. (Author), Fomin, Sergey P. (Author), Bollobas, Bela (Editor) |
|
 |
ISBN: 0521560691 ISBN-13: 9780521560696 Publisher: Cambridge University Press OUR PRICE: $206.15 Product Type: Hardcover - Other Formats Published: January 1999 * Not available - Not in print at this time *Annotation: 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. |
| Additional Information |
| BISAC Categories: - Mathematics | Combinatorics - Mathematics | Discrete Mathematics |
| Dewey: 511.62 |
| LCCN: 96044267 |
| Series: Cambridge Studies in Advanced Mathematics (Hardcover) |
| Physical Information: 1.46" H x 6.38" W x 9.33" (2.08 lbs) 600 pages |