Total variation threshold for uniform parking functions
A parking function is a list of preferences that lets every car park. Each car tries its preferred space and then moves forward to the next available one. For a uniformly chosen valid list of length n, how many initial preferences can be treated as independent uniform choices?
Why it matters and what counts as progress
Why it matters: Total variation measures how well the two laws agree on every event. The first entries can look independent while the effect of conditioning on successful parking still changes the joint law of a longer prefix.
What counts as progress: Find matching total-variation bounds for growing prefixes or determine the limit at the transition scale. Specify the comparison law, since independent uniform entries and independent entries with the actual marginal law give different estimates.
How the problem developed
- 19 Aug 2021 · Growing-prefix approximation [1]
Etienne Bellin Proved total-variation convergence to independent uniform choices for prefixes of length .
Igor Kortchemski with ChatGPT 6 Pro Gave matching finite bounds and determined the Gaussian limit profile when k is of order .
AI contribution
A total variation threshold for the first coordinates of uniform parking functions via Lorentzian polynomials
For the first k entries of a uniform parking function of length n, the total variation distance from k independent uniform choices is of order . If k tends to , the distance tends to , where is the standard normal distribution function. The paper also bounds relative entropy for the comparison with independent entries drawn from the actual marginal law.
Sources
Publication history
Daily emails by default, only when there’s an update.