Related papers: Walks with small steps in the quarter plane
A prototypical problem on which techniques for exact enumeration are tested and compared is the enumeration of self-avoiding walks. Here, we show an advance in the methodology of enumeration, making the process thousands or millions of…
Relations between the mean values of distributions of flipped spins on periodic Heisenberg XX chain and some aspects of enumerative combinatorics are discussed. The Bethe vectors, which are the state-vectors of the model, are considered…
Continuing earlier investigations of restricted lattice walks in $\mathbb{N}^3$, we take a closer look at the models with infinite associated groups. We find that up to isomorphism, only 12 different infinite groups appear, and we establish…
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…
Prudent walks are self-avoiding walks on the square lattice which never step into the direction of an already occupied vertex. We study the closed version of these walks, called prudent polygons, where the last vertex is adjacent to the…
In the context of lattice walk enumeration in cones, we consider the number of walks in the quarter plane with fixed starting and ending points, prescribed step-set and given length. After renormalization, this number may be interpreted as…
Quantum walks (QWs) describe particles evolving coherently on a lattice. The internal degree of freedom corresponds to a Hilbert space, called coin system. We consider QWs on Cayley graphs of some group $G$. In the literature,…
The purpose of these notes is to introduce some of the problems the enumeration of lattice walks is dedicated to and familiarize with some of the arguments they can be addressed with. We discuss the enumeration of lattice walks, their…
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…
Many widely used network centralities are based on counting walks that meet specific criteria. This paper introduces a systematic framework for walk enumeration using generating functions. We introduce a first-passage decomposition that…
We reduce the problem of counting self-avoiding walks in the square lattice to a problem of counting the number of integral points in multidimensional domains. We obtain an asymptotic estimate of the number of self-avoiding walks of length…
The Gessel number $P(n,r)$ represents the number of lattice paths in a plane with unit horizontal and vertical 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\}$. In…
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…
We consider three directed walkers on the square lattice, which move simultaneously at each tick of a clock and never cross. Their trajectories form a non-crossing configuration of walks. This configuration is said to be osculating if the…
We find a generating function expressed as a continued fraction that enumerates ordered trees by the number of vertices at different levels. Several Catalan problems are mapped to an ordered-tree problem and their generating functions also…
A growing self-avoiding walk (GSAW) is a stochastic process that starts from the origin on a lattice and grows by occupying an unoccupied adjacent lattice site at random. A sufficiently long GSAW will reach a state in which all adjacent…
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…
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…
Chen et al. recently established bijections for $(d+1)$-noncrossing/ nonnesting matchings, oscillating tableaux of bounded height $d$, and oscillating lattice walks in the $d$-dimensional Weyl chamber. Stanley asked what is the total number…
We consider the generating function of the algebraic area of lattice walks, evaluated at a root of unity, and its relation to the Hofstadter model. In particular, we obtain an expression for the generating function of the n-th moments of…