Related papers: A Non-classification Result for Wild Knots

Wild knots--knots with infinite knotting behavior--have resisted traditional methods of knot classification, making them more of a curiosity in topology than a subject of sustained investigation. In this paper, we present a new way to…

In this paper we constructed new model of plastic deformation. The knot theory was used to classify the plastic state.

We desribe vector bundles over a class of noncommutative curves, namely, over noncommutative nodal curves of string type and of almost string type. We also prove that in other cases the classification of vector bundles over a noncommutative…

The goal of this paper is to discuss the possibility of finding an algorithm that can give all distinct knots up to a desired complexity. Two such algorithms are presented, one based on projections on a plane, the other on closed…

In representation theory, a classification problem is called wild if it contains the problem of classifying matrix pairs up to simultaneous similarity. The latter problem is considered as hopeless; it contains the problem of classifying an…

We show that the word problem for braided monoidal categories is at least as hard as the unknotting problem. As a corollary, so is the word problem for Gray categories. We conjecture that the word problem for Gray categories is decidable.

We study the complexity of locally checkable labeling (LCL) problems on $\mathbb{Z}^n$ from the point of view of descriptive set theory, computability theory, and factors of i.i.d. Our results separate various complexity classes that were…

We present a systematic classification of uncolored bonded knots with singularity number at most seven. Bonded knots provide a topological model for closed protein chains with intramolecular bridges, such as disulfide bonds. Following the…

We study symmetric crossing change operations for strongly invertible knots. Our main theorem is that the most natural notion of equivariant unknotting number is not additive under connected sum, in contrast with the longstanding conjecture…

In representation theory, the problem of classifying pairs of matrices up to simultaneous similarity is used as a measure of complexity; classification problems containing it are called wild problems. We show in an explicit form that this…

We identify the complexity of the classification problem for automorphisms of a given countable regularly branching tree up to conjugacy. We consider both the rooted and unrooted cases. Additionally, we calculate the complexity of the…

In this paper the new model of plastic deformation is constructed. For classification of plastic statuses the theory of knot is used.

We consider classes of fundamental groups of complements of various kinds of codimension 2 embeddings and show that, in general, the problem of deciding whether or not a group in one class belongs to a smaller class is algorithmically…

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…

We prove that the description of cubic functors is a wild problem in the sense of the representation theory. On the contrary, we describe several special classes of such functors (2-divisible, weakly alternative, vector spaces and torsion…

The authors conjectured previously that a knot is nonfibered if and only if its infinite cyclic cover has uncountably many finite covers. We prove the conjecture for a class of knots that includes all knots of genus 1, using techniques from…

This paper is an introduction to the theory of virtual knots and links and it gives a list of unsolved problems in this subject.

Inference of species networks from genomic data under the Network Multispecies Coalescent Model is currently severely limited by heavy computational demands. It also remains unclear how complicated networks can be for consistent inference…

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,…

The classical knot recognition problem is the problem of determining whether the virtual knot represented by a given diagram is classical. We prove that this problem is in NP, and we give an exponential time algorithm for the problem.