Search arXivSearch

arXiv · 2405.03508

Galoisian structure of large steps walks in the quadrant

Abstract

The enumeration of walks in the quarter plane confined in the first quadrant has attracted a lot of attention over the past fifteenth years. The generating functions associated to small steps models satisfy a functional equation in two catalytic variables. For such models, Bousquet-Mélou and Mishna defined a group called the group of the walk which turned out to be central in the classification of small steps models. In particular, its action on the catalytic variables yields a set of change of variables compatible with the structure of the functional equation. This particular set called the orbit has been generalized to models with arbitrary large steps by Bostan, Bousquet-Mélou and Melczer. However, the orbit had till now no underlying group. In this article, we endow the orbit with the action of a Galois group, which extends the group of the walk to models with large steps. Within this Galoisian framework, we generalized the notions of invariants and decoupling. This enable us to develop a general strategy to prove the algebraicity of models with small backward steps. Our constructions lead to the first proofs of algebraicity of weighted models with large steps, proving in particular a conjecture of Bostan, Bousquet-Mélou and Melczer, and allowing us to find new algebraic models with large steps.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pierre Bonnet, Charlotte Hardouin. 2024-05-06. Galoisian structure of large steps walks in the quadrant. https://arxiv.org/abs/2405.03508

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