Pages that link to "Item:Q1144020"
From MaRDI portal
The following pages link to Chain enumeration and non-crossing partitions (Q1144020):
Displaying 50 items.
- Cyclic sieving and rational Catalan theory (Q281582) (← links)
- Large sample behaviour of high dimensional autocovariance matrices (Q282456) (← links)
- Evidence for parking conjectures (Q346446) (← links)
- Rational associahedra and noncrossing partitions (Q396899) (← links)
- Quantum symmetries and strong Haagerup inequalities (Q411364) (← links)
- EL-shellability and noncrossing partitions associated with well-generated complex reflection groups (Q458605) (← links)
- Parking structures: Fuss analogs (Q478355) (← links)
- Enumeration of non-crossing pairings on bit strings (Q616445) (← links)
- Enumerative properties of \({\mathit NC}^{(B)}(p,q)\) (Q659631) (← links)
- On noncrossing and nonnesting partitions of type \(D\) (Q659657) (← links)
- The phagocyte lattice of Dyck words (Q862973) (← links)
- Strong Haagerup inequalities with operator coefficients (Q1044530) (← links)
- A correspondence between ordered trees and noncrossing partitions (Q1050987) (← links)
- The enumeration of irreducible combinatorial objects (Q1072554) (← links)
- Some remarks on Catalan families (Q1100466) (← links)
- Ordered trees and non-crossing partitions (Q1103619) (← links)
- Zeta polynomials and the Möbius function (Q1147727) (← links)
- Multichains, non-crossing partitions and trees (Q1170241) (← links)
- On the structure of the lattice of noncrossing partitions (Q1185097) (← links)
- Lattice path enumeration by formal schema (Q1197397) (← links)
- Some \(q\)-analogues of the Schröder numbers arising from combinatorial statistics on lattice paths (Q1209637) (← links)
- Dyck path enumeration (Q1300974) (← links)
- Multiplicative functions on the lattice of non-crossing partitions and free convolution (Q1322074) (← links)
- Combinatorial statistics on non-crossing partitions (Q1328401) (← links)
- Some properties of crossings and partitions (Q1377744) (← links)
- Non-crossing partitions for classical reflection groups (Q1377877) (← links)
- On trees and noncrossing partitions (Q1383385) (← links)
- Hilbert polynomials in combinatorics (Q1383811) (← links)
- Chain decomposition and the flag \(f\)-vector. (Q1399906) (← links)
- The matrix of chromatic joins and the Temperley-Lieb algebra. (Q1410733) (← links)
- Combinatorics of free cumulants (Q1570758) (← links)
- Permutations, parenthesis words, and Schröder numbers (Q1584395) (← links)
- A family of Bell transformations (Q1618218) (← links)
- Weyl group \(q\)-Kreweras numbers and cyclic sieving (Q1712898) (← links)
- The alternating group generated by 3-cycles (Q1745130) (← links)
- Riordan array approach to Lagrange inversion formulas and Chung-Feller theory (Q2111196) (← links)
- The rank enumeration of certain parabolic non-crossing partitions (Q2152767) (← links)
- Noncommutative symmetric functions and Lagrange inversion. II: Noncrossing partitions and the Farahat-Higman algebra (Q2155935) (← links)
- \(k\)-indivisible noncrossing partitions (Q2186834) (← links)
- Hopf algebras of \(m\)-permutations, \((m + 1)\)-ary trees, and \(m\)-parking functions (Q2307437) (← links)
- Noncrossing partitions for periodic braids (Q2363356) (← links)
- The pruning-grafting lattice of binary trees (Q2378517) (← links)
- Symmetric decompositions and the strong Sperner property for noncrossing partition lattices (Q2397710) (← links)
- Fuss-Catalan matrices, their weighted sums, and stabilizer subgroups of the Riordan group (Q2401278) (← links)
- \(k\)-divisible random variables in free probability (Q2411308) (← links)
- Chain enumeration of \(k\)-divisible noncrossing partitions of classical types (Q2431251) (← links)
- Strong Haagerup inequalities for free \(\mathfrak R\)-diagonal elements (Q2460016) (← links)
- A basis for the non-crossing partition lattice top homology (Q2494274) (← links)
- The number of coverings in four catalan lattices (Q2710772) (← links)
- Classical scale mixtures of Boolean stable laws (Q2790641) (← links)
