Transitive cycle factorizations and prime parking functions
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 it. (C) 2003 Elsevier Inc. All rights reserved.
- Publisher
- ACADEMIC PRESS INC ELSEVIER SCIENCE
- Issue Date
- 2003-10
- Language
- English
- Article Type
- Article
- Keywords
TRANSPOSITIONS; TREES
- Citation
JOURNAL OF COMBINATORIAL THEORY SERIES A, v.104, no.1, pp.125 - 135
- ISSN
- 0097-3165
- Appears in Collection
- MA-Journal Papers(저널논문)
- Files in This Item
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 5 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.