BFACF-style algorithms for polygons in the body-centered and face-centered cubic lattices
From MaRDI portal
Publication:2998050
Abstract: In this paper the elementary moves of the BFACF-algorithm for lattice polygons are generalised to elementary moves of BFACF-style algorithms for lattice polygons in the body-centred (BCC) and face-centred (FCC) cubic lattices. We prove that the ergodicity classes of these new elementary moves coincide with the knot types of unrooted polygons in the BCC and FCC lattices and so expand a similar result for the cubic lattice. Implementations of these algorithms for knotted polygons using the GAS algorithm produce estimates of the minimal length of knotted polygons in the BCC and FCC lattices.
Recommendations
- The BFACF algorithm and knotted polygons
- The writhe of polygons on the face-centred cubic lattice
- The pivot algorithm and polygons: results on the FCC lattice
- Monte Carlo results for projected self-avoiding polygons: a two-dimensional model for knotted polymers
- MINIMAL KNOTTED POLYGONS ON THE CUBIC LATTICE
Cited in
(9)- Bounds for minimum step number of knots confined to tubes in the simple cubic lattice
- The compressibility of minimal lattice knots
- The entropic pressure of a lattice polygon
- From knot invariants to knot dynamics
- Ergodicity of the BFACF algorithm in three dimensions
- Topological surfaces as gridded surfaces in geometrical spaces
- Lattice stick number of knots
- The pivot algorithm and polygons: results on the FCC lattice
- Statistical topology and knotting of fluctuating filaments
This page was built for publication: BFACF-style algorithms for polygons in the body-centered and face-centered cubic lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2998050)