Algorithms compute F_p fractions for 762 billion self-avoiding polygons up to length 38 on square lattice, propose two conjectures, and extend to triangular lattice.
https://www-calculco
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Fast construction of self-avoiding polygons and efficient evaluation of closed walk fractions on the square lattice
Algorithms compute F_p fractions for 762 billion self-avoiding polygons up to length 38 on square lattice, propose two conjectures, and extend to triangular lattice.