English
Related papers

Related papers: Explicit expression for the generating function co…

200 papers

We interpret walks in the first quadrant with steps {(1,1),(1,0),(-1,0), (-1,-1)} as a generalization of Dyck words with two sets of letters. Using this language, we give a formal expression for the number of walks in the steps above…

Combinatorics · Mathematics 2011-04-20 Arvind Ayyer

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

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

In two recent works \cite{BMM,BK}, it has been shown that the counting generating functions (CGF) for the 23 walks with small steps confined in a quadrant and associated with a finite group of birational transformations are holonomic, and…

Probability · Mathematics 2011-01-13 Guy Fayolle , Kilian Raschel

We consider planar lattice walks that start from a prescribed position, take their steps in a given finite subset of Z^2, and always stay in the quadrant x >= 0, y >= 0. We first give a criterion which guarantees that the length generating…

Combinatorics · Mathematics 2025-09-26 Mireille Bousquet-Melou , Marko Petkovsek

We study planar walks that start from a given point (i\_0, j\_0), take their steps in a finite set S, and are confined in the first quadrant of the plane. Their enumeration can be attacked in a systematic way: the generating function Q(x,…

Combinatorics · Mathematics 2017-08-22 Mireille Bousquet-Melou

We provide a new derivation of the well-known generating function counting the number of walks on a regular tree that start and end at the same vertex, and more generally, a generating function for the number of walks that end at a vertex a…

Combinatorics · Mathematics 2009-03-12 Eric Rowland , Doron Zeilberger

This work considers lattice walks restricted to the quarter plane, with steps taken from a set of cardinality three. We present a complete classification of the generating functions of these walks with respect to the classes algebraic,…

Combinatorics · Mathematics 2007-05-23 Marni Mishna

We consider singular (aka genus $0$) walks in the quarter plane and their associated generating functions $Q(x,y,t)$, which enumerate the walks starting from the origin, of fixed endpoint (encoded by the spatial variables $x$ and $y$) and…

Combinatorics · Mathematics 2025-04-21 Alin Bostan , Lucia Di Vizio , Kilian Raschel

In the present paper we study the nature of the trivariate generating series of weighted walks in the quarter plane. Combining the results of this paper to previous ones, we complete the proof of the following theorem. The series satisfies…

Combinatorics · Mathematics 2024-10-22 Thomas Dreyfus

The exponential functional of simple, symmetric random walks with negative drift is an infinite polynomial $Y = 1 + \xi_1 + \xi_1 \xi_2 + \xi_1 \xi_2 \xi_3 + ...$ of independent and identically distributed non-negative random variables. It…

Combinatorics · Mathematics 2010-08-10 Tamas Szabados , Balazs Szekely

We present a computer-aided, yet fully rigorous, proof of Ira Gessel's tantalizingly simply-stated conjecture that the number of ways of walking $2n$ steps in the region $x+y \geq 0, y \geq 0$ of the square-lattice with unit steps in the…

Combinatorics · Mathematics 2015-05-13 Manuel Kauers , Christoph Koutschan , Doron Zeilberger

In the field of enumeration of weighted walks confined to the quarter plane, it is known that the generating functions behave very differently depending on the chosen step set; in practice, the techniques used in the literature depend on…

Combinatorics · Mathematics 2024-09-20 Thomas Dreyfus , Andrew Elvey Price , Kilian Raschel

We consider walks on a triangular domain that is a subset of the triangular lattice. We then specialise this by dividing the lattice into two directed sublattices with different weights. Our central result is an explicit formula for the…

Combinatorics · Mathematics 2014-11-25 Paul RG Mortimer , Thomas Prellberg

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

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

Many recent papers deal with the enumeration of 2-dimensional walks with prescribed steps confined to the positive quadrant. The classification is now complete for walks with steps in $\{0, \pm 1\}^2$: the generating function is D-finite if…

Combinatorics · Mathematics 2025-04-11 Alin Bostan , Mireille Bousquet-Mélou , Manuel Kauers , Stephen Melczer

The Gessel number $P(n,r)$ is the number of the paths in plane with $(1, 0)$ and $(0,1)$ steps from $(0,0)$ to $(n+r, n+r-1)$ that never touch any of the points from the set $\{(x,x)\in \mathbb{Z}^2: x\geq r\}$. We show that there is a…

Combinatorics · Mathematics 2022-06-09 Jovan Mikić

We use Galois theory of difference equations to study the nature of the generating series of (weighted) walks in the quarter plane with genus zero kernel curve. Using this approach, we prove that the generating series do not satisfy any…

Combinatorics · Mathematics 2020-11-06 Thomas Dreyfus , Charlotte Hardouin , Julien Roques , Michael F. Singer

The number of walks of $k$ steps from the node $\mathsf{0}$ to the node $\lambda$ on the representation graph (McKay quiver) determined by a finite group $\mathsf{G}$ and a $\mathsf{G}$-module $\mathsf{V}$ is the multiplicity of the…

Representation Theory · Mathematics 2017-08-31 Georgia Benkart , Dongho Moon