Results 1 
7 of
7
The computational Complexity of Knot and Link Problems
 J. ACM
, 1999
"... We consider the problem of deciding whether a polygonal knot in 3dimensional Euclidean space is unknotted, capable of being continuously deformed without selfintersection so that it lies in a plane. We show that this problem, unknotting problem is in NP. We also consider the problem, unknotting pr ..."
Abstract

Cited by 61 (9 self)
 Add to MetaCart
(Show Context)
We consider the problem of deciding whether a polygonal knot in 3dimensional Euclidean space is unknotted, capable of being continuously deformed without selfintersection so that it lies in a plane. We show that this problem, unknotting problem is in NP. We also consider the problem, unknotting problem of determining whether two or more such polygons can be split, or continuously deformed without selfintersection so that they occupy both sides of a plane without intersecting it. We show that it also is in NP. Finally, we show that the problem of determining the genus of a polygonal knot (a generalization of the problem of determining whether it is unknotted) is in PSPACE. We also give exponential worstcase running time bounds for deterministic algorithms to solve each of these problems. These algorithms are based on the use of normal surfaces and decision procedures due to W. Haken, with recent extensions by W. Jaco and J. L. Tollefson.
The number of Reidemeister Moves Needed for Unknotting
, 2008
"... There is a positive constant c1 such that for any diagram D representing the unknot, there is a sequence of at most 2 c1n Reidemeister moves that will convert it to a trivial knot diagram, where n is the number of crossings in D. A similar result holds for elementary moves on a polygonal knot K embe ..."
Abstract

Cited by 40 (11 self)
 Add to MetaCart
There is a positive constant c1 such that for any diagram D representing the unknot, there is a sequence of at most 2 c1n Reidemeister moves that will convert it to a trivial knot diagram, where n is the number of crossings in D. A similar result holds for elementary moves on a polygonal knot K embedded in the 1skeleton of the interior of a compact, orientable, triangulated PL 3manifold M. There is a positive constant c2 such that for each t ≥ 1, if M consists of t tetrahedra, and K is unknotted, then there is a sequence of at most 2 c2t elementary moves in M which transforms K to a triangle contained inside one tetrahedron of M. We obtain explicit values for c1 and c2.
Algorithms for recognizing knots and 3manifolds
 Chaos, Solitons and Fractals
, 1998
"... Algorithms are of interest to geometric topologists for two reasons. First, they have bearing on the decidability of a problem. Certain topological questions, such as finding a classification of four dimensional manifolds, admit no solution. ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
(Show Context)
Algorithms are of interest to geometric topologists for two reasons. First, they have bearing on the decidability of a problem. Certain topological questions, such as finding a classification of four dimensional manifolds, admit no solution.
The size of spanning disks for polygonal knots
, 1999
"... For each integer n ≥ 1 we construct a closed unknotted Piecewise Linear curve Kn in R 3 having less than 11n edges with the property that any Piecewise Linear triangluated disk spanning the curve contains at least 2 n−1 triangles. 1 Introduction. We show the existence of a sequence of unknotted simp ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
(Show Context)
For each integer n ≥ 1 we construct a closed unknotted Piecewise Linear curve Kn in R 3 having less than 11n edges with the property that any Piecewise Linear triangluated disk spanning the curve contains at least 2 n−1 triangles. 1 Introduction. We show the existence of a sequence of unknotted simple closed curves Kn in R 3 having the following properties: • The curve Kn is a polygon with at most 11n edges. • Any Piecewise Linear (PL) embedding of a triangulated disk into R 3 with
Gauß Sums On Almost Positive Knots
, 1999
"... Using the FiedlerPolyakViro Gauß diagram formulas we study the Vassiliev invariants of degree 2 and 3 on almost positive knots. As a consequence we show that the number of almost positive knots of given genus or unknotting number grows polynomially in the crossing number, and also recover and exte ..."
Abstract
 Add to MetaCart
Using the FiedlerPolyakViro Gauß diagram formulas we study the Vassiliev invariants of degree 2 and 3 on almost positive knots. As a consequence we show that the number of almost positive knots of given genus or unknotting number grows polynomially in the crossing number, and also recover and extend, inter alia to their untwisted Whitehead doubles, previous results on the polynomials and signatures of such knots.
The size of spanning disks for PL Knots.
, 1998
"... For each integer n ? 1 we construct a closed unknotted PL curve Kn in R 3 having less than 33n edges with the property that any PL triangluated disk spanning the curve contains at least 2 n triangles. 1 Introduction. We show the existence of a sequence of unknotted simple closed curves Kn in ..."
Abstract
 Add to MetaCart
(Show Context)
For each integer n ? 1 we construct a closed unknotted PL curve Kn in R 3 having less than 33n edges with the property that any PL triangluated disk spanning the curve contains at least 2 n triangles. 1 Introduction. We show the existence of a sequence of unknotted simple closed curves Kn in R 3 having the following properties: ffl The curve Kn is a polygon with at most 33n edges. ffl Any PL embedding of a triangulated disk into R 3 with boundary Kn contains at least 2 n triangular faces. The existence of such disks has implications to the complexity of geometric algorithms. For example, it shows that algorithms to test knot triviality that search for embedded disks in the complement need to deal with disks containing exponentially many triangles. Thus the exponential bounds on the size of the normal disks that are analyzed in [1],[3],[4],[5], and [6] cannot be replaced with polynomial bounds. Approaches to other problems, such as the word problem for 3manifold groups,...
New Knot and Link Invariants
, 1999
"... We study the new formulas of Th. Fiedler for the degree3Vassiliev invariants for knots in the 3sphere and solid torus and present some results obtained by them. We show that a knot with Jones polynomial consisting of exactly two monomials must have at least 20 crossings. Keywords: Vassiliev inva ..."
Abstract
 Add to MetaCart
(Show Context)
We study the new formulas of Th. Fiedler for the degree3Vassiliev invariants for knots in the 3sphere and solid torus and present some results obtained by them. We show that a knot with Jones polynomial consisting of exactly two monomials must have at least 20 crossings. Keywords: Vassiliev invariants, Gau sums, orientation, mutation, positive knots, Jones polynomial AMS subject classification: 57M25 Contents 1 Introduction 2 2 Gau diagrams and Gau sums 2 3 The degree3Vassiliev invariant, positive knots and the Jones polynomial 4 3.1 A formula for the degree3Vassiliev invariant . . . . . . . . . . . . . . . . . . . . . . 4 3.2 A condition to the values of the Jones polynomial . . . . . . . . . . . . . . . . . . . . 7 3.3 A lower bound for the crossing number . . . . . . . . . . . . . . . . . . . . . . . . . 8 4 Refined Gau diagrams 9 4.1 Even linking number case . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 4.2 Odd linking number case . . . . . . . ....