arXiv subjects

Christine E. Soteros

Publications and source records attributed to Christine E. Soteros.

4 recordsLinked to original sources

arXiv2026

Entanglement complexity of spanning pairs of lattice polygons

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, $F$, of spanning-link complexity for $k$-component links. Using tangle products, we show, for example, that the more complex the prime knot decomposition of any component of a given link type, the greater its $F$-measure. We then prove that all but exponentially few size $m$ 2SAPs have $F$ complexity that grows at least linearly in $m$ as $m\to \infty$. We establish that good measures of knot complexity yield good measures of spanning-link complexity. We also establish conditions whereby more general link invariants can yield good measures. In particular, we establish that measures based on several classical invariants are good measures by our definition, eg bridge number or the splitting number. Finally, we consider how the tube dimensions affect which links are embeddable as 2SAPs as well as geometric restrictions on the entanglement complexity of the embeddings. For example, we establish that there are two-component links that occur as 2SAPs in a given tube size only when one of the components is forced into a non-minimal bridge number conformation.

math.GT↗

arXiv2025

Entanglement statistics of polymers in a lattice tube and unknotting of 4-plats

The Knot Entropy Conjecture states that the exponential growth rate of the number of $n$-edge lattice polygons with knot-type $K$ is the same as that for unknot polygons. Moreover, the next order growth follows a power law in $n$ with an exponent that increases by one for each prime knot in the knot decomposition of $K$. We provide the first proof of this conjecture by considering knots and non-split links in tube $\mathbb{T}^*$, an $\infty \times 2\times 1$ sublattice of the simple cubic lattice. We establish upper and lower bounds relating the asymptotics of the number of $n$-edge polygons with fixed link-type in $\mathbb{T}^*$ to that of the number of $n$-edge unknots. For the upper bound, we prove that polygons can be unknotted by braid insertions. For the lower bound, we prove a pattern theorem for unknots using information from exact transfer-matrices. This work provides new knot theory results for 4-plats and new combinatorics results for lattice polygons. Connections to modelling polymers such as DNA in nanochannels are highlighted.

math.GT↗

arXiv2018

Knotting statistics for polygons in lattice tubes

We study several related models of self-avoiding polygons in a tubular subgraph of the simple cubic lattice, with a particular interest in the asymptotics of the knotting statistics. Polygons in a tube can be characterised by a finite transfer matrix, and this allows for the derivation of pattern theorems, calculation of growth rates and exact enumeration. We also develop a static Monte Carlo method which allows us to sample polygons of a given size directly from a chosen Boltzmann distribution. Using these methods we accurately estimate the growth rates of unknotted polygons in the $2\times1\times\infty$ and $3\times1\times\infty$ tubes, and confirm that these are the same for any fixed knot-type $K$. We also confirm that the entropic exponent for unknots is the same as that of all polygons, and that the exponent for fixed knot-type $K$ depends only on the number of prime factors in the knot decomposition of $K$. For the simplest knot-types, this leads to a good approximation for the polygon size at which the probability of the given knot-type is maximized, and in some cases we are able to sample sufficiently long polygons to observe this numerically.

cond-mat.stat-mech↗

arXiv2018

Characterising knotting properties of polymers in nanochannels

Using a lattice model of polymers in a tube, we define one way to characterise different configurations of a given knot as either "local" or "non-local" and, for several ring polymer models, we provide both theoretical and numerical evidence that, at equilibrium, the non-local configurations are more likely than the local ones. These characterisations are based on a standard approach for measuring the "size" of a knot within a knotted polymer chain. The method involves associating knot-types to subarcs of the chain, and then identifying a knotted subarc with minimal arclength; this arclength is then the knot-size. If the resulting knot-size is small relative to the whole length of the chain, then the knot is considered to be localised or "local". If on the other hand the knot-size is comparable to the length of the chain, then the knot is considered to be "non-local". Using this definition, we establish that all but exponentially few sufficiently long self-avoiding polygons (closed chains) in a tubular sublattice of the simple cubic lattice are "non-locally" knotted. This is shown to also hold for the case when the same polygons are subject to an external tensile force, as well as in the extreme case when they are as compact as possible (no empty lattice sites). We also provide numerical evidence for small tube sizes that at equilibrium non-local knotting is more likely than local knotting, regardless of the strength of the stretching or compressing force. We note however that because of the tube confinement, the occurrence of non-local knotting in walks (open chains) is significantly different than for polygons. The relevance of these results to recent experiments involving DNA knots in solid-state nanopores is also discussed.

math.CO↗