Scaling Conjecture Regarding the Number of Unknots among Polygons of N≫1 Edges
The conjecture is made based on a plausible, but not rigorous argument, suggesting that the unknot probability for a randomly generated self-avoiding polygon of N≫1 edges has only logarithmic, and not power law corrections to the known leading exponential law: Punknot(N)∼exp−N/N0+o(lnN) with N0 being referred to as the random knotting length. This conjecture is consistent with the numerical result of 2010 by Baiesi, Orlandini, and Stella.
Keyword(s):
1999 ◽
Vol 09
(10)
◽
pp. 1907-1916
◽
1999 ◽
Vol 09
(02)
◽
pp. 355-359
◽
Keyword(s):
Keyword(s):
2015 ◽
Vol 62
(4)
◽
pp. 539-546
◽
1971 ◽
Vol 10
(3-4)
◽
pp. 191-200
◽
2000 ◽
Vol 7
(2)
◽
pp. 185-207
◽