Enumerative combinatorics  v. 1 ~ v. 2

Richard P. Stanley

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.

「Nielsen BookData」より

[目次]

  • 5. Composition of generating functions
  • 6. Algebraic, D-finite, and noncommutative generating functions
  • 7. Symmetric functions
  • Appendix Sergey Fomin.

「Nielsen BookData」より

この本の情報

書名 Enumerative combinatorics
著作者等 Stanley, Richard P
Bollobas, Bela
Fulton, W.
Katok, A.
Kirwan, F.
Sarnak, P.
Simon, B.
Totaro, B.
Fomin, Sergey
シリーズ名 Cambridge studies in advanced mathematics
巻冊次 v. 1
v. 2
出版元 Cambridge University Press
刊行年月 1997-1999
ページ数 2 v.
大きさ 24 cm
ISBN 0521560691
9780521553094
NCID BA3106484X
※クリックでCiNii Booksを表示
言語 英語
出版国 イギリス
この本を: 
このエントリーをはてなブックマークに追加

このページを印刷

外部サイトで検索

この本と繋がる本を検索

ウィキペディアから連想