Bijective enumeration of rook walks
Abstract
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× n board starting and ending on the same square.
0