English
Related papers

Related papers: Transcendence of generating functions of walks on …

200 papers

In the first part of this paper, we enumerate exactly walks on the square lattice that start from the origin, but otherwise avoid the non positive horizontal half-axis. We call them "walks on the slit plane". We count them by their length,…

Combinatorics · Mathematics 2025-09-26 Mireille Bousquet-Melou , Gilles Schaeffer

Let S be a finite subset of Z^2. A walk on the slit plane with steps in S is a sequence (0,0)=w_0, w_1, ..., w_n of points of Z^2 such that w_{i+1}-w_i belongs to S for all i, and none of the points w_i, i>0, lie on the half-line H= {(k,0):…

Combinatorics · Mathematics 2025-09-26 Mireille Bousquet-Melou

We study the nature of the generating series of some models of walks with small steps in the three quarter plane. More precisely, we restrict ourselves to the situation where the group is infinite, the kernel has genus one, and the step set…

Combinatorics · Mathematics 2021-09-29 Thomas Dreyfus , Amélie Trotignon

We study nearest-neighbors walks on the two-dimensional square lattice, that is, models of walks on $\mathbb{Z}^2$ defined by a fixed step set that is a subset of the non-zero vectors with coordinates 0, 1 or $-1$. We concern ourselves with…

Combinatorics · Mathematics 2016-10-21 Alin Bostan , Frédéric Chyzak , Mark van Hoeij , Manuel Kauers , Lucien Pech

In the past decade, a lot of attention has been devoted to the enumera-tion of walks with prescribed steps confined to a convex cone. In two dimensions, this means counting walks in the first quadrant of the plane (possibly after a linear…

Combinatorics · Mathematics 2025-04-11 Mireille Bousquet-Mélou

Models of spatially homogeneous walks in the quarter plane ${\bf Z}_+^{2}$ with steps taken from a subset $\mathcal{S}$ of the set of jumps to the eight nearest neighbors are considered. The generating function $(x,y,z)\mapsto Q(x,y;z)$ of…

Combinatorics · Mathematics 2012-11-06 Irina Kurkova , Kilian Raschel

We investigate a functional equation which resembles the functional equation for the generating function of a lattice walk model for the quarter plane. The interesting feature of this equation is that its orbit sum is zero while its…

Combinatorics · Mathematics 2020-11-30 Manfred Buchacher , Manuel Kauers , Amelie Trotignon

We consider weighted small step walks in the positive quadrant, and provide algebraicity and differential transcendence results for the underlying generating functions: we prove that depending on the probabilities of allowed steps, certain…

Combinatorics · Mathematics 2021-08-25 Thomas Dreyfus , Kilian Raschel

We address the enumeration of walks with small steps confined to a two-dimensional cone, for example the quarter plane, three-quarter plane or the slit plane. In the quarter plane case, the solutions for unweighted step-sets are already…

Combinatorics · Mathematics 2023-12-20 Andrew Elvey Price

In the present paper, we use difference Galois theory to study the nature of the generating function counting walks with small steps in the quarter plane. These series are trivariate formal power series $Q(x,y,t)$ that count the number of…

Combinatorics · Mathematics 2024-10-22 Thomas Dreyfus , Charlotte Hardouin

Gessel's walks are the planar walks that move within the positive quadrant $\mathbb{Z}_{+}^{2}$ by unit steps in any of the following directions: West, North-East, East and South-West. In this paper, we find an explicit expression for the…

Combinatorics · Mathematics 2011-10-04 Irina Kurkova , Kilian Raschel

The study of lattice walks restricted to the first quadrant has shed a lot of interest in the past twenty years. In particular, there has been an important effort to classify models of weighted walks with small steps with respect to the…

Combinatorics · Mathematics 2026-03-10 Pierre Bonnet

Gessel walks are lattice walks in the quarter plane $\set N^2$ which start at the origin $(0,0)\in\set N^2$ and consist only of steps chosen from the set $\{\leftarrow,\swarrow,\nearrow,\to\}$. We prove that if $g(n;i,j)$ denotes the number…

Combinatorics · Mathematics 2009-09-12 Alin Bostan , Manuel Kauers

Around 2000, Ira Gessel conjectured that the number of lattice walks in the quadrant N^2, starting and ending at the origin (0,0) and taking their steps in {E,NE,W,SW} had a simple hypergeometric form. In the following decade, this problem…

Combinatorics · Mathematics 2025-04-11 Mireille Bousquet-Mélou

The article provides an explicit algebraic expression for the generating function of walks on graphs. Its proof is based on the scattering theory for the differential Laplace operator on non-compact graphs.

Combinatorics · Mathematics 2007-05-23 Vadim Kostrykin , Robert Schrader

We continue the enumeration of plane lattice paths avoiding the negative quadrant initiated by the first author in [Bousquet-M{\'e}lou, 2016]. We solve in detail a new case, the king walks, where all 8 nearest neighbour steps are allowed.…

Combinatorics · Mathematics 2025-04-11 Mireille Bousquet-Melou , Michael Wallner

Let S be a subset of {-1,0,1}^2 not containing (0,0). We address the enumeration of plane lattice walks with steps in S, that start from (0,0) and always remain in the first quadrant. A priori, there are 2^8 problems of this type, but some…

Combinatorics · Mathematics 2025-09-26 Mireille Bousquet-Mélou , Marni Mishna

In the present paper, we introduce a new approach, relying on the Galois theory of difference equations, to study the nature of the generating series of walks in the quarter plane. Using this approach, we are not only able to recover many…

Combinatorics · Mathematics 2019-02-25 Thomas Dreyfus , Charlotte Hardouin , Julien Roques , Michael F. Singer

Beaton, Owczarek and Xu (2019) studied generating functions of Kreweras walks and of reverse Kreweras walks in the quarter plane, with interacting boundaries. They proved that for the reverse Kreweras step set, the generating function is…

Combinatorics · Mathematics 2021-06-23 Alin Bostan , Manuel Kauers , Thibaut Verron

Two-dimensional (random) walks in cones are very natural both in combinatorics and probability theory: they are interesting for themselves and also because they are strongly related to other discrete structures. While walks restricted to…

Combinatorics · Mathematics 2019-11-07 Kilian Raschel , Amélie Trotignon
‹ Prev 1 2 3 10 Next ›