2015/02/15 by Shalosh B. Ekhad, Doron Zeilberger, Ekhad, Shalosh B. +1 · 1 citation
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Cellular Automata and Applications #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #FOS: Mathematics #math.CO
paper · pdf · doi:10.48550/arxiv.1502.04377
14 pages, accompanied by four Maple packages obtainable from http://www.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/gac.html
arxiv created 2015/02/15 · openalex publication_date 2015/02/15 · arxiv updated 2015/02/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The problems of enumerating lattice walks, with an arbitrary finite set of allowed steps, both in one and two dimensions, where one must always stay in the non-negative half-line and quarter-plane respectively, are used, as case studies, to illustrate the `naive' methodology of guess-and-check, where rigorous proofs are possible, but not worth the trouble. We argue that this is a metaphor for future math.