Related papers: A Non-classification Result for Wild Knots

We describe the Dedekind cuts explicitly in terms of non-standard rational numbers. This leads to another construction of a Dedekind complete totally ordered field or, equivalently, to another proof of the consistency of the axioms of the…

It is shown that entanglement witnesses constructed via the family of spectral conditions are decomposable, i.e. cannot be used to detect bound entanglement. It supports several observations that bound entanglement reveals highly…

The study of knots and links from a probabilistic viewpoint provides insight into the behavior of "typical" knots, and opens avenues for new constructions of knots and other topological objects with interesting properties. The knotting of…

We define a knot invariant and a 2-knot invariant from any finite categorical group. We calculate an explicit example for the Spun Trefoil.

We revisit evaluation of logical formulas that allow both uninterpreted relations, constrained to be finite, as well as an interpreted vocabulary over an infinite domain. This formalism was denoted embedded finite model theory in the past.…

Plant species identification in the wild is a difficult problem in part due to the high variability of the input data, but also because of complications induced by the long-tail effects of the datasets distribution. Inspired by the most…

We prove that computing an evolutionary ordering of a family of sets, i.e. an ordering where each set intersects with --but is not included in-- the union earlier sets, is NP-hard.

The main goal of this paper is to prove that for odd free knots - that is free knots with all odd crossings - the problem of sliceness (the existence of a spanning disc) has an explicit answer based on the pairing of the knot diagram…

Texture classification is a problem that has various applications such as remote sensing and forest species recognition. Solutions tend to be custom fit to the dataset used but fails to generalize. The Convolutional Neural Network (CNN) in…

Knots and links which are closed 3-braids are a very special class. Like 2-bridge knots and links, they are simple enough to admit a complete classification. At the same time they are rich enough to serve as a source of examples on which,…

We introduce an unknotting-type number of knot projections that gives an upper bound of the crosscap number of knots. We determine the set of knot projections with the unknotting-type number at most two, and this result implies classical…

In this work, we explore Landin's Knot, which is understood as a pattern for encoding general recursion, including non-termination, that is possible after adding higher-order references to an otherwise terminating language. We observe that…

The first and last named authors have demonstrated the existence of knots for which every integral slope is non-characterizing. In this short note, we extend this result in two ways. There exists a knot that shares for every integer n the…

This paper is a concise introduction to virtual knot theory, coupled with a list of research problems in this field.

Given a group endowed with a Z/2-valued morphism we associate a Gauss diagram theory, and show that for a particular choice of the group these diagrams encode faithfully virtual knots on a given arbitrary surface. This theory contains all…

We construct an infinite collection of knots with the property that any knot in this family has $n$-string essential tangle decompositions for arbitrarily high $n$.

We study a certain type of braid closure which resembles the plat closure but has certain advantages; for example, it maps pure braids to knots. The main results of this note are a Markov-type theorem and a description of how Vassiliev…

This paper explores the problem of unknotting closed braids and classical knots in mathematical knot theory. We apply evolutionary computation methods to learn sequences of moves that simplify knot diagrams, and show that this can be…

A variety of techniques have been proposed to train machine learning classifiers that are independent of a given feature. While this can be an essential technique for enabling background estimation, it may also be useful for reducing…

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…