Algebraic area enumeration for open lattice walks
arXiv:2206.12428 · doi:10.1088/1751-8121/aca573
Abstract
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 straight line across their endpoints and can assume half-integer values in lattice cell units. We also derive the length and area counting of walks with endpoints on specific straight lines and outline an approach for dealing with walks with fully fixed endpoints.
arXiv comment15 pages, 2 figures
References in corpus (9)
- Enumeration of simple random walks and tridiagonal matrices
- Exclusion statistics and lattice random walks
- The algebraic area of closed lattice random walks
- An infinite family of adsorption models and restricted Lukasiewicz paths
- Combinatorics of generalized Dyck and Motzkin paths
- Hamiltonian and exclusion statistics approach to discrete forward-moving paths
- Exclusion statistics for particles with a discrete spectrum
- Algebraic area enumeration of random walks on the honeycomb lattice
- Length and area generating functions for height-restricted Motzkin meanders