Related papers: Towards a Classification of Knots
We introduce a relation of cobordism for knots in thickened surfaces and study cobordism invariants of such knots.
Physical knot classification is a challenging fine-grained recognition task in which the intended discriminative cue is rope crossing structure; however, high closed-set accuracy may still arise from low-level appearance shortcuts rather…
We propose a new method to enumerate alternating knots using a transfer matrix approach. We apply it to count numerically various objects, including prime alternating tangles with two connected components, up to order 18--22, and comment on…
The paper gives topological as well as rigid isotopy classification of smooth irreducible algebraic curves in the real projective 3-space for the case when the degree of the curve is at most six and its genus is at most one.
We give a first example of 2-knots with the same knot group but different knot quandles by analyzing the knot quandles of twist spins. As a byproduct of the analysis, we also give a classification of all twist spins with finite knot…
We introduce the notion of slice depth of a 2-knot K, which is the minimal integer n such that K is n-slice. We give an upper bound for the slice depth of the n-twist spin of a classical knot which belongs to several specific classes,…
This paper aims to develop a mathematical foundation to model knitting with graphs. We provide a precise definition for knit objects with a knot theoretic component and propose a simple undirected graph, a simple directed graph, and a…
We propose a taxonomy for quantum algorithms grounded in the fundamental symmetries, both continuous and discrete, underlying quantum state spaces, oracles, and circuit dynamics. By organizing algorithms according to their symmetry groups…
We describe an algorithm that recognizes some (perhaps all) intrinsically knotted (IK) graphs, and can help find knotless embeddings for graphs that are not IK. The algorithm, implemented as a Mathematica program, has already been used by…
Network classification aims to group networks (or graphs) into distinct categories based on their structure. We study the connection between classification of a network and of its constituent nodes, and whether nodes from networks in…
Our goal is to systematically compute the $\mathbb{C}P^2$-genus of all prime knots up to 8-crossings. We obtain upper bounds on the $\mathbb{C}P^2$-genus via coherent band surgery. We obtain lower bounds by obstructing homological degrees…
In this paper we generate and systematically classify all prime planar knotoids with up to 5 crossings. We also extend the existing list of knotoids in $S^2$ and add all knotoids with 6 crossings.
We introduce natural language processing into the study of knot theory, as made natural by the braid word representation of knots. We study the UNKNOT problem of determining whether or not a given knot is the unknot. After describing an…
We introduce and study knotoids. Knotoids are represented by diagrams in a surface which differ from the usual knot diagrams in that the underlying curve is a segment rather than a circle. Knotoid diagrams are considered up to Reidemeister…
In this paper, we approach the challenging problem of motion planning for knot tying. We propose a hierarchical approach in which the top layer produces a topological plan and the bottom layer translates this plan into continuous robot…
We construct new knot polynomials. Let $V$ be the standard solid torus in 3-space and let $pr$ be its standard projection onto an annulus. Let $M$ be the space of all smooth oriented knots in $V$ such that the restriction of $pr$ is an…
The first algorithm for sampling the space of thick equilateral knots, as a function of thickness, will be described. This algorithm is based on previous algorithms of applying random reflections. To prove the existence of the algorithm, we…
Simple closed curves in the plane can be mapped to nontrivial knots under the action of origami foldings that allow the paper to self-intersect. We show all tame knot types may be produced in this manner, motivating the development of a new…
We explore more the properties of bipartite knots and its rich combinatorial structure.
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.