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.
評分
評分
評分
評分
這兩本Stanley的書就是bible.
评分非常詳細通徹的組閤學
评分這兩本Stanley的書就是bible.
评分麻省組閤大師 Stanley 的名著。個人認為,第二捲最後一章“對稱函數”纔是兩捲書中最亮的部分。當然毫無疑問,太難瞭。
评分麻省組閤大師 Stanley 的名著。個人認為,第二捲最後一章“對稱函數”纔是兩捲書中最亮的部分。當然毫無疑問,太難瞭。
本站所有內容均為互聯網搜索引擎提供的公開搜索信息,本站不存儲任何數據與內容,任何內容與數據均與本站無關,如有需要請聯繫相關搜索引擎包括但不限於百度,google,bing,sogou 等
© 2025 qciss.net All Rights Reserved. 小哈圖書下載中心 版权所有