Counting walks with large steps in an orthant
Alin Bostan (SPECFUN), Mireille Bousquet-M\'elou (LaBRI), Stephen, Melczer

TL;DR
This paper extends the study of lattice walks in the first quadrant to larger step sets, developing a generalized group approach that identifies when generating functions are D-finite and solving many complex models.
Contribution
It generalizes the group method for lattice walks to arbitrary step sets, enabling the solution of many previously intractable models and identifying conditions for D-finiteness.
Findings
240 models have finite orbits, 231 solved with the new method
9 models resist the uniform solution, likely algebraic
Most models with infinite orbits are proven non-D-finite
Abstract
In the past fifteen years, the enumeration of lattice walks with steps takenin a prescribed set S and confined to a given cone, especially the firstquadrant of the plane, has been intensely studied. As a result, the generating functions ofquadrant walks are now well-understood, provided the allowed steps aresmall, that is . In particular, having smallsteps is crucial for the definition of a certain group of bi-rationaltransformations of the plane. It has been proved that this group is finite ifand only if the corresponding generating function is D-finite (that is, it satisfies a lineardifferential equation with polynomial coefficients). This group is also thekey to the uniform solution of 19 of the 23 small step models possessing afinite group.In contrast, almost nothing is known for walks with arbitrary steps. In thispaper, we extend the definition of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
