An upper bound on stick numbers of knots

preprint2015arXivOpen access

Abstract

In 1991, Negami found an upper bound on the stick number s(K)s(K) of a nontrivial knot KK in terms of the minimal crossing number c(K)c(K) of the knot which is s(K)≤2c(K)s(K) \leq 2 c(K). In this paper we improve this upper bound to s(K)≤32(c(K)+1)s(K) \leq \frac{3}{2} (c(K)+1). Moreover if KK is a non-alternating prime knot, then s(K)≤32c(K)s(K) \leq \frac{3}{2} c(K).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.