期刊
JOURNAL OF KNOT THEORY AND ITS RAMIFICATIONS
卷 19, 期 1, 页码 27-54出版社
WORLD SCIENTIFIC PUBL CO PTE LTD
DOI: 10.1142/S0218216510007760
关键词
Linking probability; linking number; entanglement complexity; self-avoiding polygon; lattice model; polymer
类别
资金
- NSERC of Canada
- NSF [DMS-0712958]
We consider two self-avoiding polygons (2SAPs) each of which spans a tubular sub-lattice of Z(3). A pattern theorem is proved for 2SAPs, that is any proper pattern (a local configuration in the middle of a 2SAP) occurs in all but exponentially few sufficiently large 2SAPs. This pattern theorem is then used to prove that all but exponentially few sufficiently large 2SAPs are topologically linked. Moreover, we also use it to prove that the linking number Lk of an n edge 2SAP G(n) satisfies lim(n ->infinity) P(vertical bar Lk(G(n))vertical bar >= f(n)) = 1 for any function f(n) = o(root n). Hence the probability of a non zero linking number for a 2SAP approaches one as the size of the 2SAP goes to infinity. It is also established that, due to the tube constraint, the linking number of an n edge 2SAP grows at most linearly in n.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据