pith. sign in

arxiv: cond-mat/0303481 · v1 · submitted 2003-03-22 · ❄️ cond-mat.stat-mech · cond-mat.soft

Average size of random polygons with fixed knot topology

classification ❄️ cond-mat.stat-mech cond-mat.soft
keywords polygonsrandomrangeaverageexponentfixedknotsimeq
0
0 comments X
read the original abstract

We have evaluated by numerical simulation the average size $R_K$ of random polygons of fixed knot topology $K = \emptyset, 3_1, 3_1\sharp4_1$, and we have confirmed the scaling law $R^2_K \sim N^{2\nu_K}$ for the number $N$ of polygonal nodes in a wide range; $N = 100$ -- 2200. The best fit gives $2 \nu_K \simeq 1.11$ -- 1.16 with good fitting curves in the whole range of $N$. The estimate of $2 \nu_K$ is consistent with the exponent of self-avoiding polygons. In a limited range of $N$ ($N \gtrsim 600$), however, we have another fit with $2 \nu_K \simeq 1.01$ -- 1.07, which is close to the exponent of random polygons.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.