The enumeration of irreducible combinatorial objects
From MaRDI portal
Publication:1072554
DOI10.1016/0097-3165(85)90065-2zbMath0587.05004OpenAlexW1996791260MaRDI QIDQ1072554
Publication date: 1985
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(85)90065-2
Related Items
A family of Bell transformations, Some multivariate master polynomials for permutations, set partitions, and perfect matchings, and their continued fractions, Positroids and non-crossing partitions, Sparse random block matrices, A combinatorial proof of the multivariable Lagrange inversion formula, Categorical aspects of generating functions. I: Exponential formulas and Krull-Schmidt categories, Generating asymptotics for factorially divergent sequences, Generating asymptotics for factorially divergent sequences, Enumerating meandric systems with large number of loops, From Dyck paths to standard Young tableaux, Free cumulants and enumeration of connected partitions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An asymptotic expansion for the coefficients of some power series. II: Lagrange inversion
- The asymptotic number of irreducible partitions
- The enumeration of connected graphs and linked diagrams
- Chain enumeration and non-crossing partitions
- Une théorie combinatoire des séries formelles
- Multichains, non-crossing partitions and trees
- On a class of linked diagrams. I: Enumeration
- Théorie géométrique des polynômes eulériens
- Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
- Étude et denombrement parallèles des partitions non-croisees d'un cycle et des decoupages d'un polygone convexe
- Composition sequences
- Exponential Structures
- Proportions of Irreducible Diagrams
