English
Related papers

Related papers: Walks avoiding a quadrant and the reflection princ…

200 papers

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 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

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

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

We consider walks on the edges of the square lattice $\mathbb Z^2$ which obey \emph{two-step rules,} which allow (or forbid) steps in a given direction to be followed by steps in another direction. We classify these rules according to a…

Combinatorics · Mathematics 2021-12-15 Nicholas R. Beaton

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 consider planar lattice walks that start from (0,0), remain inthe first quadrant i, j >= 0, and are made of three types of steps: North-East, West and South. These walks are known to have remarkable enumerative and probabilistic…

Combinatorics · Mathematics 2008-05-05 Mireille Bousquet-Mélou

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

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

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…

Combinatorics · Mathematics 2018-06-05 Alin Bostan , Mireille Bousquet-Mélou , Stephen Melczer

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 consider lattice walks in $\R^k$ confined to the region $0<x_1<x_2...<x_k$ with fixed (but arbitrary) starting and end points. The walks are required to be "reflectable", that is, we assume that the number of paths can be counted using…

Combinatorics · Mathematics 2010-12-17 Thomas Feierl

In the past 20 years, the enumeration of plane lattice walks confined to a convex cone -- normalized into the first quadrant -- has received a lot of attention, stimulated the development of several original approaches, and led to a rich…

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

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

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

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

In this article we obtain new expressions for the generating functions counting (non-singular) walks with small steps in the quarter plane. Those are given in terms of infinite series, while in the literature, the standard expressions use…

Combinatorics · Mathematics 2016-02-24 Irina Kurkova , Kilian Raschel

In the 1970s, William Tutte developed a clever algebraic approach, based on certain "invariants", to solve a functional equation that arises in the enumeration of properly colored triangulations. The enumeration of plane lattice walks…

Combinatorics · Mathematics 2025-04-11 Olivier Bernardi , Mireille Bousquet-Mélou , Kilian Raschel

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
‹ Prev 1 2 3 10 Next ›