The computational challenge of enumerating high-dimensional rook walks

Manuel Kauers, Doron Zeilberger

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

We present guesses, based on intensive computer algebra calculations, for recurrence equations of the sequences enumerating rook walks in up to twelve dimensions ending on the main diagonal. Computer proofs can in principle be constructed for all of them. For the moment, however, these computations are feasible only for low dimensions. We pose it as a challenge to develop algorithms which can also certify the correctness of the equations we found for the higher dimensions.

Original languageEnglish (US)
Pages (from-to)813-819
Number of pages7
JournalAdvances in Applied Mathematics
Volume47
Issue number4
DOIs
StatePublished - Oct 2011

All Science Journal Classification (ASJC) codes

  • Applied Mathematics

Keywords

  • Automated guessing
  • Computer algebra
  • Lattice walks

Fingerprint Dive into the research topics of 'The computational challenge of enumerating high-dimensional rook walks'. Together they form a unique fingerprint.

Cite this