相关论文: The algebraic area of closed lattice random walks

We obtain an explicit formula to enumerate closed random walks on a cubic lattice with a specified length and 3D algebraic area. The 3D algebraic area is defined as the sum of algebraic areas obtained from the walk's projection onto the…

We study the enumeration of closed walks of given length and algebraic area on the honeycomb lattice. Using an irreducible operator realization of honeycomb lattice moves, we map the problem to a Hofstadter-like Hamiltonian and show that…

We calculate the number of open walks of fixed length and algebraic area on a square planar lattice by an extension of the operator method used for the enumeration of closed walks. The open walk area is defined by closing the walks with a…

Using a connection between the $q$-oscillator algebra and the coefficients of the high temperature expansion of the frustrated Gaussian spin model, we derive an exact formula for the number of closed random walks of given length and area,…

We derive explicit closed-form expressions for the generating function $C_N(A)$, which enumerates classical closed random walks on square and triangular lattices with $N$ steps and a signed area $A$, characterized by the number of moves in…

We study the area distribution of closed walks of length $n$, beginning and ending at the origin. The concept of area of a walk in the square lattice is generalized and the usefulness of the new concept is demonstrated through a simple…

When random walks on a square lattice are biased horizontally to move solely to the right, the probability distribution of their algebraic area can be exactly obtained. We explicitly map this biased classical random system on a non…

We give a summary of recent progress on the signed area enumeration of closed walks on planar lattices. Several connections are made with quantum mechanics and statistical mechanics. Explicit combinatorial formulae are proposed which rely…

We establish a connection between exclusion statistics with arbitrary integer exclusion parameter $g$ and a class of random walks on planar lattices. This connection maps the generating function for the number of closed walks of given…

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…

Explicit algebraic area enumeration formulae are derived for various lattice walks generalizing the canonical square lattice walk, and in particular for the triangular lattice chiral walk recently introduced by the authors. A key element in…

In the worldline formalism, scalar Quantum Electrodynamics on a 2-dimensional lattice is related to the areas of closed loops on this lattice. We exploit this relationship in order to determine the general structure of the moments of the…

The algebraic area probability distribution of closed planar random walks of length N on a square lattice is considered. The generating function for the distribution satisfies a recurrence relation in which the combinatorics is encoded. A…

For any positive integer $n$ along with parameters $\alpha$ and $\nu$, we define and investigate $\alpha$-shifted, $\nu$-offset, floor sequences of length $n$. We find exact and asymptotic formulas for the number of integers in such a…

We focus on the algebraic area probability distribution of planar random walks on a square lattice with $m_1$, $m_2$, $l_1$ and $l_2$ steps right, left, up and down. We aim, in particular, at the algebraic area generating function…

We describe a new algebraic technique for enumerating self-avoiding walks on the rectangular lattice. The computational complexity of enumerating walks of $N$ steps is of order $3^{N/4}$ times a polynomial in $N$, and so the approach is…

Formulas are derived for counting walks in the Kronecker product of graphs, and the associated spectral distributions are obtained by the Mellin convolution of probability distributions. Two-dimensional restricted lattices admitting the…

Quantum algorithms for searching one or more marked items on a d-dimensional lattice provide an extension of Grover's search algorithm including a spatial component. We demonstrate that these lattice search algorithms can be viewed in terms…

Using the results obtained by the non commutative geometry techniques applied to the Harper equation, we derive the areas distribution of random walks of length $ N $ on a two-dimensional square lattice for large $ N $, taking into account…

Trying to enumerate all of the walks in a 2D lattice is a fun combinatorial problem and there are numerous applications, from polymers to sports. Computers provide a wonderful tool for analyzing these walks; we provide a Maple package for…