Enumerative combinatorics
著者
書誌事項
Enumerative combinatorics
（Cambridge studies in advanced mathematics, 62）
Cambridge University Press, 1999
- v. 2 : hardcover
大学図書館所蔵 件 / 全1件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Originally published: Monterey, Calif. : Wadsworth & Brooks/Cole Advanced Books & Software, c1986-. (The Wadsworth & Brooks/Cole mathematics series)
Includes additional errata and addenda (p.583-585)
Includes bibliographical references and index
内容説明・目次
内容説明
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.
「Nielsen BookData」 より
