The computational challenge of enumerating high-dimensional rook walks

Manuel Kauers; Doron Zeilberger

doi:10.1016/j.aam.2011.03.004

The computational challenge of enumerating high-dimensional rook walks

Manuel Kauers
, Doron Zeilberger

Institut für Symbolisches Rechnen

Publikation: Beitrag in Fachzeitschrift › Artikel › Begutachtung

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.

Originalsprache	Englisch
Seiten (von - bis)	813-819
Seitenumfang	7
Fachzeitschrift	Advances in Applied Mathematics
Volume	47
Ausgabenummer	4
DOIs	https://doi.org/10.1016/j.aam.2011.03.004
Publikationsstatus	Veröffentlicht - Okt. 2011

Wissenschaftszweige

101001 Algebra
101002 Analysis
101 Mathematik
102 Informatik
102011 Formale Sprachen
101009 Geometrie
101013 Mathematische Logik
101020 Technische Mathematik
101025 Zahlentheorie
101012 Kombinatorik
101005 Computeralgebra
101006 Differentialgeometrie
101003 Angewandte Geometrie
102025 Verteilte Systeme

JKU-Schwerpunkte

Computation in Informatics and Mathematics

Zugriff auf Dokument

10.1016/j.aam.2011.03.004

Andere Dateien und Links

Verknüpfung zur Publikation in Scopus

Dieses zitieren

@article{470d43ee14ea4120b487affd0ef073f5,

title = "The computational challenge of enumerating high-dimensional rook walks",

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.",

author = "Manuel Kauers and Doron Zeilberger",

year = "2011",

month = oct,

doi = "10.1016/j.aam.2011.03.004",

language = "English",

volume = "47",

pages = "813--819",

journal = "Advances in Applied Mathematics",

issn = "0196-8858",

publisher = "Elsevier",

number = "4",

}

TY - JOUR

T1 - The computational challenge of enumerating high-dimensional rook walks

AU - Kauers, Manuel

AU - Zeilberger, Doron

PY - 2011/10

Y1 - 2011/10

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/80052481294

U2 - 10.1016/j.aam.2011.03.004

DO - 10.1016/j.aam.2011.03.004

M3 - Article

SN - 0196-8858

VL - 47

SP - 813

EP - 819

JO - Advances in Applied Mathematics

JF - Advances in Applied Mathematics

IS - 4

ER -