Upper bounds on the minimum length of cubic lattice knots

From MaRDI portal
Publication:4920451




Abstract: Knots have been considered to be useful models for simulating molecular chains such as DNA and proteins. One quantity that we are interested on molecular knots is the minimum number of monomers necessary to realize a knot. In this paper we consider every knot in the cubic lattice. Especially the minimal length of a knot indicates the minimum length necessary to construct the knot in the cubic lattice. Diao introduced this term (he used "minimal edge number" instead) and proved that the minimal length of the trefoil knot 31 is 24. Also the minimal lengths of the knots 41 and 51 are known to be 30 and 34, respectively. In the article we find a general upper bound of the minimal length of a nontrivial knot K, except the trefoil knot, in terms of the minimal crossing number c(K). The upper bound is frac32c(K)2+2c(K)+frac12. Moreover if K is a non-alternating prime knot, then the upper bound is frac32c(K)24c(K)+frac52. Furthermore if K is (n+1,n)-torus knot, then the upper bound is 6c(K)+2sqrtc(K)+1+6.









This page was built for publication: Upper bounds on the minimum length of cubic lattice knots

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4920451)