Synopsis
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.
À propos de l?auteur
Richard P. Stanley is Professor of Applied Mathematics at the Massachusetts Institute of Technology. He has held visiting positions at UCSD, the University of Strasbourg, California Institute of Technology, the University of Augsburg, Tokai University, and the Royal Institute of Technology in Stockholm. He has published over 100 research papers in algebraic combinatorics. In addition to the two-volume Enumerative Combinatorics, he has published one other book, Combinatorics and Commutative Algebra (Birkhäuser, second edition, 1997). He is a fellow of the American Academy of Arts and Sciences, a member of the National Academy of Sciences, and a recipient of the Polya Prize in Applied Combinatorics awarded by the Society for Industrial and Applied Mathematics.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.