Related papers: A Non-classification Result for Wild Knots
We discuss the possibility of the existence of finite algorithms that may give distinct knot classes. In particular we present two attempts for such algorithms which seem promising, one based on knot projections on a plane, the other on…
We prove that each overtwisted contact structure has knot types that are represented by infinitely many distinct transverse knots all with the same self-linking number. In some cases, we can even classify all such knots. We also show…
The main result of this paper is a negative answer to the question: are all transversal knot types transversally simple? An explicit infinite family of examples is given of closed 3-braids that define transversal knot types that are not…
We point out the connection between mathematical knot theory and spin glass/search problem. In particular, we present a statistical mechanical formulation of the problem of computing a knot invariant; p-colorability problem, which provides…
Although most knots are nonalternating, modern research in knot theory seems to focus on alternating knots. We consider here nonalternating knots and their properties. Specifically, we show certain classes of knots have nontrivial Jones…
I briefly discuss a method of obtaining distinct classes of topologically equivalent knots by developing appropriate computer programs.
We prove that certain problems naturally arising in knot theory are NP--hard or NP--complete. These are the problems of obtaining one diagram from another one of a link in a bounded number of Reidemeister moves, determining whether a link…
The genus of knots is a one of the fundamental invariant and can be seen as a complexity of knots. In this paper, we give a lower bound of genus using Dehornoy floor, which is a measure of complexity of braids in terms of braid ordering.
This paper employs various computational techniques to determine the bridge numbers of both classical and virtual knots. For classical knots, there is no ambiguity of what the bridge number means. For virtual knots, there are multiple…
Starting with a smooth, non-trivial $n$-dimensional knot $K\subset\bS^{n+2}$, and a beaded $n$-dimensional necklace subordinated to $K$, we construct a wild knot with a Cantor set of wild points (\ie the knot is not locally flat in these…
Knot theory is actively studied both by physicists and mathematicians as it provides a connecting centerpiece for many physical and mathematical theories. One of the challenging problems in knot theory is distinguishing mutant knots. Mutant…
S. Satoh has defined a construction to obtain a ribbon torus knot given a welded knot. This construction is known to be surjective. We show that it is not injective. Using the invariant of the peripheral structure, it is possible to provide…
In earlier work of the author rigid irregular connections with differential Galois group $G_2$ and whose slopes have numerator $1$ were classified and new rigid connections were constructed. The same construction can be carried out for…
We explore the possibility of applying the framework of frequent pattern mining to a class of continuous objects appearing in nature, namely knots. We introduce the frequent knot mining problem and present a solution. The key observation is…
In this paper we construct infinitely many wild knots, $\mathbb{S}^{n}\hookrightarrow\mathbb{S}^{n+2}$, for $n=2,3,4$ and 5, each of which is a limit set of a geometrically finite Kleinian group. We also describe some of their properties
We prove that if a finite order knot invariant does not distinguish mutant knots, then the corresponding weight system depends on the intersection graph of a chord diagram rather than on the diagram itself. The converse statement is easy…
The problem of detecting non-classical correlations of states of many qudits is incomparably more involved than in a case of qubits. The reason is that for qubits we have a convenient description of the system by the means of the…
Virtual knot theory, introduced by Kauffman, is a generalization of classical knot theory of interest because its finite-type invariant theory is potentially a topological interpretation of Etingof and Kazhdan's theory of quantization of…
Extreme classification problems are multiclass and multilabel classification problems where the number of outputs is so large that straightforward strategies are neither statistically nor computationally viable. One strategy for dealing…
While the problem of knot classification is far from solved, it is possible to create computer programs that can be used to tabulate knots up to a desired degree of complexity. Here we discuss the main ideas on which such programs can be…