Related papers: A Non-classification Result for Wild Knots
We prove some classification results for tight contact structure in the 3-space, -ball and -sphere that are invariant with respect to some arbitrary involution, that is conjugated to the standard rotation around the x-axis. Unlike the…
Image classification has been one of the most popular tasks in Deep Learning, seeing an abundance of impressive implementations each year. However, there is a lot of criticism tied to promoting complex architectures that continuously push…
This paper summarizes substantive new results derived by a student team (the first three authors) under the direction of the fourth author at the 2005 session of the KSU REU ``Brainstorming and Barnstorming''. The main results are a…
An oriented compact 4-manifold $V$ with boundary $S^3$ is called a positon (resp. negaton) if its intersection form is positive definite (resp. negative definite) and it is simply connected. In this paper, we prove that there exist…
Constructible complexes have the same characteristic cycle if they have the same wild ramification, even if the characteristics of the coefficients fields are different.
Nonlinear methods such as Deep Neural Networks (DNNs) are the gold standard for various challenging machine learning problems, e.g., image classification, natural language processing or human action recognition. Although these methods…
Data science offers a powerful tool to understand objects in multiple sciences. In this paper we utilize concept of data science, most notably topological data analysis, to extend our understanding of knot theory. This approach provides a…
A powerful way to study groups is via their actions on suitable spaces. Classifying spaces for families of subgroups are a type of these spaces, obtained by imposing some strict conditions on the fixed-point sets. We show how in the…
We show that determining the rank of a tensor over a field has the same complexity as deciding the existential theory of that field. This implies earlier NP-hardness results by H{\aa}stad~\cite{H90}. The hardness proof also implies an…
Logics closed under classes of substitutions broader than class of uniform substitutions are known as hyperformal logics. This paper extends known results about hyperformal logics in two ways. First: we examine a very powerful form of…
We exhibit an encoding of knots into processes in the {\pi}-calculus such that knots are ambient isotopic if and only their encodings are weakly bisimilar.
Given a class of objects, a pattern theorem is a powerful result describing their structure. We show that alternating knots exhibit a pattern theorem, and use this result to prove a long-standing conjecture that alternating knots grow rare.…
In this paper we investigate the descriptional complexity of knot theoretic problems and show upper bounds for planarity problem of signed and unsigned knot diagrams represented by Gauss words. Since a topological equivalence of knots can…
The aim of this paper is to realise the techniques of picture-valued invariants and invariants valued in free groups for long knots in the full torus. Such knots and links are of a particular interest because of their relation to Legendrian…
The notion of a braided chord diagram is introduced and studied. An equivalence relation is given which identifies all braidings of a fixed chord diagram. It is shown that finite-type invariants are stratified by braid index for knots which…
We make use of the 3D nature of knots and links to find savings in computational complexity when computing knot invariants such as the linking number and, in general, most finite type invariants. These savings are achieved in comparison…
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, and the other are referred to as tame.
One can imagine a number of mechanisms that could be the cause of brighter/fainter segments of jets. In a sense, jets might be easier to understand if they were featureless. However we observe a wide variety of structures which we call…
A knot K is called n-adjacent to another knot K', if K admits a projection containing n generalized crossings such that changing any 0 < m \leq n of them yields a projection of K'. We apply techniques from the theory of sutured 3-manifolds,…
This paper studies the computational difficulty of clustering problems that are defined directly on a continuous probability density. Rather than working with finite samples, we assume the density is given as a polynomial and ask whether it…