The language of self-avoiding walks

Let $X=(V\!X,E\!X)$ be an infinite, locally finite, connected graph without loops or multiple edges. We consider the edges to be oriented, and $E\!X$ is equipped with an involution which inverts the orientation. Each oriented edge is labelled by an element of a finite alphabet $\mathbf{\Sigma}$. The...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Lindorfer, Christian, Woess, Wolfgang
Format:	Artikel
Sprache:	eng
Schlagworte:	Mathematics - Combinatorics Mathematics - Group Theory
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!