Enumerative combinatorics
- Pages
- 306
- 7 editions
- First published
- 1900
- 1 language
Join or log in to shelve and rate Free, no password.
Overview
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.
Ratings & reviews
Log in to rate or review this book.
No written reviews yet.
Discussions
Talk about this book with other readers.
Log in to start a discussion.
No discussions yet.
Editions
-
Format not known Wadsworth & Brooks/Cole Advanced Books & Software 1986 306 pages English ISBN 9780534065461 Open Library
-
Format not known Wadsworth & Brooks/Cole Advanced Books & Software 1900 306 pages English ISBN 9780534065461 Open Library
Details & links
- First published
- 1900
- Pages
- 306
- Languages
- Available in 1 language
Where to buy this book: see “Buy this book”
More about this book
Read a sample, borrow it or see other editions → openlibrary.org