pith. sign in

arxiv: 1209.0048 · v1 · pith:45LP76RZnew · submitted 2012-09-01 · 🧮 math.GT

Upper bound on lattice stick number of knots

classification 🧮 math.GT
keywords numberknotlatticestickboundminimalupperconstruct
0
0 comments X
read the original abstract

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 number of a nontrivial knot $K$, except trefoil knot, in terms of the minimal crossing number $c(K)$ which is $s_L(K) \leq 3 c(K) +2$. Moreover if $K$ is a non-alternating prime knot, then $s_L(K) \leq 3 c(K) - 4$.

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.