Natural SciencesMathematicsApplied MathematicsComputational MechanicsTopologyKnot TheorySpline CurvesAnnotation EncodingKnot InvariantsLink TheoryUpper Bound Computation
Negami found an upper bound on the stick number s(K) ofa nontrivial knot K in terms of the minimal crossing number c(K) oftheknot, which is s(K) ≤ 2c(K). Furthermore, McCabe proved that s(K) ≤ c(K) +3 for a 2-bridge knot or link, except in the cases of the unlink and the Hopf link. In this paper we construct any 2-bridge knot or link K of at least six crossings by using only c(K) + 2 straight sticks. This gives a new upper bound on stick numbers of 2-bridge knots and links in terms of crossing numbers.
11
State models and the jones polynomial
Louis H. Kauffman · Topology · 1987 · 1.5K citations
A spanning tree expansion of the jones polynomial
Morwen Thistlethwaite · Topology · 1987 · 472 citations
Jones polynomials and classical conjectures in knot theory
Kunio Murasugi · Topology · 1987 · 411 citations