Enumerative Combinatorics: Volume 2
Seiten
2001
Cambridge University Press (Verlag)
978-0-521-78987-5 (ISBN)
Cambridge University Press (Verlag)
978-0-521-78987-5 (ISBN)
- Titel erscheint in neuer Auflage
- Artikel merken
Enumerative combinatorics deals with the basic problem of counting how many objects have a given property, a subject of great applicability. This book provides an introduction at a level suitable for graduate students. Extensive exercises with solutions show 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.
5. Composition of generating functions; 6. Algebraic, D-finite, and noncommutative generating functions; 7. Symmetric functions; Appendix Sergey Fomin.
| Erscheint lt. Verlag | 4.6.2001 |
|---|---|
| Reihe/Serie | Cambridge Studies in Advanced Mathematics |
| Mitarbeit |
Anhang von: Sergey Fomin |
| Zusatzinfo | Worked examples or Exercises |
| Verlagsort | Cambridge |
| Sprache | englisch |
| Maße | 154 x 228 mm |
| Gewicht | 793 g |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Graphentheorie |
| ISBN-10 | 0-521-78987-7 / 0521789877 |
| ISBN-13 | 978-0-521-78987-5 / 9780521789875 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Numbers and Counting, Groups, Graphs, Orders and Lattices
Buch | Softcover (2023)
De Gruyter (Verlag)
CHF 89,95
