Related papers: Some reflections on directed lattice paths
Prudent walks are self-avoiding walks which cannot step towards an already occupied vertex. We introduce a new model of adsorbing prudent walks on the square lattice, which start on an impenetrable surface and accrue a fugacity $a$ with…
Lattice paths in the quarter plane have led to a large and varied set of results in recent years. One major project has been the classification of step sets according to the properties of the corresponding generating functions, and this has…
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…
Asinowski, Bacher, Banderier and Gittenberger (A. Asinowski, A. Bacher, C. Banderier and B. Gittenberger. Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown…
Polymers in confined spaces lose conformational entropy. This induces a net repulsive entropic force on the walls of the confining space. A model for this phenomenon is a lattice walk between confining walls, and in this paper a model of an…
Consider non-negative lattice paths ending at their maximum height, which will be called admissible paths. We show that the probability for a lattice path to be admissible is related to the Chebyshev polynomials of the first or second kind,…
Various lattice path models are reviewed. The enumeration is done using generating functions. A few bijective considerations are woven in as well. The kernel method is often used. Computer algebra was an essential tool. Some results are…
The degree of symmetry of a combinatorial object, such as a lattice path, is a measure of how symmetric the object is. It typically ranges from zero, if the object is completely asymmetric, to its size, if it is completely symmetric. We…
We consider a discrete random walk on a diagonal lattice in two and three dimensions and obtain explicit solutions of absorption probabilities and probabilities of return in several domains. In three dimensions we consider both the cube and…
In queuing theory, it is usual to have some models with a "reset" of the queue. In terms of lattice paths, it is like having the possibility of jumping from any altitude to zero. These objects have the interesting feature that they do not…
This article deals with the enumeration of directed lattice walks on the integers with any finite set of steps, starting at a given altitude $j$ and ending at a given altitude $k$, with additional constraints such as, for example, to never…
We consider the system of equations $A_k(x)=p(x)A_{k-1}(x)(q(x)+\sum_{i=0}^k A_i(x))$ for $k\geq r+1$ where $A_i(x)$, $0\leq i \leq r$, are some given functions and show how to obtain a close form for $A(x)=\sum_{k\geq 0}A_k(x)$. We apply…
We analyze some enumerative and asymptotic properties of Dyck paths under a line of slope 2/5.This answers to Knuth's problem \\#4 from his "Flajolet lecture" during the conference "Analysis of Algorithms" (AofA'2014) in Paris in June…
Non-negative {\L}ukasiewicz paths are special two-dimensional lattice paths never passing below their starting altitude which have only one single special type of down step. They are well-known and -studied combinatorial objects, in…
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.…
The enumeration of lattice paths in wedges poses unique mathematical challenges. These models are not translationally invariant, and the absence of this symmetry complicates both the derivation of a functional recurrence for the generating…
A recently developed model of random walks on a $D$-dimensional hyperspherical lattice, where $D$ is {\sl not} restricted to integer values, is used to study polymer growth near a $D$-dimensional attractive hyperspherical boundary. The…
We investigate neighbor-avoiding walks on the simple cubic lattice in the presence of an adsorbing surface. This class of lattice paths has been less studied using Monte Carlo simulations. Our investigation follows on from our previous…
We consider a new model of a branching random walk on a multidimensional lattice with continuous time and one source of particle reproduction and death, as well as an infinite number of sources in which, in addition to the walk, only…
We consider the model of self-avoiding walks on the $d$-dimensional hypercubic lattice interacting with a $d^*$-dimensional defect, where $1\leq d^*<d$. Such an interaction can be attractive or repulsive, and is controlled by a Boltzmann…