Abstract: The notion of noncrossing linked partition arose from the study of certain transforms in free probability theory. It is known that the number of noncrossing linked partitions of [n+1] is equal to the n-th large Schroder number , which counts the number of Schroder paths. In this paper we give a bijective proof of this result. Then we introduce the structures of linked partitions and linked cycles. We present various combinatorial properties of noncrossing linked partitions, linked partitions, and linked cycles, and connect them to other combinatorial structures and results, including increasing trees, partial matchings, k-Stirling numbers of the second kind, and the symmetry between crossings and nestings over certain linear graphs.
Recommendations
- Noncrossing linked partitions and large (3,2)-Motzkin paths
- Linked partitions and permutation tableaux
- Singly covered minimal elements of linked partitions and cycles of permutations
- Non-crossing linked partitions, the partial order βͺ on ππΆ(π), and the π-transform
- Some properties of crossings and partitions
Cites work
- scientific article; zbMATH DE number 1033382 (Why is no real title available?)
- scientific article; zbMATH DE number 1522330 (Why is no real title available?)
- scientific article; zbMATH DE number 3308309 (Why is no real title available?)
- Crossings and nestings of matchings and partitions
- Multilinear function series and transforms in free probability theory
- Noncrossing Partitions in Surprising Locations
- The On-Line Encyclopedia of Integer Sequences
Cited in
(17)- Positive and negative chains in charged moon polyominoes
- Chains of length 2 in fillings of layer polyominoes
- Linked partitions and permutation tableaux
- Bijective enumeration of general stacks
- Avoiding monotone chains in fillings of layer polyominoes
- Ascents and descents in 01-fillings of moon polyominoes
- Singly covered minimal elements of linked partitions and cycles of permutations
- Noncrossing linked partitions and large (3,2)-Motzkin paths
- Major index for 01-fillings of moon polyominoes
- Non-crossing linked partitions, the partial order βͺ on ππΆ(π), and the π-transform
- Remarks on a free analogue of the beta prime distribution
- Hecke insertion and maximal increasing and decreasing sequences in fillings of stack polyominoes
- Vacillating Hecke tableaux and linked partitions
- The parity of the number of permutation tableaux in a fixed shape
- Monobrick, a uniform approach to torsion-free classes and wide subcategories
- Wave linked partitions and 312-avoiding permutations with primacy being 1
- A semi-bijective algorithm for saturated extended 2-regular simple stacks
This page was built for publication: Linked partitions and linked cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q932823)
