相关论文: Algebraic area enumeration of random walks on the …

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 propose a formula for the enumeration of closed lattice random walks of length $n$ enclosing a given algebraic area. The information is contained in the Kreft coefficients which encode, in the commensurate case, the Hofstadter secular…

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 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…

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…

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 use a Hamiltonian (transition matrix) description of height-restricted Dyck paths on the plane in which generating functions for the paths arise as matrix elements of the propagator to evaluate the length and area generating function for…

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…

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,…

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…

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 two recent works \cite{BMM,BK}, it has been shown that the counting generating functions (CGF) for the 23 walks with small steps confined in a quadrant and associated with a finite group of birational transformations are holonomic, and…

We have calculated long series expansions for self-avoiding walks and polygons on the honeycomb lattice, including series for metric properties such as mean-squared radius of gyration as well as series for moments of the area-distribution…

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…

A method is described to count simple diagonal walks on $\mathbb{Z}^2$ with a fixed starting point and endpoint on one of the axes and a fixed winding angle around the origin. The method involves the decomposition of such walks into smaller…

We derive the nested Bethe Ansatz solution of the fully packed O($n$) loop model on the honeycomb lattice. From this solution we derive the bulk free energy per site along with the central charge and geometric scaling dimensions describing…

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…

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…

We consider a discrete-time random walk on the nodes of an unbounded hexagonal lattice. We determine the probability generating functions, the transition probabilities and the relevant moments. The convergence of the stochastic process to a…

We have constructed a Heisenberg-type algebra generated by the Hamiltonian, the step operators and an auxiliar operator. This algebra describes quantum systems having eigenvalues of the Hamiltonian depending on the eigenvalues of the two…