Related papers: A new algorithm for recognizing the unknot

We present a new, practical algorithm to test whether a knot complement contains a closed essential surface. This property has important theoretical and algorithmic consequences; however, systematically testing it has until now been…

Given a tame knot K presented in the form of a knot diagram, we show that the problem of determining whether K is knotted is in the complexity class NP, assuming the generalized Riemann hypothesis (GRH). In other words, there exists a…

Knotted molecules occur naturally and are designed by scientists to gain special biological and material properties. Understanding and utilizing knotting require efficient methods to recognize and generate knotted structures, which are…

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 present two practical and widely applicable methods, including some criteria and a general procedure, for detecting Brunnian property of a link, if each component is known to be unknot. The methods are based on observation and handwork.…

In previous papers, the author realized the following principle for many knot theories: if a knot diagram is complicated enough then it reproduces itself, i.e., is a subdiagram of any other diagram equivalent to it. This principle is…

We show that a non-trivial, non-central normal subgroup of the braid groups contains a braid whose closure is a hyperbolic knot with arbitrary large genus. This shows that non-faithfulness of a quantum representation implies that the…

Two geometric spaces are in the same topological class if they are related by certain geometric deformations. We propose machine learning methods that automate learning of topological invariance and apply it in the context of knot theory,…

Noting that cycle diagrams of permutations visually resemble grid diagrams used to depict knots and links in topology, we consider the knot (or link) obtained from the cycle diagram of a permutation. We show that the permutations which…

We explore free knot diagrams, which are projections of knots into the plane which don't record over/under data at crossings. We consider the combinatorial question of which free knot diagrams give which knots and with what probability.…

Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…

The motivation of this work is to define cohomology classes in the space of knots that are both easy to find and to evaluate, by reducing the problem to simple linear algebra. We achieve this goal by defining a combinatorial graded cochain…

We define several equivariant concordance invariants using knot Floer homology. We show that our invariants provide a lower bound for the equivariant slice genus and use this to give a family of strongly invertible slice knots whose…

The relationships between braid ordering and the geometry of its closure is studied. We prove that if an essential closed surface $F$ in the complements of closed braid has relatively small genus with respect to the Dehornoy floor of the…

A disconnected cut of a connected graph is a vertex cut that itself also induces a disconnected subgraph. The decision problem whether a graph has a disconnected cut is called Disconnected Cut. This problem is closely related to several…

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 define an obstruction for a knot to be Z[Z]-homology ribbon, and use this to provide restrictions on the integers that can occur as the triple linking numbers of derivative links of knots that are either homotopy ribbon or doubly slice.…

Arclength continuation and branch switching are enormously successful algorithms for the computation of bifurcation diagrams. Nevertheless, their combination suffers from three significant disadvantages. The first is that they attempt to…

We show that the problem of recognizing that a knot diagram represents a specific torus knot, or any torus knot at all, is in the complexity class ${\sf NP} \cap {\sf co\text{-}NP}$, assuming the generalized Riemann hypothesis. We also show…

The crosscap number of a knot is an invariant describing the non-orientable surface of smallest genus that the knot bounds. Unlike knot genus (its orientable counterpart), crosscap numbers are difficult to compute and no general algorithm…