Combinatorics of lattice paths with and without spikes

Simple item page
dc.creatorGonzalez-Arroyo, A.
dc.date1999-03-28
dc.date.accessioned2026-07-07T11:34:54Z
dc.date.available2026-07-07T11:34:54Z
dc.descriptionWe 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.
dc.descriptionLatex. 25 pages
dc.identifierhttps://arxiv.org/abs/hep-lat/9903037
dc.identifierhttp://arxiv.org/abs/hep-lat/9903037
dc.identifierJ.Phys.A33:1017-1030,2000
dc.identifierdoi:10.1088/0305-4470/33/5/314
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/198419
dc.subjectHigh Energy Physics - Lattice
dc.titleCombinatorics of lattice paths with and without spikes
dc.typetext

Files

Collections

arXiv