A simple and direct derivation for the number of noncrossing partitions
From MaRDI portal
Publication:4387024
DOI10.1090/S0002-9939-98-04546-8zbMath0892.05007MaRDI QIDQ4387024
Sheng-Chyang Liaw, Gerard Jennhwa Chang, Hong-Gwa Yeh, Frank K. Hwang
Publication date: 6 May 1998
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Related Items (3)
Enumeration of Fuss-Schröder paths ⋮ The number of prefixes of minimal factorisations of a cycle ⋮ On noncrossing and nonnesting partitions of type \(D\)
Cites Work
- Unnamed Item
- A ``Fourier transform for multiplicative functions on non-crossing partitions
- Ordered trees and non-crossing partitions
- Chain enumeration and non-crossing partitions
- On the structure of the lattice of noncrossing partitions
- Some \(q\)-analogues of the Schröder numbers arising from combinatorial statistics on lattice paths
- Chains in the lattice of noncrossing partitions
- Multiplicative functions on the lattice of non-crossing partitions and free convolution
- Combinatorial statistics on non-crossing partitions
- Two combinatorial statistics on Dyck paths
- Parking functions and noncrossing partitions
- 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
This page was built for publication: A simple and direct derivation for the number of noncrossing partitions
