Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Upper bound on lattice stick number of knots (1209.0048v1)

Published 1 Sep 2012 in math.GT

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$.

Summary

We haven't generated a summary for this paper yet.