Related papers: Computing closed essential surfaces in knot comple…
We present a practical algorithm to test whether a 3-manifold given by a triangulation or an ideal triangulation contains a closed essential surface. This property has important theoretical and algorithmic consequences. As a testament to…
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…
In this paper, we use normal surface theory to study Dehn filling on a knot-manifold. First, it is shown that there is a finite computable set of slopes on the boundary of a knot-manifold that bound normal and almost normal surfaces in a…
Neuwirth asked if any non-trivial knot in the 3-sphere can be embedded in a closed surface so that the complement of the surface is a connected essential surface for the knot complement. In this paper, we examine some variations on this…
We describe a normal surface algorithm that decides whether a knot, with known degree of the colored Jones polynomial, satisfies the Strong Slope Conjecture. We also discuss possible simplifications of our algorithm and state related open…
It is a major unsolved problem as to whether unknot recognition - that is, testing whether a given closed loop in R^3 can be untangled to form a plain circle - has a polynomial time algorithm. In practice, trivial knots (which can be…
We construct an algorithm that lists all closed essential surfaces in the complement of a knot that lies on the fiber of a trefoil or figure eight knot. Such knots are Berge knots and hence admit lens space surgeries. Furthermore they may…
We consider irreducible 3-manifolds M that arise as knot complements in closed 3-manifolds and that contain at most two connected strict essential surfaces. The results in the paper relate the boundary slopes of the two surfaces to their…
Finding a totally geodesic surface, an embedded surface where the geodesics in the surface are also geodesics in the surrounding manifold, has been a problem of interest in the study of 3-manifolds. This has especially been of interest in…
We count the number of isotopy classes of closed, connected, orientable, essential surfaces embedded in the exterior B of the knot K13n586.The main result is that the count of surfaces by genus is equal to the Euler totent function. This is…
We give three algorithms to determine the crosscap number of a knot in the 3-sphere using $0$-efficient triangulations and normal surface theory. Our algorithms are shown to be correct for a larger class of complements of knots in closed…
We consider the natural problem of counting isotopy classes of essential surfaces in 3-manifolds, focusing on closed essential surfaces in a broad class of hyperbolic 3-manifolds. Our main result is that the count of (possibly disconnected)…
These notes present two normal surface theory algorithms to detect the unknot and use the split-link algorithm to prove that the figure-eight knot is knotted.
In the complement of a hyperbolic Montesinos knot with 4 rational tangles, we investigate the number of closed, connected, essential, orientable surfaces of a fixed genus $g$, up to isotopy. We show that there are exactly 12 genus 2…
For many fundamental problems in computational topology, such as unknot recognition and $3$-sphere recognition, the existence of a polynomial-time solution remains unknown. A major algorithmic tool behind some of the best known algorithms…
We explore the application of automated reasoning techniques to unknot detection, a classical problem of computational topology. We adopt a two-pronged experimental approach, using a theorem prover to try to establish a positive result…
The knot group is the fundamental group of a knot or link complement. A necessary and sufficient conditions for a group to be realized as the knot group of some link was provided. This result was shown using the closed braid method.…
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.
The most tight conformations of prime knots are found with the use of the SONO algorithm. Their curvature and torsion profiles are calculated. Symmetry of the knots is analysed. Connections with the physics of polymers are discussed.
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…