The number of prefixes of minimal factorisations of a cycle

zbMath1344.05079MaRDI QIDQ311552

Thierry Lévy

Publication date: 13 September 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i3p35

zbMATH Keywords

non-crossing partitionsparking functionsfactorisation of cycles

Mathematics Subject Classification ID

Partitions of sets (05A18) Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Integer moments of complex Wishart matrices and Hurwitz numbers ⋮ A five-element transformation monoid on labelled trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Short factorizations of permutations into transpositions
• Hurwitz orbits of primitive factorizations of a Coxeter element.
• A solution to a problem of Dénes: A bijection between trees and factorizations of cyclic permutations
• Some properties of crossings and partitions
• Parking functions and noncrossing partitions
• Tree-like properties of cycle factorizations
• Labelled trees and factorizations of a cycle into transpositions
• Counting trees using symmetries
• Schur-Weyl duality and the heat kernel measure on the unitary group
• Permutation factorizations and prime parking functions
• Minimal factorizations of a cycle and central multiplicative functions on the infinite symmetric group
• Theory of braids
• A simple and direct derivation for the number of noncrossing partitions

This page was built for publication: The number of prefixes of minimal factorisations of a cycle