Enumerative Combinatorics. - Vol. 2Enumerative Combinatorics. - Vol. 2
Title rated 0 out of 5 stars, based on 0 ratings(0 ratings)
eBook, 1999
Current format, eBook, 1999, , All copies in use.eBook, 1999
Current format, eBook, 1999, , All copies in use. Offered in 0 more formatsAn introduction, suitable for beginning graduate students, showing connections to other areas of mathematics.
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.
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.
Title availability
About
Subject and genre
Details
Publication
- Cambridge : Cambridge University Press, 1999.
Opinion
More from the community
Community lists featuring this title
There are no community lists featuring this title
Community contributions
Community quotations are the opinions of contributing users. These quotations do not represent the opinions of Whistler Public Library.
There are no quotations from this title
Community quotations are the opinions of contributing users. These quotations do not represent the opinions of Whistler Public Library.
There are no quotations from this title
From the community