Étude et denombrement parallèles des partitions non-croisees d'un cycle et des decoupages d'un polygone convexe
From MaRDI portal
Publication:2557263
Cited in
(14)- The enumeration of irreducible combinatorial objects
- Ordered trees and non-crossing partitions
- Chain enumeration and non-crossing partitions
- Multichains, non-crossing partitions and trees
- Multiplicative functions on the lattice of non-crossing partitions and free convolution
- Combinatorial aspects of Davenport-Schinzel sequences
- On trees and noncrossing partitions
- Crossings and embracings of set-partitions and \(q\)-analogues of the logarithm of the Fourier transform
- Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind
- A simple and direct derivation for the number of noncrossing partitions
- Parking spaces.
- Two new integer sequences related to crossroads and Catalan numbers
- Cumulants and convolutions via Abel polynomials
- Schröder trees and antipode formulas: an application to non-commutative probability and Wick polynomials
This page was built for publication: Étude et denombrement parallèles des partitions non-croisees d'un cycle et des decoupages d'un polygone convexe
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2557263)