Chain enumeration and non-crossing partitions
From MaRDI portal
Publication:1144020
DOI10.1016/0012-365X(80)90033-3zbMath0443.05011MaRDI QIDQ1144020
Publication date: 1980
Published in: Discrete Mathematics (Search for Journal in Brave)
05A15: Exact enumeration problems, generating functions
05A17: Combinatorial aspects of partitions of integers
11P81: Elementary theory of partitions
Related Items
A simple and direct derivation for the number of noncrossing partitions, Enumeration of non-crossing pairings on bit strings, The phagocyte lattice of Dyck words, Strong Haagerup inequalities with operator coefficients, A correspondence between ordered trees and noncrossing partitions, The enumeration of irreducible combinatorial objects, Some remarks on Catalan families, Ordered trees and non-crossing partitions, Zeta polynomials and the Möbius function, Multichains, non-crossing partitions and trees, On the structure of the lattice of noncrossing partitions, Lattice path enumeration by formal schema, Some \(q\)-analogues of the Schröder numbers arising from combinatorial statistics on lattice paths, Dyck path enumeration, Multiplicative functions on the lattice of non-crossing partitions and free convolution, Combinatorial statistics on non-crossing partitions, Some properties of crossings and partitions, Non-crossing partitions for classical reflection groups, On trees and noncrossing partitions, Hilbert polynomials in combinatorics, Chain decomposition and the flag \(f\)-vector., The matrix of chromatic joins and the Temperley-Lieb algebra., Combinatorics of free cumulants, Permutations, parenthesis words, and Schröder numbers, The pruning-grafting lattice of binary trees, Chain enumeration of \(k\)-divisible noncrossing partitions of classical types, Strong Haagerup inequalities for free \(\mathfrak R\)-diagonal elements, A basis for the non-crossing partition lattice top homology, The number of coverings in four catalan lattices, Decomposition numbers for finite Coxeter groups and generalised non-crossing partitions, Polynomials, meanders, and paths in the lattice of noncrossing partitions, Generalized noncrossing partitions and combinatorics of Coxeter groups
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Terms and cyclic permutations
- 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
- Functional Composition Patterns and Power Series Reversion
