An upper bound on stick numbers of knots
Abstract
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) ≤ 2 c(K). In this paper we improve this upper bound to s(K) ≤ 32 (c(K)+1). Moreover if K is a non-alternating prime knot, then s(K) ≤ 32 c(K).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.