Related papers: Lattice stick number of spatial graphs
The lattice stick number $s_L(K)$ of a knot $K$ is defined to be the minimal number of straight line segments required to construct a stick presentation of $K$ in the cubic lattice. In this paper, we find an upper bound on the lattice stick…
The lattice stick number of a knot type is defined to be the minimal number of straight line segments required to construct a polygon presentation of the knot type in the cubic lattice. In this paper, we mathematically prove that the…
For a nontrivial knot $K$, Negami found an upper bound on the stick number $s(K)$ in terms of its crossing number $c(K)$ which is $s(K) \leq 2 c(K)$. Later, Huh and Oh utilized the arc index $\alpha(K)$ to present a more precise upper bound…
The cubic lattice stick index of a knot type is the least number of sticks necessary to construct the knot type in the 3-dimensional cubic lattice. We present the cubic lattice stick index of various knots and links, including all…
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…
The lattice stick number $s_L(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 found a general upper bound $s_L(K) \leq 3…
An equilateral stick number $s_{=}(K)$ of a knot $K$ is defined to be the minimal number of sticks required to construct a polygonal knot of $K$ which consists of equal length sticks. Rawdon and Scharein [12] found upper bounds for the…
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…
Let $\mbox{Len}(K)$ be the minimum length of a knot on the cubic lattice (namely the minimum length necessary to construct the knot in the cubic lattice). This paper provides upper bounds for $\mbox{Len}(K)$ of a nontrivial knot $K$ in…
The stick number and the edge length of a knot type in the simple hexagonal lattice (sh-lattice) are the minimal numbers of sticks and edges required, respectively, to construct a knot of the given type in sh-lattice. By introducing a…
Two isomorphic graphs can have inequivalent spatial embeddings in 3-space. In this way, an isomorphism class of graphs contains many spatial graph types. A common way to measure the complexity of a spatial graph type is to count the minimum…
We give a simple example showing that a knot or link diagram that lies in the ${\mathbb{Z}}^2$ lattice is not necessarily the projection of a lattice stick knot or link in the ${\mathbb{Z}}^3$ lattice, and we give a necessary and sufficient…
The stick number of a knot is the minimum number of segments needed to build a polygonal version of the knot. Despite its elementary definition and relevance to physical knots, the stick number is poorly understood: for most knots we only…
We introduce an alternative stratification of knots: by the size of lattice on which a knot can be first met. Using this classification, we find ratio of unknots and knots with more than 10 minimal crossings inside different lattices and…
Negami found an upper bound on the stick number $s(K)$ of a nontrivial knot $K$ in terms of the minimal crossing number $c(K)$ of the knot which is $s(K) \leq 2 c(K)$. Furthermore McCabe proved $s(K) \leq c(K) + 3$ for a $2$-bridge knot or…
The stick index of a knot is the least number of line segments required to build the knot in space. We define two analogous 2-dimensional invariants, the planar stick index, which is the least number of line segments in the plane to build a…
In 1991, Negami found an upper bound on the stick number $s(K)$ of a nontrivial knot $K$ in terms of the minimal crossing number $c(K)$ of the knot which is $s(K) \leq 2 c(K)$. In this paper we improve this upper bound to $s(K) \leq…
In this paper we establish bounds on the number of vertices for a few classes of convex sublattice-free lattice polygons. The bounds are essential for proving the formula for the critical number of vertices of a lattice polygon that ensures…
Knots are commonly found in molecular chains such as DNA and proteins, and they have been considered to be useful models for structural analysis of these molecules. One interested quantity is the minimum number of monomers necessary to…
In this paper the number and lengths of minimal length lattice knots confined to slabs of width $L$, is determined. Our data on minimal length verify the results by Sharein et.al. (2011) for the similar problem, expect in a single case,…