The holonomic ansatz. I: Foundations and applications to lattice path counting

DOI10.1007/s00026-007-0316-zzbMath1125.05008OpenAlexW2093167574MaRDI QIDQ2385105

Doron Zeilberger

Publication date: 11 October 2007

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00026-007-0316-z

zbMATH Keywords

lattice path enumerationcomputer-generated combinatorics

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)

Related Items (5)

The quasi-holonomic ansatz and restricted lattice walks ⋮ A short WZ-proof of Euler's fundamental sum identity and more ⋮ Extended rate, more GFUN ⋮ Classifying lattice walks restricted to the quarter plane ⋮ GuessHolo2

This page was built for publication: The holonomic ansatz. I: Foundations and applications to lattice path counting