A family of non-uniform distributions on the set of parking functions generated by random permutations

Abstract

We introduce a rather natural family of non-uniform distributions on PFn, n∈N, the set of parking functions of length n. One of the motivations for this comes from a similar situation in the context of integer partitions. For a permutation σ∈ Sn and for j∈[n], let In,<j(σ) denote the number of inversions in σ that involve the number j and a number less than j. Let In,<j(σ)=In,<j(σ)+1. The map (σ,τ)( In,<τ1(σ),·s, In,< τn(σ)) maps Sn× Sn onto PFn. Consider the family of distributions Pn(q)× Pn, q∈(0,∞), on Sn× Sn, where Pn is the uniform distribution on Sn and Pn(q) is the Mallows distribution with parameter q on Sn. The Mallows distributions are defined by exponential tilting via the inversion statistic. For each q>0, the above map along with the distribution Pn(q)× Pn induces an exchangeable distribution Pn(q) on PFn. We study the asymptotic behavior of two fundamental statistics of parking functions under the family of distributions Pn(q).

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…