pith. sign in

arxiv: 2606.19500 · v1 · pith:7QCK7SARnew · submitted 2026-06-17 · 🧮 math.CO

On Cycles in Multiset Permutations, Parking Functions, and Related Structures

Calum Buchanan , Fabian Burghart , Stephan Wagner , Mei Yin This is my paper

Pith reviewed 2026-06-26 19:59 UTC · model grok-4.3

classification 🧮 math.CO
keywords multiset permutationsparking functionscyclesterminal closerscyclic pointscombinatorial enumerationasymptotic analysis
0
0 comments X

The pith

Multiset permutations show a correspondence between terminal closers and cyclic points that structures their cycles.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper derives exact formulas and asymptotic distributions for cycles in multiset permutations and parking functions by algebraic and analytic methods. It identifies a correspondence between the statistics of terminal closers and cyclic points on multiset permutations. This matters because multiset permutations and parking functions function as intermediate objects between mappings and permutations, so cycle statistics on them connect results across a range of combinatorial structures.

Core claim

The paper presents exact and asymptotic results on cycles in multiset permutations and parking functions, and points to a correspondence between terminal closers and cyclic points on multiset permutations that sheds light on their combinatorial structure.

What carries the argument

The correspondence between terminal closers and cyclic points, which equates two statistics on multiset permutations.

If this is right

  • Algebraic methods yield exact cycle counts for both multiset permutations and parking functions.
  • Analytic methods produce asymptotic distributions for the same cycle statistics.
  • The correspondence implies that the two statistics share the same distribution on multiset permutations.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The correspondence may allow cycle results on parking functions to transfer directly to related objects such as labeled trees or mappings.
  • Explicit bijections realizing the terminal-closer to cyclic-point match could be constructed and checked on small instances.
  • Asymptotic formulas derived here might extend to cycle statistics in other families that interpolate between mappings and permutations.

Load-bearing premise

The standard definitions of multiset permutations and parking functions allow algebraic and analytic methods to produce exact and asymptotic cycle statistics without additional hidden constraints on the underlying sets.

What would settle it

A complete enumeration of terminal closers versus cyclic points across all multiset permutations of a small multiset that yields unequal totals would disprove the claimed correspondence.

Figures

Figures reproduced from arXiv: 2606.19500 by Calum Buchanan, Fabian Burghart, Mei Yin, Stephan Wagner.

Figure 1
Figure 1. Figure 1: The digraph of the multiset permutation w = (6, 1, 2, 4, 1, 9, 1, 6, 8, 4, 2, 10) in S{1,1,1,2,2,4,4,6,6,8,9,10} which con￾sists of one 1-cycle (fixed point) (4), one 3-cycle (6, 9, 8), and tree branches hanging from the cycles. Lemma 1. For λ ⊢ i, we have a(M, λ) = ia(M, i)/zλ, where zλ = Qi j=1 j kj kj ! is as in Macdonald’s book [15, page 24]. Proof. The digraph Gw corresponding to a(M, i) comprises roo… view at source ↗
Figure 2
Figure 2. Figure 2: The digraph of the multiset permutation w ′ = (4, 9, 6, 8, 6, 1, 2, 1, 1, 4, 2, 10) in S{1,1,1,2,2,4,4,6,6,8,9,10} obtained from the multiset permutation w ∈ S{1,1,1,2,2,4,4,6,6,8,9,10} (whose digraph is depicted in [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
read the original 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.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The paper studies cycles in multiset permutations and parking functions from both algebraic and analytic perspectives. It derives exact and asymptotic cycle statistics from the standard definitions of these objects and identifies a correspondence between the statistics of terminal closers and cyclic points on multiset permutations.

Significance. If the correspondence and the derived statistics hold under the conventional definitions, the work would clarify structural relationships among mappings, multiset permutations, and parking functions, offering both enumerative formulas and asymptotic tools that could be useful in broader combinatorial enumeration.

minor comments (2)
  1. [Abstract] Abstract: the phrase 'shedding light on the combinatorial structure' is vague; replace with a concrete statement of what the correspondence implies for cycle enumeration.
  2. [Introduction] The manuscript should include a short table or list in the introduction that explicitly contrasts the new results with prior work on cycle statistics in permutations and mappings.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive summary, significance assessment, and recommendation of minor revision. No specific major comments appear in the report.

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper applies standard algebraic and analytic methods to the conventional definitions of multiset permutations and parking functions to derive exact and asymptotic cycle statistics, along with an observed correspondence between terminal closers and cyclic points. No equations, fitted parameters, self-definitional constructions, or load-bearing self-citations appear in the abstract or described structure that would reduce any claimed result to its own inputs by construction. The central correspondence is presented as a structural observation rather than a quantity defined in terms of itself, leaving the derivation self-contained against external combinatorial benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

No free parameters, invented entities, or non-standard axioms are mentioned in the abstract; the work relies on standard combinatorial definitions of multiset permutations and parking functions.

pith-pipeline@v0.9.1-grok · 5593 in / 1005 out tokens · 16761 ms · 2026-06-26T19:59:43.633168+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

23 extracted references · 13 canonical work pages

  1. [1]

    Richard Arratia, A. D. Barbour, and Simon Tavar´ e.Logarithmic combinatorial structures: a probabilistic approach. EMS Monographs in Mathematics. European Mathematical Society (EMS), Z¨ urich, 2003.doi:10.4171/000

    work page doi:10.4171/000 2003

  2. [2]

    Probabilizing parking functions.Adv

    Persi Diaconis and Angela Hicks. Probabilizing parking functions.Adv. in Appl. Math., 89:125–155, 2017.doi:10.1016/j.aam.2017.05.004

    work page doi:10.1016/j.aam.2017.05.004 2017

  3. [3]

    The combinatorial statistics database

    FindStat. The combinatorial statistics database. Database and Search Engine for Combina- torial Statistics and Maps. URL:https://www.findstat.org. CYCLES IN MULTISET PERMUTATIONS AND PARKING FUNCTIONS 17

  4. [4]

    Flajolet, P

    P. Flajolet, P. Poblete, and A. Viola. On the analysis of linear probing hashing.Algorithmica, 22(4):490–515, 1998.doi:10.1007/PL00009236

    work page doi:10.1007/pl00009236 1998

  5. [5]

    Grabner, Peter Kirschenhofer, and Helmut Prodinger

    Philippe Flajolet, Peter J. Grabner, Peter Kirschenhofer, and Helmut Prodinger. On Ramanu- jan’sQ-function.J. Comput. Appl. Math., 58(1):103–116, 1995.doi:10.1016/0377-0427(93) E0258-N

    work page doi:10.1016/0377-0427(93 1995

  6. [6]

    Philippe Flajolet and Andrew M. Odlyzko. Random mapping statistics. InAdvances in cryptology—EUROCRYPT ’89 (Houthalen, 1989), volume 434 ofLecture Notes in Com- put. Sci., pages 329–354. Springer, Berlin, 1990.doi:10.1007/3-540-46885-4\_34

    work page doi:10.1007/3-540-46885-4 1989

  7. [7]

    Mappings of acyclic and parking functions.Aequationes Math., 10:10–22, 1974.doi:10.1007/BF01834776

    Dominique Foata and John Riordan. Mappings of acyclic and parking functions.Aequationes Math., 10:10–22, 1974.doi:10.1007/BF01834776

    work page doi:10.1007/bf01834776 1974

  8. [8]

    Ira M. Gessel. Lagrange inversion.J. Combin. Theory Ser. A, 144:212–249, 2016.doi:10. 1016/j.jcta.2016.06.018

    2016

  9. [9]

    Gessel and Gilbert Labelle

    Ira M. Gessel and Gilbert Labelle. Lagrange inversion for species.J. Combin. Theory Ser. A, 72(1):95–117, 1995.doi:10.1016/0097-3165(95)90030-6

    work page doi:10.1016/0097-3165(95)90030-6 1995

  10. [10]

    I. P. Goulden and D. M. Jackson.Combinatorial enumeration. Wiley-Interscience Series in Discrete Mathematics. John Wiley & Sons, Inc., New York, 1983

    1983

  11. [11]

    Dvoretzky, J

    Leo Katz. Probability of indecomposability of a random mapping function.Ann. Math. Statist., 26:512–517, 1955.doi:10.1214/aoms/1177728496

    work page doi:10.1214/aoms/1177728496 1955

  12. [12]

    Westin King and Catherine H. Yan. Prime parking functions on rooted trees.J. Combin. Theory Ser. A, 168:1–25, 2019.doi:10.1016/j.jcta.2019.05.015

    work page doi:10.1016/j.jcta.2019.05.015 2019

  13. [13]

    Konheim and Benjamin Weiss

    Alan G. Konheim and Benjamin Weiss. An occupancy discipline and applications.SIAM J. Appl. Math., 14:1266–1274, 1966

    1966

  14. [14]

    Parking functions for mappings.J

    Marie-Louise Lackner and Alois Panholzer. Parking functions for mappings.J. Combin. The- ory Ser. A, 142:1–28, 2016.doi:10.1016/j.jcta.2016.03.001

    work page doi:10.1016/j.jcta.2016.03.001 2016

  15. [15]

    I. G. Macdonald.Symmetric functions and Hall polynomials. Oxford Mathematical Mono- graphs. The Clarendon Press, Oxford University Press, New York, second edition, 1995

    1995

  16. [16]

    On the deepest cycle of a random mapping.J

    Ljuben Mutafchiev and Steven Finch. On the deepest cycle of a random mapping.J. Combin. Theory Ser. A, 206:Paper No. 105875, 14, 2024.doi:10.1016/j.jcta.2024.105875

    work page doi:10.1016/j.jcta.2024.105875 2024

  17. [17]

    The On-Line Encyclopedia of Integer Sequences, 2026

    OEIS Foundation Inc. The On-Line Encyclopedia of Integer Sequences, 2026. Published elec- tronically athttps://oeis.org

    2026

  18. [18]

    J. E. Paguyo and M. Yin. Limit distributions for cycles of random parking functions, 2025. arXiv:2502.07110

    work page arXiv 2025

  19. [19]

    Neuer Beweis eines Satzes ¨ uber Permutationen.Archiv der Mathematik und Physik, 27:742–744, 1918

    Heinz Pr¨ ufer. Neuer Beweis eines Satzes ¨ uber Permutationen.Archiv der Mathematik und Physik, 27:742–744, 1918

    1918

  20. [20]

    A. R´ enyi. On connected graphs. I.Magyar Tud. Akad. Mat. Kutat´ o Int. K¨ ozl., 4:385–388, 1959

    1959

  21. [21]

    Ballots and trees.J

    John Riordan. Ballots and trees.J. Combinatorial Theory, 6:408–411, 1969

    1969

  22. [22]

    Fixed points and cycles of parking functions.Enumer

    Martin Rubey and Mei Yin. Fixed points and cycles of parking functions.Enumer. Comb. Appl., 5(2):Paper No. S2R10, 9, 2025.doi:10.54550/eca2025v5s2r10

    work page doi:10.54550/eca2025v5s2r10 2025

  23. [23]

    Stanley.Enumerative combinatorics

    Richard P. Stanley.Enumerative combinatorics. Vol. 2, volume 62 ofCambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 1999.doi:10.1017/ CBO9780511609589

    1999