Manuel Kauers, Doron Zeilberger,
"The computational challenge of enumerating high-dimensional rook walks"
, Serie ArXiv, Nummer 1011.4671, ArXiv, http://arxiv.org, 11-2010
The computational challenge of enumerating high-dimensional rook walks
Sprache des Titels:
We provide guessed recurrence equations for the counting sequences of rook paths on d-dimensional chess boards starting at (0..0) and ending at (n..n), where d=2,3,...,12. Our recurrences suggest refined asymptotic formulas of these sequences. Rigorous proofs of the guessed recurrences as well as the suggested asymptotic forms are posed as challenges to the reader.