9,078 research outputs found
Enumerating fundamental normal surfaces: Algorithms, experiments and invariants
Computational knot theory and 3-manifold topology have seen significant
breakthroughs in recent years, despite the fact that many key algorithms have
complexity bounds that are exponential or greater. In this setting,
experimentation is essential for understanding the limits of practicality, as
well as for gauging the relative merits of competing algorithms.
In this paper we focus on normal surface theory, a key tool that appears
throughout low-dimensional topology. Stepping beyond the well-studied problem
of computing vertex normal surfaces (essentially extreme rays of a polyhedral
cone), we turn our attention to the more complex task of computing fundamental
normal surfaces (essentially an integral basis for such a cone). We develop,
implement and experimentally compare a primal and a dual algorithm, both of
which combine domain-specific techniques with classical Hilbert basis
algorithms. Our experiments indicate that we can solve extremely large problems
that were once though intractable. As a practical application of our
techniques, we fill gaps from the KnotInfo database by computing 398
previously-unknown crosscap numbers of knots.Comment: 17 pages, 5 figures; v2: Stronger experimental focus, restrict
attention to primal & dual algorithms only, larger and more detailed
experiments, more new crosscap number
Post Quantum Cryptography from Mutant Prime Knots
By resorting to basic features of topological knot theory we propose a
(classical) cryptographic protocol based on the `difficulty' of decomposing
complex knots generated as connected sums of prime knots and their mutants. The
scheme combines an asymmetric public key protocol with symmetric private ones
and is intrinsecally secure against quantum eavesdropper attacks.Comment: 14 pages, 5 figure
The Computational Complexity of Knot and Link Problems
We consider the problem of deciding whether a polygonal knot in 3-dimensional
Euclidean space is unknotted, capable of being continuously deformed without
self-intersection so that it lies in a plane. We show that this problem, {\sc
unknotting problem} is in {\bf NP}. We also consider the problem, {\sc
unknotting problem} of determining whether two or more such polygons can be
split, or continuously deformed without self-intersection 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
{\bf PSPACE}. We also give exponential worst-case 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.Comment: 32 pages, 1 figur
A 3-Stranded Quantum Algorithm for the Jones Polynomial
Let K be a 3-stranded knot (or link), and let L denote the number of
crossings in K. Let and be two positive real
numbers such that is less than or equal to 1.
In this paper, we create two algorithms for computing the value of the Jones
polynomial of K at all points of the unit circle in the complex
plane such that the absolute value of is less than or equal to .
The first algorithm, called the classical 3-stranded braid (3-SB) algorithm,
is a classical deterministic algorithm that has time complexity O(L). The
second, called the quantum 3-SB algorithm, is a quantum algorithm that computes
an estimate of the Jones polynomial of K at within a precision of
with a probability of success bounded below by $1-\epsilon_{2}%.
The execution time complexity of this algorithm is O(nL), where n is the
ceiling function of (ln(4/\epsilon_{2}))/(2(\epsilon_{2})^2). The compilation
time complexity, i.e., an asymptotic measure of the amount of time to assemble
the hardware that executes the algorithm, is O(L).Comment: 19 pages, 10 figures, to appear in Proc. SPIE, 6573-29, (2007
Algorithms for recognizing knots and 3-manifolds
This is a survey paper on algorithms for solving problems in 3-dimensional
topology. In particular, it discusses Haken's approach to the recognition of
the unknot, and recent variations.Comment: 17 Pages, 7 figures, to appear in Chaos, Fractals and Soliton
- …