Entanglement complexity of spanning pairs of lattice polygons
Ryan Blair, Puttipong Pongtanapaisan, Christine E. Soteros

TL;DR
This paper investigates the entanglement complexity of lattice polygons in confined spaces, extending knot theory measures to quantify linking complexity and analyzing how tube dimensions influence embeddability and entanglement.
Contribution
It introduces a new measure of spanning-link complexity based on knot theory and demonstrates its growth in large systems, also examining geometric constraints on embeddings.
Findings
Most large 2SAPs have entanglement complexity growing at least linearly with size.
Good measures of knot complexity can be extended to spanning-link complexity.
Tube dimensions impose restrictions on which links can be embedded as 2SAPs.
Abstract
We study the entanglement complexity of a system consisting of two simple-closed curves (self-avoiding polygons) that span a lattice tube, referred to as a 2SAP. 2SAPs are of interest as the first known model of confined ring polymers where the linking probability goes to 1 exponentially with the size of the system. Atapour et al proved this in 2010 by showing that all but exponentially few sufficiently large 2SAPs contain a pattern that guarantees the 2SAP is non-split, provided that the requisite pattern fits in the tube. This result was recently extended to all tubes sizes that admit non-trivial links. Here we develop and apply knot theory results to answer more general questions about the entanglement complexity of 2SAPs. We first extend the 1992 concept of a good measure of knot complexity to a good measure, , of spanning-link complexity for -component links. Using tangle…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
