Enumerative combinatorics Volume. II
Material type:
TextLanguage: English Series: Cambridge studies in advanced mathematics ; 62Publication details: New york Cambridge university press 1999Description: xii, 585pISBN: - 9780521789875 (PB)
Contents:
Contents:
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
BOOKS
| Home library | Call number | Materials specified | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|
| IMSc Library | 519.11 STA (Browse shelf(Opens below)) | Available | 71714 |
Contents:
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
There are no comments on this title.
Log in to your account to post a comment.