Combinatorics of lattice paths with and without spikes
A. Gonzalez-Arroyo
Abstract
We derive a series of results on random walks on a d-dimensional hypercubic lattice (lattice paths). We introduce the notions of terse and simple paths corresponding to the path having no backtracking parts (spikes). These paths label equivalence classes which allow a rearrangement of the sum over paths. The basic combinatorial quantities of this construction are given. These formulas are useful when performing strong coupling (hopping parameter) expansions of lattice models. Some applications are described.
Create a lesson
Related papers
Efficient Quantum Simulations of Yang-Mills theory with Maximal-tree Gauge
Tianyin Li, Ying-Ying Li, Xiaoyang Wang et al.
Physics-informed quantum algorithms for glueball-like excitations in a Z2 lattice gauge theory
Dan-Bo Zhang
Anomalous behavior of Wilson fermions in the presence of monopoles
Manuel Cortina, Rajamani Narayanan, Ray Romero
Direct lattice QCD calculation of the θ-induced CP-violating pion-nucleon coupling
Chuan-Yang Li, Jun Hua, Jian Liang et al.
Calculation of neutron electric dipole moment from Lattice QCD
Thomas Blum, Fangcheng He, Taku Izubuchi et al.
Exponential-in-Nc2 cost reduction of product-formula-based quantum simulations of quantum chromodynamics
Zohreh Davoudi, Jesse R. Stryker