On Parking Functions and The Tower of Hanoi
From MaRDI portal
Publication:6170934
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 with displacement one is in bijection with the set of ideal states in the famous Tower of Hanoi game with disks and pegs, both sets being enumerated by the Lah numbers.
Recommendations
- On the enumeration of generalized parking functions
- Parking functions: from combinatorics to probability
- Probabilizing parking functions
- Parking functions on oriented trees
- Parking functions and tree inversions revisited
- Generalizing parking functions with randomness
- Parking functions, multi-shuffle, and asymptotic phenomena
- Parking functions and noncrossing partitions
- Parking on the integers
- Some aspects of (r,k)-parking functions
Cites work
Cited in
(6)- Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants
- On the lucky and displacement statistics of Stirling permutations
- Interval and -interval rational parking functions
- Probabilistic (m, n)-parking functions
- Metered parking functions
- An explicit determinant formula for hyper-Mersenne integer sequences
This page was built for publication: On Parking Functions and The Tower of Hanoi
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6170934)