On Parking Functions and The Tower of Hanoi
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:257SPS56record.jsonopen to challenge →
classification
math.CO
keywords
parkingdisplacementfunctionshanoiparktowerarticlebijection
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.