论文标题
Rook Walks的族裔枚举
Bijective enumeration of rook walks
论文作者
论文摘要
在本文中，我们回答了R. Stanley在他的双眼证明问题中提出的一个问题（问题240）。我们提供了一个列举$ k $的小象征，一个国际棋盘可以在$ m \ times n $板上开始并在同一广场上结束。
In this paper we answer a question posed by R. Stanley in his collection of Bijection Proof Problems (Problem 240). We present a bijective proof for the enumeration of walks of length $k$ a chess rook can move along on an $m\times n$ board starting and ending on the same square.
