Upper bounds on the minimal length of cubic lattice knots

preprint2014arXivOpen access

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 313_1 is 2424. Also the minimal lengths of the knots 414_1 and 515_1 are known to be 3030 and 3434, respectively. In the article we find a general upper bound of the minimal length of a nontrivial knot KK, except the trefoil knot, in terms of the minimal crossing number c(K)c(K). The upper bound is 32c(K)2+2c(K)+12\frac{3}{2}c(K)^2 + 2c(K) + \frac{1}{2}. Moreover if KK is a non-alternating prime knot, then the upper bound is 32c(K)2−4c(K)+52\frac{3}{2}c(K)^2 - 4c(K) + \frac{5}{2}. Furthermore if KK is (n+1,n)(n+1,n)-torus knot, then the upper bound is 6c(K)+2c(K)+1+66 c(K) + 2 \sqrt{c(K)+1} +6.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.