The quasi-holonomic ansatz and restricted lattice walks
From MaRDI portal
Publication:3534870
Abstract: The great enumerator Germain Kreweras empirically discovered this intriguing fact, and then needed lots of pages[K], and lots of human ingenuity, to prove it. Other great enumerators, for example, Heinrich Niederhausen[N], Ira Gessel[G1], and Mireille Bousquet-M'elou[B], found other ingenious, ``simpler proofs. Yet none of them is as simple as ours! Our proof (with the generous help of our faithful computers) is ``ugly in the traditional sense, since it would be painful for a lowly human to follow all the steps. But according to our humble aesthetic taste, this proof is much more elegant, since it is (conceptually) one-line. So what if that line is rather long (a huge partial-recurrence equation satisfied by the general counting function), it occupies less storage than a very low-resolution photograph.
Recommendations
Cites work
- A holonomic systems approach to special functions identities
- A probabilistic method for lattice path enumeration
- An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)) multisum/integral identities
- Multi-variable Zeilberger and Almkvist-Zeilberger algorithms and the sharpening of Wilf-Zeilberger theory
- The holonomic ansatz. I: Foundations and applications to lattice path counting
- The method of differentiating under the integral sign
- Walks confined in a quadrant are not always D-finite
- Walks in the quarter plane: Kreweras' algebraic model
Cited in
(12)- Classifying lattice walks restricted to the quarter plane
- Counting quadrant walks via Tutte's invariant method (extended abstract)
- Percolation on Triangulations: A Bijective Path to Liouville Quantum Gravity
- A human proof of Gessel's lattice path conjecture
- On the algebraic area of lattice walks and the Hofstadter model
- Square lattice walks avoiding a quadrant
- INTERACTING QUARTER-PLANE LATTICE WALK PROBLEMS: SOLUTIONS AND PROOFS
- The computational challenge of enumerating high-dimensional rook walks
- Proof of Ira Gessel's lattice path conjecture
- An elementary solution of Gessel's walks in the quadrant
- On 3-dimensional lattice walks confined to the positive octant
- Computer algebra in the service of enumerative combinatorics
Describes a project that uses
Uses Software
This page was built for publication: The quasi-holonomic ansatz and restricted lattice walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3534870)
