Combinatorics of Set PartitionsCRC Press, 27 de jul. 2012 - 516 pàgines Focusing on a very active area of mathematical research in the last decade, Combinatorics of Set Partitions presents methods used in the combinatorics of pattern avoidance and pattern enumeration in set partitions. Designed for students and researchers in discrete mathematics, the book is a one-stop reference on the results and research activities |
Continguts
| 1 | |
2 Basic Tools of the Book | 31 |
3 Preliminary Results on Set Partitions | 75 |
4 Subword Statistics on Set Partitions | 107 |
5 Nonsubword Statistics on Set Partitions | 165 |
6 Avoidance of Patterns in Set Partitions | 223 |
7 Multi Restrictions on Set Partitions | 307 |
8 Asymptotics and Random Set Partition | 379 |
B Identities | 501 |
C Power Series and Binomial Theorem | 503 |
D Chebychev Polynomials of the Second Kind | 507 |
E Linear Algebra and Algebra Review | 511 |
F Complex Analysis Review | 513 |
G Coherent States | 517 |
H C++ Programming | 519 |
I Tables | 537 |
9 Gray Codes Loopless Algorithms and Set Partitions | 423 |
10 Set Partitions and Normal Ordering | 439 |
A Solutions and Hints | 473 |
J Notation | 543 |
Bibliography | 547 |
Altres edicions - Mostra-ho tot
Frases i termes més freqüents
according algorithm alphabet applying asymptotic avoids Bell bijection blocks called cells Chapter classes Clearly coefficients column Combin combinatorial completes compute consider contains continue contractions Corollary corresponding counts crossing curword define Definition denote derive diagram Direction elements empty enumeration equals equivalent exactly Example Exercise explicit formula expression fact Figure fixed following result function given gives Gray code Hence implies instance integer interested Lemma letter linear Mansour Math mean namely normal ordering Note number of set obtain occurrences operator partitions of n partitions of Pn,k paths permutations polynomial positions present proof Proposition Prove records recurrence relation refer representation respectively result rook satisfies sequence set partitions statistics steps Stir(n subsequence pattern subword pattern Table Theorem tion tree values write