Minimal knotted polygons in cubic lattices
classification
❄️ cond-mat.stat-mech
math.GN
keywords
cubicknottedpolygonsminimalcenteredlatticelatticeslength
read the original abstract
An implementation of BFACF-style algorithms on knotted polygons in the simple cubic, face centered cubic and body centered cubic lattice is used to estimate the statistics and writhe of minimal length knotted polygons in each of the lattices. Data are collected and analysed on minimal length knotted polygons, their entropy, and their lattice curvature and writhe.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.