Related papers: Algorithms for recognizing knots and 3-manifolds
We construct a new type of geometric knot theory, plumbers' knots, and solve the problems of distinguishing and enumerating such knots at a fixed level of complexity. (v2) Minor edits, added theorem 3.18. (v3) Substantial revisions,…
Techniques are introduced which determine the geometric structure of non-simple two-generator $3$-manifolds from purely algebraic data. As an application, the satellite knots in the $3$-sphere with a two-generator presentation in which at…
Manifolds occur naturally as configuration spaces of robotic systems. They provide global descriptions of local coordinate systems that are common tools in expressing positions of robots. The purpose of this survey is threefold. Firstly, we…
This is a report on our ongoing research on a combinatorial approach to knot recognition, using coloring of knots by certain algebraic objects called quandles. The aim of the paper is to summarize the mathematical theory of knot coloring in…
This paper explores the problem of unknotting closed braids and classical knots in mathematical knot theory. We apply evolutionary computation methods to learn sequences of moves that simplify knot diagrams, and show that this can be…
In this paper, we introduce a novel way to use geometric deep learning for knot data by constructing a functor that takes knots to graphs and using graph neural networks. We will attempt to predict several knot invariants with this…
We show that, for any prime p, a knot K in the 3-sphere is determined by its p-fold cyclic unbranched covering. We also investigate when the m-fold cyclic unbranched covering of a knot coincides with the n-fold cyclic unbranched covering of…
We show that the problem of deciding whether a knot in a fixed closed orientable 3-dimensional manifold bounds a surface of genus at most $g$ is in co-NP. This answers a question of Agol, Hass, and Thurston in 2002. Previously, this was…
In their paper `A new algorithm for recognizing the unknot', in Geometry and Topology', 2 (1998) n. 9, 175-220, the first author and Michael Hirsch presented a then new algorithm for recognizing the unknot. The first part of the algorithm…
We develop a general method for constructing random manifolds and submanifolds in arbitrary dimensions. The method is based on associating colors to the vertices of a triangulated manifold, as in recent work for curves in 3-dimensional…
The topological analysis of chaos based on a knot-theoretic characterization of unstable periodic orbits has proved a powerful method, however knot theory can only be applied to three-dimensional systems. Still, the core principles upon…
We define a new notion of thin position for a graph in a 3-manifold which combines the ideas of thin position for manifolds first originated by Scharlemann and Thompson with the idea of thin position for knots first originated by Gabai.…
Meier and Zupan showed that every surface in the four-sphere admits a bridge trisection and can therefore be represented by three simple tangles. This raises the possibility of applying methods from link homology to knotted surfaces. We use…
A polynomial knot is a smooth embedding $\kappa: \real \to \real^n$ whose components are polynomials. The case $n = 3$ is of particular interest. It is both an object of real algebraic geometry as well as being an open ended topological…
A knot theoretic algorithm is proposed to model `fragile topology' of quantum physics.
This paper is a survey of knot theory and invariants of knots and links from the point of view of categories of diagrams. The topics range from foundations of knot theory to virtual knot theory and topological quantum field theory.
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.
We review the use of grid diagrams in the development of Heegaard Floer theory. We describe the construction of the combinatorial link Floer complex, and the resulting algorithm for unknot detection. We also explain how grid diagrams can be…
We make use of the 3D nature of knots and links to find savings in computational complexity when computing knot invariants such as the linking number and, in general, most finite type invariants. These savings are achieved in comparison…
By use of a variety of techniques (most based on constructions of quasipositive knots and links, some old and others new), many smooth 3-manifolds are realized as transverse intersections of complex surfaces in complex 3-space with strictly…