Search arXivSearch

arXiv · 2509.22464

On the D-finiteness of generating functions counting small steps walks in the quadrant

Abstract

The enumeration of small steps walks confined to the first quadrant of the plane has attracted a lot of attention over the past fifteen years. The associated generating functions are trivariate formal power series in $x,y,t$ where the parameter $t$ encodes the length of the walk while the variables $x,y$ correspond to the coordinates of its ending point. These functions satisfy a functional equation in two catalytic variables. Bousquet-Mélou and Mishna have associated to any small steps model an algebraic curve called the kernel curve and a group called the group of the walk. These two objects turned out to be central in the classification of small steps models. In a recent work, Dreyfus, Elvey Price, and Raschel prove that the group of the walk is finite if and only if the generating function is $D$-finite, that is, it satisfies a linear differential equation with polynomial coefficients in each of its variables $x,y,t$. In this paper, we show that if the group of the walk is infinite, the generating function doesn't satisfy a linear differential equation in $x,y$ or $t$ over the field $\mathbb{Q}(x,y,t)$. The proof of Dreyfus, Elvey Price, and Raschel is based on some singularity analysis. Here, we propose a new strategy which relies essentially on the aforementioned functional equation and on algebraic arguments. This point of view sheds also a new light on the algebraic nature of the generating functions of small steps models since it relates their $D$-finiteness more directly to some geometric properties of the kernel curve.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Charlotte Hardouin. 2025-09-26. On the D-finiteness of generating functions counting small steps walks in the quadrant. https://arxiv.org/abs/2509.22464

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO