Abstract:We first study the minimum total curvature of a knot when it is embedded on the cubic lattice. Let $\mathcal{K}$ be a knot or link with a lattice embedding of minimum total curvature $\tau(\mathcal{K})$ among all possible lattice embeddings of $\mathcal{K}$. We show that there exist positive constants c1 and c2 such that $c_1\sqrt{Cr(\mathcal{K})}\le \tau(\mathcal{K})\le c_2 Cr(\mathcal{K})$ for any knot type $\mathcal{K}$. Furthermore we show that the powers of $Cr(\mathcal{K})$ in the above inequalities are … Show more
“…To find the exact values of the lattice stick number of these knots, they used a lower bound on lattice stick number in terms of bridge number, s L (K) 6b(K), which was proved in [10]. Furthermore Diao and Ernst [3] found a general lower bound in terms of the crossing number c(K), which is s L (K) 3 √ c(K) + 1 + 3 for a non-trivial knot K. Recently Hong et al [5] found a general upper bound s L (K) 3c(K) + 2, and moreover s L (K) 3c(K) − 4 for a non-alternating prime knot.…”
Knots and links have been considered to be useful models for structural analysis of molecular chains such as DNA and proteins. One quantity that we are interested in for molecular links is the minimum number of monomers necessary for realizing them. In this paper we consider every link in the cubic lattice. The lattice stick number sL(L) of a link L is defined to be the minimum number of sticks required to construct a polygonal representation of the link in the cubic lattice. Huh and Oh found all knots whose lattice stick numbers are at most 14. They proved that only the trefoil knot 31 and the figure-eight knot 41 have lattice stick numbers of 12 and 14, respectively. In this paper we find all links with more than one component whose lattice stick numbers are at most 14. Indeed we prove combinatorically that , , , and any other non-split links have stick numbers of at least 15.
“…To find the exact values of the lattice stick number of these knots, they used a lower bound on lattice stick number in terms of bridge number, s L (K) 6b(K), which was proved in [10]. Furthermore Diao and Ernst [3] found a general lower bound in terms of the crossing number c(K), which is s L (K) 3 √ c(K) + 1 + 3 for a non-trivial knot K. Recently Hong et al [5] found a general upper bound s L (K) 3c(K) + 2, and moreover s L (K) 3c(K) − 4 for a non-alternating prime knot.…”
Knots and links have been considered to be useful models for structural analysis of molecular chains such as DNA and proteins. One quantity that we are interested in for molecular links is the minimum number of monomers necessary for realizing them. In this paper we consider every link in the cubic lattice. The lattice stick number sL(L) of a link L is defined to be the minimum number of sticks required to construct a polygonal representation of the link in the cubic lattice. Huh and Oh found all knots whose lattice stick numbers are at most 14. They proved that only the trefoil knot 31 and the figure-eight knot 41 have lattice stick numbers of 12 and 14, respectively. In this paper we find all links with more than one component whose lattice stick numbers are at most 14. Indeed we prove combinatorically that , , , and any other non-split links have stick numbers of at least 15.
“…Each component contains at least two x-sticks, two y-sticks and two z-sticks since both are nonplanar. We may say that (L) is one of (4, 4, 4), (4,4,5), (4,4,6) or (4,5,5). Now consider the projection of L onto an xy-plane.…”
Section: Proof Of Theoremmentioning
confidence: 99%
“…To find the exact values of the lattice stick number of these knots, they used a lower bound on lattice stick number in terms of bridge number, s L (K) ≥ 6b(K), which was proved in [11]. Furthermore Diao and Ernst [4] found a general lower bound in terms of crossing number c(K) which is s L (K) ≥ 3 c(K) + 1 + 3 for a nontrivial knot K. Recently Hong, No and Oh [6] found a general upper bound s L (K) ≤ 3c(K)+2, and moreover s L (K) ≤ 3c(K) − 4 for a non-alternating prime knot.…”
Knots and links have been considered to be useful models for structural analysis of molecular chains such as DNA and proteins. One quantity that we are interested on molecular links is the minimum number of monomers necessary to realize them. In this paper we consider every link in the cubic lattice. Lattice stick number s L (L) of a link L is defined to be the minimal number of sticks required to construct a polygonal representation of the link in the cubic lattice. Huh and Oh found all knots whose lattice stick numbers are at most 14. They proved that only the trefoil knot 3 1 and the figure-8 knot 4 1 have lattice stick numbers 12 and 14, respectively. In this paper we find all links with more than one component whose lattice stick numbers are at most 14. Indeed we prove combinatorically that s1 ) = 13, s L (5 2 1 ) = 14 and any other non-split links have stick numbers at least 15.
“…To find the exact values of the lattice stick number of these knots, they used a lower bound on lattice stick number in terms of bridge number, s L (K) ≥ 6b(K), which was proved by Janse van Rensburg and Promislow [10]. Furthermore Diao and Ernst [4] found a general lower bound in terms of crossing number c(K) which is s L (K) ≥ 3 c(K) + 1+3 for a nontrivial knot K. Hong, No and Oh [5] found a general upper bound s L (K) ≤ 3c(K)+2, and moreover s L (K) ≤ 3c(K)−4 for a non-alternating prime knot. They [6] also showed that s L (2 2 1 ) = 8, s L (2 2 1 ♯2 2 1 ) = s L (6 3 2 ) = s L (6 3 3 ) = 12, s L (4 2 1 ) = 13, s L (5 2 1 ) = 14 and any other non-split links have stick numbers at least 15.…”
The lattice stick number sL(L) of a link L is defined to be the minimal number of straight line segments required to construct a stick presentation of L in the cubic lattice. Hong, No and Oh [5] found a general upper bound sL(K) ≤ 3c(K) + 2. A rational link can be represented by a lattice presentation with exactly 4 z-sticks.An n-circuit is the disjoint union of n arcs in the lattice plane Z 2 . An n-circuit presentation is an embedding obtained from the n-circuit by connecting each n pair of vertices with one line segment above the circuit. By using a 2-circuit presentation, we can easily find the lattice presentation with exactly 4 z-sticks.In this paper, we show that an upper bound for the lattice stick number of rational p q -links realized with exactly 4 z-sticks is 2p + 6.Furthermore it is 2p + 5 if L is a 2-component link.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.