Skip to main content
SpringerLink
Log in

The Holonomic Ansatz I. Foundations and Applications to Lattice Path Counting

  • Published:
Annals of Combinatorics Aims and scope Submit manuscript

Abstract.

Many combinatorial quantities belong to the holonomic ansatz. For example, sequences enumerating lattice paths. Once this fact is known, many times empirically obtained “conjectures” can be easily proved automatically.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Mathematics, Rutgers University (New Brunswick), Hill Center-Busch Campus, 110 Frelinghuysen Rd., Piscataway, NJ, 08854-8019, USA

    Doron Zeilberger

Authors
  1. Doron Zeilberger
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Doron Zeilberger.

Additional information

Accompanied by Maple packages GuessHolo2 and GuessHolo3 available from Zeilberger’s website. Supported in part by the NSF. http://www.math.rutgers.edu/~zeilberg/.

Received October 19, 2006

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zeilberger, D. The Holonomic Ansatz I. Foundations and Applications to Lattice Path Counting. Ann. Comb. 11, 227–239 (2007). https://doi.org/10.1007/s00026-007-0316-z

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00026-007-0316-z

Keywords:

AMS Subject Classification:

Search

Navigation