Handbook of Enumerative CombinatoricsMiklos Bona CRC Press, 24 במרץ 2015 - 1086 עמודים Presenting the state of the art, the Handbook of Enumerative Combinatorics brings together the work of today's most prominent researchers. The contributors survey the methods of combinatorial enumeration along with the most frequent applications of these methods.This important new work is edited by Miklos Bona of the University of Florida where he |
תוכן
ALGEBRAIC METHODS | 1 |
Analytic Methods | 2 |
Asymptotic Normality in Enumeration | 18 |
Trees | 43 |
DISCRETE GEOMETRIC METHODS | 1 |
Planar Maps | 5 |
מהדורות אחרות - הצג הכל
מונחים וביטויים נפוצים
3-connected a₁ algebraic Algorithms applications asymptotically normal b₁ bijection binary trees bipartite C₁ Catalan numbers coefficients combinatorial compute conjecture connected graph Corollary corresponding counting Coxeter groups d₁ decomposition defined denote Discrete Math Dyck paths e₁ elements enumeration enumerative equation example exponential generating function F₁ Figure finite formula given graph G hyperplanes i< integer inversion labeled trees lattice paths Lemma linear log-concave Lyndon word Mathematics matrix matroid Möbius function Motzkin multiset nodes nonnegative number of edges obtain oriented P₁ partitions permutation planar graphs polyhedral net polytope poset power series prefix problem prove quadrangulations real-rooted recursive result rooted maps rooted planar maps rooted trees satisfies Section sequence spanning tree stable polynomials steps subgraph suffix suffix array symmetric T₁ theory triangulations Tutte polynomial unlabeled unrooted vector vertex vertices weight well-labeled trees words of length x₁