Transitive cycle factorizations and prime parking functions

Authors:
Dongsu Kim;Seunghyun Seo
Affiliations:
Department of Mathematics, KAIST, Daejeon 305-701, South Korea;Department of Mathematics, KAIST, Daejeon 305-701, South Korea
Venue:
Journal of Combinatorial Theory Series A
Year:
2003

Citing 6
Cited 1

Enumerative combinatorics

Enumerative combinatorics
A solution to a problem of Denes: a bijection between trees and factorizations of Cyclic permutations

European Journal of Combinatorics
Labelled trees and factorizations of a cycle into transpositions

Discrete Mathematics
Noncrossing partitions

Discrete Mathematics
Regular Article: Enumeration of Planar Constellations

Advances in Applied Mathematics
Tree-like properties of cycle factorizations

Journal of Combinatorial Theory Series A

Some factorisations counted by Catalan numbers

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Minimal transitive cycle factorizations and parking functions are related very closely. Using the correspondence between them, we find a bijection between minimal transitive factorizations of permutations of type (1, n - 1) and prime parking functions of length n.