Asymptotically faster algorithm for counting self-avoiding walks and self-avoiding polygons

Asymptotically faster algorithm for counting self-avoiding walks and self-avoiding polygons

We give an algorithm for counting self-avoiding walks or self-avoiding polygons of length n that runs in time on 2-dimensional lattices and time on d-dimensional lattices for d  >  2.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of physics. A, Mathematical and theoretical Mathematical and theoretical, 2019-12, Vol.52 (50), p.505001
1. Verfasser: Zbarsky, Samuel
Format: Artikel
Sprache:eng
Schlagworte:
algorithms
enumeration
SAP
SAW
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We give an algorithm for counting self-avoiding walks or self-avoiding polygons of length n that runs in time on 2-dimensional lattices and time on d-dimensional lattices for d  >  2.
ISSN:1751-8113
1751-8121
DOI:10.1088/1751-8121/ab52b0