Matches in Harvard for { <http://id.lib.harvard.edu/aleph/007990464/catalog> ?p ?o. }
Showing items 1 to 25 of
25
with 100 items per page.
- catalog abstract "Publisher Description (unedited publisher data) 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. Library of Congress subject headings for this publication: Combinatorial enumeration problems.".
- catalog contributor b11082938.
- catalog created "c1997-1999.".
- catalog date "1997".
- catalog date "c1997-1999.".
- catalog dateCopyrighted "c1997-1999.".
- catalog description "Includes bibliographical references and index.".
- catalog description "Publisher Description (unedited publisher data) 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. Library of Congress subject headings for this publication: Combinatorial enumeration problems.".
- catalog description "v. 1. What is enumerative combinatorics? -- Sieve methods -- Partially ordered sets -- Rational generating functions -- Graph theory terminology -- v. 2. Trees and the composition of generating functions -- Algebraic, D-finite, and noncommutative generating functions -- Symmetric functions -- Knuth equivalence, Jeu de Taquin, and the Littlewood-Richardson rule -- The characters of GL (n, C).".
- catalog extent "2 v. :".
- catalog identifier "0521553091 (hardback : v. 1)".
- catalog identifier "0521560691 (hardback: v. 2)".
- catalog identifier "0521663512 (pbk : v. 1)".
- catalog identifier "9780521560696 (ebook)".
- catalog isPartOf "Cambridge studies in advanced mathematics ; 49, 62".
- catalog issued "1997".
- catalog issued "c1997-1999.".
- catalog language "eng".
- catalog publisher "Cambridge ; New York : Cambridge University Press,".
- catalog subject "511/.62 20".
- catalog subject "Combinatorial enumeration problems.".
- catalog subject "QA164.8 .S73 1997".
- catalog tableOfContents "v. 1. What is enumerative combinatorics? -- Sieve methods -- Partially ordered sets -- Rational generating functions -- Graph theory terminology -- v. 2. Trees and the composition of generating functions -- Algebraic, D-finite, and noncommutative generating functions -- Symmetric functions -- Knuth equivalence, Jeu de Taquin, and the Littlewood-Richardson rule -- The characters of GL (n, C).".
- catalog title "Enumerative combinatorics / Richard P. Stanley.".
- catalog type "text".