Counting walks by their last erased self-avoiding polygons using sieves

P. -L. Giscard

Let $G$ be an infinite, vertex-transitive lattice with degree $\lambda$ and fix a vertex on it. Consider all cycles of length exactly $l$ from this vertex to itself on $G$. Erasing loops…