Asymptotically faster algorithm for counting self-avoiding walks and self-avoiding polygons
- 15 November 2019
- journal article
- research article
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 52 (50) , 505001
Abstract
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.Keywords
All Related Versions
Funding Information
- National Science Foundation (DGE-1656466)
This publication has 8 references indexed in Scilit:
- Exact enumeration of self-avoiding walks on BCC and FCC latticesJournal of Statistical Mechanics: Theory and Experiment, 2017
- The Self-Avoiding Walk2013
- A new transfer-matrix algorithm for exact enumerations: self-avoiding polygons on the square latticeJournal of Physics A: Mathematical and Theoretical, 2012
- Exact enumeration of self-avoiding walksJournal of Statistical Mechanics: Theory and Experiment, 2011
- Exact Enumerations2009
- Self-avoiding walk enumeration via the lace expansionJournal of Physics A: Mathematical and Theoretical, 2007
- Algebraic techniques for enumerating self-avoiding walks on the square latticeJournal of Physics A: General Physics, 1993
- Generating functions for enumerating self-avoiding rings on the square latticeJournal of Physics A: General Physics, 1980