Chain enumeration and non-crossing partitions
From MaRDI portal
Publication:1144020
DOI10.1016/0012-365X(80)90033-3zbMath0443.05011OpenAlexW2029272161MaRDI QIDQ1144020
Publication date: 1980
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(80)90033-3
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81)
Related Items
Combinatorial statistics on non-crossing partitions, A family of Bell transformations, Noncrossing partitions for periodic braids, Cyclic sieving and rational Catalan theory, Large sample behaviour of high dimensional autocovariance matrices, The pruning-grafting lattice of binary trees, Some remarks on Catalan families, Ordered trees and non-crossing partitions, The rank enumeration of certain parabolic non-crossing partitions, Noncommutative symmetric functions and Lagrange inversion. II: Noncrossing partitions and the Farahat-Higman algebra, Evidence for parking conjectures, The phagocyte lattice of Dyck words, Symmetric decompositions and the strong Sperner property for noncrossing partition lattices, Fuss-Catalan matrices, their weighted sums, and stabilizer subgroups of the Riordan group, Some properties of crossings and partitions, Non-crossing partitions for classical reflection groups, On trees and noncrossing partitions, Hilbert polynomials in combinatorics, \(k\)-divisible random variables in free probability, Rational associahedra and noncrossing partitions, Enumeration of non-crossing pairings on bit strings, \(k\)-indivisible noncrossing partitions, Lattice Paths and Branched Continued Fractions: An Infinite Sequence of Generalizations of the Stieltjes–Rogers and Thron–Rogers Polynomials, with Coefficientwise Hankel-Total Positivity, Refined lattice path enumeration and combinatorial reciprocity, Quantum symmetries and strong Haagerup inequalities, Chain decomposition and the flag \(f\)-vector., Zeta polynomials and the Möbius function, Chain enumeration of \(k\)-divisible noncrossing partitions of classical types, The matrix of chromatic joins and the Temperley-Lieb algebra., Simply Generated Non-Crossing Partitions, Asymptotic distributions of Wishart type products of random matrices, Weyl group \(q\)-Kreweras numbers and cyclic sieving, EL-shellability and noncrossing partitions associated with well-generated complex reflection groups, The number of coverings in four catalan lattices, Multichains, non-crossing partitions and trees, Enumerative properties of \({\mathit NC}^{(B)}(p,q)\), On noncrossing and nonnesting partitions of type \(D\), Parking structures: Fuss analogs, A Fuss-type family of positive definite sequences, Strong Haagerup inequalities for free \(\mathfrak R\)-diagonal elements, Lagrange inversion, On the structure of the lattice of noncrossing partitions, Decomposition numbers for finite Coxeter groups and generalised non-crossing partitions, The alternating group generated by 3-cycles, Lattice path enumeration by formal schema, A simple and direct derivation for the number of noncrossing partitions, Some \(q\)-analogues of the Schröder numbers arising from combinatorial statistics on lattice paths, A basis for the non-crossing partition lattice top homology, Cataland: Why the Fuss?, Classical scale mixtures of Boolean stable laws, Some properties of the parking function poset, Some properties of the parking function poset, The noncrossing bond poset of a graph, Polynomials, meanders, and paths in the lattice of noncrossing partitions, Hopf algebras of \(m\)-permutations, \((m + 1)\)-ary trees, and \(m\)-parking functions, Combinatorics of free cumulants, Generalized noncrossing partitions and combinatorics of Coxeter groups, Strong Haagerup inequalities with operator coefficients, Permutations, parenthesis words, and Schröder numbers, A correspondence between ordered trees and noncrossing partitions, Dyck path enumeration, Unnamed Item, Riordan array approach to Lagrange inversion formulas and Chung-Feller theory, The enumeration of irreducible combinatorial objects, Multiplicative functions on the lattice of non-crossing partitions and free convolution
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
