Answers are grounded in this paper and cite their sources.
The displacement of a parking function measures the total difference between where cars want to park and where they ultimately park. In this article, we prove that the set of parking functions of length n with displacement one is in bijection with the set of ideal states in the famous Tower of Hanoi game with n + 1 disks and n + 1 pegs, both sets being enumerated by the Lah numbers.
No takes yet. Share an insight, caveat, or question.
Aguillon et al. (2023) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: