
Enumerative combinatorics
Publisher Description (unedited publisher data) 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. Library of Congress subject headings for this publication: Combinatorial enumeration problems.
- Generi
- Combinatorial enumeration problems, Abzählende Kombinatorik, Mathematics, Combinatorial optimization, Combinatorial analysis, Qa164.8 .s73 1986
- Autore
- Richard P. Stanley
- Pagine
- 306
Dove trovarlo
Alcuni collegamenti sono di affiliazione: se acquisti, il sito può ricevere una commissione, senza costi in più per te.
Non sai cosa scegliere?
Dimmi i tuoi gusti e ti propongo cosa leggere, in base a quello che ti piace.
Provalo gratisTitoli simili
Enumerative Combinatorics (2002)
Combinatorial enumeration of groups, graphs, and chemical compounds (1987)
Combinatorics of compositions and words (2009)
Analytic Combinatorics In Several Variables (2013)
Combinatorics of compositions and words (2010)
Combinatorial enumeration (1983)
Combinatoire énumérative (1986)
A walk through combinatorics (2011)