English
Related papers

Related papers: Singularity analysis via the iterated kernel metho…

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

We consider the enumeration of walks on the non-negative lattice $\mathbb{N}^d$, with steps defined by a set $\mathcal{S} \subset \{-1, 0, 1\}^d \setminus \{\mathbf{0}\}$. Previous work in this area has established asymptotics for the…

Combinatorics · Mathematics 2019-05-09 Stephen Melczer , Mark C. Wilson

A self-avoiding walk (SAW) on the square lattice is prudent if it never takes a step towards a vertex it has already visited. Prudent walks differ from most classes of SAW that have been counted so far in that they can wind around their…

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

We describe a new algorithm for the enumeration of self-avoiding walks on the square lattice. Using up to 128 processors on a HP Alpha server cluster we have enumerated the number of self-avoiding walks on the square lattice to length 71.…

Statistical Mechanics · Physics 2009-11-10 Iwan Jensen

We consider a variation of Dyck paths, where additionally to steps $(1,1)$ and $(1,-1)$ down-steps $(1,-j)$, for $j\ge2$ are allowed. We give credits to Emeric Deutsch for that. The enumeration of such objects living in a strip is…

Combinatorics · Mathematics 2021-08-31 Helmut Prodinger

Motivated by recent applications in rough volatility and regularity structures, notably the notion of singular modelled distribution, we study paths, rough paths and related objects with a quantified singularity at zero. In a pure path…

Probability · Mathematics 2024-03-13 Carlo Bellingeri , Peter K. Friz , Máté Gerencsér

The question of classifying the nature of the generating functions of restricted lattice walks has enjoyed much attention in past years. We prove that a certain class of octant walks have a D-finite generating function using the theory of…

Combinatorics · Mathematics 2017-03-21 Rika Yatchak

The aim of this article is to introduce a unified method to obtain explicit integral representations of the trivariate generating function counting the walks with small steps which are confined to a quarter plane. For many models, this…

Combinatorics · Mathematics 2012-05-16 Kilian Raschel

In this article, we study the enumeration by length of several walk models on the square lattice. We obtain bijections between walks in the upper half-plane returning to the $x$-axis and walks in the quarter plane. A recent work by Bostan,…

Combinatorics · Mathematics 2020-02-18 Frédéric Chyzak , Karen Yeats

The main theme of this dissertation is retooling methods to work for different situations. I have taken the method derived by O'Hara and simplified by Zeilberger to prove unimodality of $q$-binomials and tweaked it. This allows us to create…

Combinatorics · Mathematics 2018-04-18 Bryan Ek

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 apply results from Baryshnikov, Brady, Bressler and Pemantle (2008) to compute limiting probability profiles for various quantum random walks in one and two dimensions. Using analytic machinery we show some features of the limit…

Combinatorics · Mathematics 2009-11-23 Andrew Bressler , Torin Greenwood , Robin Pemantle , Marko Petkovsek

Consider a single walker on the slit plane, that is, the square grid Z^2 without its negative x-axis, who starts at the origin and takes his steps from a given set S. Mireille Bousquet-Melou conjectured that -- excluding pathological cases…

Combinatorics · Mathematics 2007-05-23 Martin Rubey

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 problems of enumerating lattice walks, with an arbitrary finite set of allowed steps, both in one and two dimensions, where one must always stay in the non-negative half-line and quarter-plane respectively, are used, as case studies, to…

Combinatorics · Mathematics 2015-02-17 Shalosh B. Ekhad , Doron Zeilberger

Techniques of `dynamic renormalization', developed earlier for undirected percolation and the contact model, are adapted to the setting of directed percolation, thereby obtaining solutions of several problems for directed percolation on…

Probability · Mathematics 2007-05-23 Geoffrey Grimmett , Philipp Hiemer

We study the expected distance of short uniform random walks in arbitrary dimensions with unit steps in random directions. It is known that for dimensions $d=2$ and $d=4$, all the moments of an $m$-step walk are integer. While for $d=2$,…

Combinatorics · Mathematics 2026-05-19 Sergey Kirgizov , Khaydar Nurligareev , Michael Wallner

The classical Chung-Feller theorem [2] tells us that the number of Dyck paths of length $n$ with $m$ flaws is the $n$-th Catalan number and independent on $m$. In this paper, we consider the refinements of Dyck paths with flaws by four…

Combinatorics · Mathematics 2008-12-16 Jun Ma , Yeong-Nan Yeh

In this paper we explore the asymptotic enumeration of three-dimensional excursions confined to the positive octant. As shown in [29], both the exponential growth and the critical exponent admit universal formulas, respectively in terms of…

Combinatorics · Mathematics 2019-12-25 B Bogosel , V Perrollaz , K. Raschel , A Trotignon

We analyse some enumerative and asymptotic properties of lattice paths below a line of rational slope. We illustrate our approach with Dyck paths under a line of slope $2/5$. This answers Knuth's problem #4 from his "Flajolet lecture"…

Discrete Mathematics · Computer Science 2016-10-06 Cyril Banderier , Michael Wallner