Asymptotically faster algorithm for counting self-avoiding walks and self-avoiding polygons
type: Item
instance of: scholarly article
title: Asymptotically faster algorithm for counting self-avoiding walks and self-avoiding polygons
author: Samuel Zbarsky
published in: Journal of Physics A: Mathematical and Theoretical
publication date: 2023-01-05T00:00:00Z
full work available at URL: https://arxiv.org/abs/1903.04054
Mathematics Subject Classification ID: 81-XX
Mathematics Subject Classification ID: 82-XX
zbMATH DE Number: 7638634
zbMATH Keywords: SAW
zbMATH Keywords: SAP
zbMATH Keywords: enumeration
zbMATH Keywords: algorithms
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W3100316870
cites work: A new transfer-matrix algorithm for exact enumerations: self-avoiding polygons on the square lattice
cites work: Self-avoiding walk enumeration via the lace expansion
cites work: Algebraic techniques for enumerating self-avoiding walks on the square lattice
cites work: Exact enumeration of self-avoiding walks
cites work: Exact enumeration of self-avoiding walks on BCC and FCC lattices
cites work: Exact Enumerations
cites work: The self-avoiding walk.
DOI: 10.1088/1751-8121/AB52B0
Recommended article: Q3128922
Recommended article: Self-testing algorithms for self-avoiding walks
Recommended article: Q3062356
Recommended article: Self-avoiding walk enumeration via the lace expansion
Recommended article: The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes.
description: scientific article; zbMATH DE number 7638634