Related papers: Algebraic area enumeration for open lattice walks
We consider the limit distributions of open quantum random walks on one-dimensional lattice space. We introduce a dual process to the original quantum walk process, which is quite similar to the relation of Schr\"odinger-Heisenberg…
We give sharp, uniform estimates for the probability that a random walk of n steps on the reals avoids a half-line [y,infinity) given that it ends at the point x. The estimates hold for general continuous or lattice distributions provided…
We recently published [J. Phys A: Math. Theor. {\bf 45} 115202 (2012)] a new and more efficient implementation of a transfer-matrix algorithm for exact enumerations of self-avoiding polygons. Here we extend this work to the enumeration of…
We study a restricted class of self-avoiding walks (SAW) which start at the origin (0, 0), end at $(L, L)$, and are entirely contained in the square $[0, L] \times [0, L]$ on the square lattice ${\mathbb Z}^2$. The number of distinct walks…
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…
We give an algorithmic proof of Pick's theorem which calculates the area of a lattice-polygon in terms of the lattice-points.
The paper establishes a formula for enumeration of curves of arbitrary genus in toric surfaces. It turns out that such curves can be counted by means of certain lattice paths in the Newton polygon. The formula was announced earlier in…
We count the number of walks of length n on a k-node circular digraph that cover all k nodes in two ways. The first way illustrates the transfer-matrix method. The second involves counting various classes of height-restricted lattice paths.…
Pick's astonishing theorem explains how to obtain the area of any integer polygon by counting lattice points. It is a notoriously difficult challenge to translate the geometric statement and intuitive reasoning into a formal statement and…
The problem of a restricted random walk on graphs which keeps track of the number of immediate reversal steps is considered by using a transfer matrix formulation. A closed-form expression is obtained for the generating function of the…
In this paper, we investigate the distribution of $k$-free numbers in a class of $\alpha$-random walks on the integer lattice $\mathbb{Z}$. In these walks, the walker starts from a non-negative integer $r$ and moves to the right by $a$…
Osculating paths are sets of directed lattice paths which are not allowed to cross each other or have common edges, but are allowed to have common vertices. In this work we derive a constant term formula for the number of such lattice paths…
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…
Linear algebra is usually defined over a field such as the reals or complex numbers. It is possible to extend this to skew fields such as the quaternions. However, to the authors' knowledge there is no commonly accepted notation of linear…
We study the range of a planar random walk on a randomly oriented lattice, already known to be transient. We prove that the expectation of the range grows linearly, in both the quenched (for a.e. orientation) and annealed ("averaged")…
Our aim is to reprove the basic results of the theory of branches of plane algebraic curves over algebraically closed fields of arbitrary characteristic. We do not use the Hamburger-Noether expansions. Our basic tool is the logarithmic…
An interesting open problem in number theory asks whether it is possible to walk to infinity on primes, where each term in the sequence has one more digit than the previous. In this paper, we study its variation where we walk on the…
Enumeration of walks with small steps in the quadrant has been a topic of great interest in combinatorics over the last few years. In this article, it is shown how to compute exact asymptotics of the number of such walks with fixed start-…
We consider a recurrent random walk of i.i.d. increments on the one-dimensional integer lattice and obtain a formula relating the hitting distribution of a half-line with the potential function, $a(x)$, of the random walk. Applying it, we…
In this paper, we study a family of lattice walks which are related to the Hadamard conjecture. There is a bijection between paths of these walks which originate and terminate at the origin and equivalence classes of partial Hadamard…