The Holonomic Ansatz I. Foundations and Applications to Lattice Path Counting |
| |
| Authors: | Doron Zeilberger |
| |
| Affiliation: | (1) Department of Mathematics, Rutgers University (New Brunswick), Hill Center-Busch Campus, 110 Frelinghuysen Rd., Piscataway, NJ 08854-8019, USA |
| |
| 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. Accompanied by Maple packages GuessHolo2 and GuessHolo3 available from Zeilberger’s website. Supported in part by the NSF. . Received October 19, 2006 |
| |
| Keywords: | computer-generated combinatorics lattice path enumeration |
| 本文献已被 SpringerLink 等数据库收录！ |
|
