The computational challenge of enumerating high-dimensional rook walks

From MaRDI portal
Publication:720594

DOI10.1016/J.AAM.2011.03.004zbMATH Open1234.05026arXiv1011.4671OpenAlexW2060715239MaRDI QIDQ720594FDOQ720594


Authors: M. Kauers, Doron Zeilberger Edit this on Wikidata


Publication date: 11 October 2011

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/1011.4671




Recommendations




Cites Work


Cited In (4)

Uses Software





This page was built for publication: The computational challenge of enumerating high-dimensional rook walks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q720594)