晶格管中聚合物的缠结统计与4-plat纽结的解结
Entanglement statistics of polymers in a lattice tube and unknotting of 4-plats
AI总结：
该研究首次在∞×2×1立方晶格子晶格管中证明纽结熵猜想，通过辫插入上界、转移矩阵模式定理下界建立固定链环型与平凡纽结多边形数的渐近关系，为4-plats纽结及晶格多边形提供新结果，关联纳米通道聚合物建模。
摘要：
纽结熵猜想指出，具有纽结类型K的n边晶格多边形数量的指数增长率与平凡纽结多边形的指数增长率相同。此外，下一阶增长遵循n的幂律，其指数随K的纽结分解中每个素纽结增加1。我们通过研究管T*（简单立方晶格的一个∞×2×1子晶格）中的纽结和非分离链环，首次证明了该猜想。我们建立了上下界，将T*中具有固定链环类型的n边多边形数量的渐近行为与n边平凡纽结的数量渐近行为关联起来。对于上界，我们证明了多边形可通过辫插入实现解结。对于下界，我们利用精确转移矩阵的信息证明了平凡纽结的模式定理。这项工作为4-plats纽结提供了新的纽结理论结果，为晶格多边形提供了新的组合学结果，并强调了其与纳米通道中DNA等聚合物建模的关联。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
