Related papers: The computational complexity of the solid torus co…
A twisted torus knot is a knot obtained from a torus knot by twisting adjacent strands by full twists. The twisted torus knots lie in $F$, the genus 2 Heegaard surface for $S^3$. Primitive/primitive and primitive/Seifert knots lie in $F$ in…
In Theorem 1.2 of the paper math.GT/0002110 the author claimed to have proved that all transversal knots whose topological knot type is that of an iterated torus knot (we call them cable knots) are transversally simple. That theorem is…
In a previous paper (q-alg/9501022) we suggested some algorithms that could be useful in solving the problem of knot classification. Here we continue this discussion by answering questions raised in that paper and by commenting on practical…
NP complete problem is one of the most challenging issues. The question of whether all problems in NP are also in P is generally considered one of the most important open questions in mathematics and theoretical computer science as it has…
It is a basic question in contact geometry to classify all non-isotopic tight contact structures on a given 3-manifold. If the manifold has a boundary, we need also specify the dividing set on the boundary. In this paper, we answer the…
The topological underpinnings are presented for a new algorithm which answers the question: `Is a given knot the unknot?' The algorithm uses the braid foliation technology of Bennequin and of Birman and Menasco. The approach is to consider…
The ropelength problem asks for the minimum-length configuration of a knotted diameter-one tube embedded in Euclidean three-space. The core curve of such a tube is called a tight knot, and its length is a knot invariant measuring…
We compose the table of knots in the thickened torus T x I having diagrams with at most 4 crossings. The knots are constructed by the three-step process. First we list regular graphs of degree 4 with at most 4 vertices, then for each graph…
We consider the problem of covering hypersphere by a set of spherical hypercaps. This sort of problem has numerous practical applications such as error correcting codes and reverse k-nearest neighbor problem. Using the reduction of non…
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…
With the proliferation of Deep Machine Learning into real-life applications, a particular property of this technology has been brought to attention: robustness Neural Networks notoriously present low robustness and can be highly sensitive…
A new class of non-linear O(3) models is introduced. It is shown that these systems lead to integrable submodels if an additional integrability condition (so called the generalized eikonal equation) is imposed. In the case of particular…
We exhibit a knot $P$ in the solid torus, representing a generator of first homology, such that for any knot $K$ in the 3-sphere, the satellite knot with pattern $P$ and companion $K$ is not smoothly slice in any homology 4-ball. As a…
We classify which positive integral surgeries on positive torus knots bound rational homology balls. Additionally, for a given knot K we consider which cables K(p,q) admit integral surgeries that bound rational homology balls. For such…
In this article, we explore the problem of determining isomorphisms between the twisted complex group algebras of finite $p$-groups. This problem bears similarity to the classical group algebra isomorphism problem and has been recently…
Neural network compression empowers the effective yet unwieldy deep convolutional neural networks (CNN) to be deployed in resource-constrained scenarios. Most state-of-the-art approaches prune the model in filter-level according to the…
The stable Khovanov-Rozansky homology of torus knots has been conjecturally described as the Koszul homology of an explicit non-regular sequence of polynomials. We verify this conjecture against newly available computational data for…
Computing cohesive subgraphs is a central problem in graph theory. While many formulations of cohesive subgraphs lead to NP-hard problems, finding a densest subgraph can be done in polynomial time. As such, the densest subgraph model has…
We present a direct connection between torus knots and Hopfions by finding stable and static solutions of the extended Faddeev-Skyrme model with a ferromagnetic potential term. (P,Q)--torus knots consisting of |Q| sine-Gordon kink strings…
The hybridization number problem requires us to embed a set of binary rooted phylogenetic trees into a binary rooted phylogenetic network such that the number of nodes with indegree two is minimized. However, from a biological point of view…