Related papers: Lattice walks ending on a coordinate hyperplane av…
We consider the problem of counting lattice points contained in domains in $\mathbb{R}^d$ defined by products of linear forms and we show that the normalized discrepancies in these counting problems satisfy non-degenerate Central Limit…
In this paper, we enumerate two families of pattern-avoiding permutations: those avoiding the vincular pattern $2-41-3$, which we call semi-Baxter permutations, and those avoiding the vincular patterns $2-41-3$, $3-14-2$ and $3-41-2$, which…
In the quarter plane, five lattice path models with unit steps have resisted the otherwise general approach of Fayolle, Rachel, and Kurkova. Here we consider these five models, called the singular models, and prove that the generating…
We have extended the enumeration of self-avoiding walks on the Manhattan lattice from 28 to 53 steps and for self-avoiding polygons from 48 to 84 steps. Analysis of this data suggests that the walk generating function exponent gamma =…
We find a generating function for interval-closed sets of the product of two chains poset by constructing a bijection to certain bicolored Motzkin paths. We also find a functional equation for the generating function of interval-closed sets…
We study self-avoiding walks on restricted square lattices, more precisely on the lattice strips $\mathbb{Z} \times \{-1,0,1\}$ and $\mathbb{Z}\times \{-1,0,1,2\}$. We obtain the value of the connective constant for the $\mathbb{Z} \times…
In this paper we show how polynomial walks can be used to establish a twisted recurrence for sets of positive density in $\mathbb{Z}^d$. In particular, we prove that if $\Gamma \leq \operatorname{GL}_d(\mathbb{Z})$ is finitely generated by…
Let a and b be two positive integers. A culminating path is a path of Z^2 that starts from (0,0), consists of steps (1,a) and (1,-b), stays above the x-axis and ends at the highest ordinate it ever reaches. These paths were first…
In [1], the authors consider a random walk $(Z_{n,1},\ldots,Z_{n,K+1})\in \mathbb{Z}^{K+1}$ with the constraint that each coordinate of the walk is at distance one from the following one. A functional central limit theorem for the first…
This paper concerns a random walk that moves on the integer lattice and has zero mean and a finite variance. We obtain first an asymptotic estimate of the transition probability of the walk absorbed at the origin, and then, using the…
In this article we are interested in finding positive discrete harmonic functions with Dirichlet conditions in three quadrants. Whereas planar lattice (random) walks in the quadrant have been well studied, the case of walks avoiding a…
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…
In this paper we consider an irreducible random walk on the integer lattice $\mathbb{Z}$ that is in the domain of normal attraction of a strictly stable process with index $\alpha\in (1, 2)$ and obtain the asymptotic form of the…
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…
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…
In this note we derive an exact formula for the Green's function of the random walk on different subspaces of the discrete lattice (orthants, including the half space, and the strip) without killing on the boundary in terms of the Green's…
In this paper we study the number of returns to the coordinate hyperplanes for multidimensional nearest-neighbour random walks. While one-dimensional results on returns are classical, much less is known in higher dimensions. We analyse the…
This is an exposition of the theorem from the title, which says that the number of self-avoiding walks with n steps in the hexagonal lattice has asymptotics (2cos(pi/8))^{n+o(n)}. We lift the key identity to formal level and simplify the…
We consider random paths on a square lattice which take a left or a right turn at every vertex. The possible turns are taken with equal probability, except at a vertex which has been visited before. In such case the vertex is left via the…
Koroljuk gave a summation formula for counting the number of lattice paths from $(0,0)$ to $(m,n)$ with $(1,0), (0,1)$-steps in the plane that stay strictly above the line $y=k(x-d)$, where $k$ and $d$ are positive integers. In this paper…