A simple and direct derivation for the number of noncrossing partitions
From MaRDI portal
Publication:4387024
Recommendations
Cites work
- A ``Fourier transform for multiplicative functions on non-crossing partitions
- Chain enumeration and non-crossing partitions
- Chains in the lattice of noncrossing partitions
- Combinatorial statistics on non-crossing partitions
- scientific article; zbMATH DE number 3311776 (Why is no real title available?)
- Multiplicative functions on the lattice of non-crossing partitions and free convolution
- On the structure of the lattice of noncrossing partitions
- Ordered trees and non-crossing partitions
- Parking functions and noncrossing partitions
- Some \(q\)-analogues of the Schröder numbers arising from combinatorial statistics on lattice paths
- Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
- Two combinatorial statistics on Dyck paths
- Étude et denombrement parallèles des partitions non-croisees d'un cycle et des decoupages d'un polygone convexe
Cited in
(8)- Asymptotic enumeration of non-crossing partitions on surfaces
- Noncrossing partitions
- Enumeration of Fuss-Schröder paths
- Crossed partitions
- The number of prefixes of minimal factorisations of a cycle
- Sets, Lists and Noncrossing Partitions
- The twelvefold way, the nonintersecting circles problem, and partitions of multisets
- On noncrossing and nonnesting partitions of type \(D\)
This page was built for publication: A simple and direct derivation for the number of noncrossing partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4387024)