Related papers: A combinatorial approach to knot recognition

Coloring numbers are one of the simplest combinatorial invariants of knots and links to describe. And with Joyce's introduction of quandles, we can understand them more algebraically. But can we extend these invariants to tangles -- knots…

This paper is a very brief introduction to knot theory. It describes knot coloring by quandles, the fundamental group of a knot complement, and handle-decompositions of knot complements.

Knot colorings are one of the simplest ways to distinguish knots, dating back to Reidemeister, and popularized by Fox. In this mostly expository article, we discuss knot invariants like colorability, knot determinant and number of…

We define new invariants of knots by means of quandle colorings and longitudinal information. These invariants can be applied to a tangle embedding problem and recognizing non-classical virtual knots.

If a knot has the Alexander polynomial not equal to 1, then it is linear $n$-colorable. By means of such a coloring, such a knot is given an upper bound for the minimal quandle order, i.e., the minimal order of a quandle with which the knot…

This paper builds a novel bridge between algebraic coding theory and mathematical knot theory, with applications in both directions. We give methods to construct error-correcting codes starting from the colorings of a knot, describing…

In the first part of this paper, we present general results concerning the colorability of torus knots using conjugation quandles over any abstract group. Subsequently, we offer a numerical characterization for the colorability of torus…

In this paper we summarise the work discussed in Ref. [1] and [2] (q-alg/9505003), in which we introduced a method helpful in solving the problem of knot classification. We also present results obtained since then.

A quandle is an algebraic system whose axioms are motivated by Reidemeister moves in knot theory. A typical example is a conjugation quandle arising from a group. A quandle is said to be admissible if it is isomorphic to a conjugation…

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…

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…

We consider a quiver structure on the set of quandle colorings of an oriented knot or link diagram. This structure contains a wealth of knot and link invariants and provides a categorification of the quandle counting invariant in the most…

This article introduces a natural extension of colouring numbers of knots, called colouring polynomials, and studies their relationship to Yang-Baxter invariants and quandle 2-cocycle invariants. For a knot K in the 3-sphere let \pi_K be…

We consider countable linear orders and study the quasi-order of convex embeddability and its induced equivalence relation. We obtain both combinatorial and descriptive set-theoretic results, and further extend our research to the case of…

The combinatorial approach to knot theory treats knots as diagrams modulo Reidemeister moves. Many constructions of knot invariants (e.g., index polynomials, quandle colorings, etc.) use elements of diagrams such as arcs and crossings by…

Quandle colorings and cocycle invariants are studied for composite knots, and applied to chirality and abelian extensions. The square and granny knots, for example, can be distinguished by quandle colorings, so that a trefoil and its mirror…

This paper starts a systematic description of colored knot polynomials, beginning from the first non-(anti)symmetric representation R=[2,1]. The project involves several steps: (i) parametrization of big families of knots a la…

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…

Our goal is to one day take a photo of a knot and have a phone automatically recognize it. In this expository work, we explain a strategy to approximate this goal, using a mixture of modern machine learning methods (in particular…

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…