 |
Description of the Book: Enumerative Combinatorics, Volume 2
For Advertisment
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.
|
|
Details of the Book: Enumerative Combinatorics, Volume 2Author: Richard P. Stanley Number Of Pages: 594 Binding: Paperback ISBN-10: 1859956416 ISBN-13: 9780521789875 Language: English Amazon Sales Rank: 187857 Publication Date: 2001 Publisher: Cambridge University Press Package Dimensions: 1.40 x 8.90 x 6.00 inches |
Related KeywordsCombinatorial enumeration problems Mathematics Combinatorics General MEDICAL / General Mathematics / Combinatorics Mathematics / Discrete Mathematics Mathematics / Probability Functional Analysis Algebra Calculus & mathematical analysis Combinatorics & graph theory Theory Of Functions Science/Mathematics |
|
|
|
Contact