Publication Date
7-13-2026
Document Type
Conference Proceeding
Organizational Units
College of Natural Science and Mathematics, Mathematics
Keywords
Parking functions, Multiset permutation, Cycle type, Cyclic point, Terminal closer, Equivalence of ensembles
Abstract
In this paper we study cycles in multiset permutations and parking functions. As combinatorial objects, multiset permutations are essential building blocks for mappings and permutations, while parking functions lie between mappings and permutations. We take both algebraic and analytic views in our investigation and present exact as well as asymptotic results. We point to a surprising correspondence between two statistics on multiset permutations, terminal closers and cyclic points, shedding light on the combinatorial structure.
Copyright Date
7-13-2026
Copyright Statement / License for Reuse

This work is licensed under a Creative Commons Attribution 4.0 International License.
Rights Holder
The Authors
Provenance
Received from author
File Format
application/pdf
Language
English (eng)
Extent
17 pgs
File Size
779 KB
Publication Statement
Copyright is held by the authors. User is responsible for all copyright compliance. Article originally published as:
Buchanan, C., Burghart, F., Wagner, S., & Yin, M. (2026). On cycles in multiset permutations, parking functions, and related structures. In 37th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (pp. 16:1-16:17). Schloss Dagstuhl, Germany: Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.AofA.2026.16
Recommended Citation
Buchanan, C., Burghart, F., Wagner, S., & Yin, M. (2026). On cycles in multiset permutations, parking functions, and related structures. In 37th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (pp. 16:1-16:17). Schloss Dagstuhl, Germany: Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.AofA.2026.16
ISBN
9783959774352