论文标题
在停车功能和河内塔上
On Parking Functions and The Tower of Hanoi
论文作者
论文摘要
停车功能的位移可以测量汽车想要停车与最终停放的位置之间的全部差异。在本文中，我们证明了一组长度为$ n $带排量的停车功能与著名的河内塔游戏中的一组理想状态进行了两者，其中包括$ n+1 $磁盘和$ n+1 $ pegs，这两套套件都被LAH数字枚举。
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.
