Transitive cycle factorizations and prime parking functions
From MaRDI portal
Publication:1417953
DOI10.1016/S0097-3165(03)00136-5zbMath1031.05012OpenAlexW1970418440WikidataQ114122468 ScholiaQ114122468MaRDI QIDQ1417953
Publication date: 6 January 2004
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0097-3165(03)00136-5
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Permutations, words, matrices (05A05)
Related Items (4)
A symmetry on parking functions via Dyck paths ⋮ Annular noncrossing permutations and minimal transitive factorizations ⋮ A combinatorial interpretation of the bijection of Goulden and Yong ⋮ Some factorisations counted by Catalan numbers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Topological classification of trigonometric polynomials and combinatorics of graphs with an equal number of vertices and edges
- A solution to a problem of Dénes: A bijection between trees and factorizations of cyclic permutations
- Parking functions and noncrossing partitions
- Minimal transitive products of transpositions---the reconstruction of a proof of A. Hurwitz
- Large \(N\) phases of chiral \(\text{QCD}_2\)
- Enumeration of planar constellations
- Parking functions of types A and B
- Tree-like properties of cycle factorizations
- Noncrossing partitions
- Labelled trees and factorizations of a cycle into transpositions
- Branch Point Structure of Covering Maps Onto Nonorientable Surfaces
- Transitive factorisations into transpositions and holomorphic mappings on the sphere
This page was built for publication: Transitive cycle factorizations and prime parking functions