Related papers: The computational complexity of the solid torus co…
The non-convex quadratic orogramming problem and the non-monotone linear complementarity problem are NP-complete problems. In this paper we first show taht the inverse problem of determinning a KKT point of the non-convex quadratic…
Computational topology is a vibrant contemporary subfield and this article integrates knot theory and mathematical visualization. Previous work on computer graphics developed a sequence of smooth knots that were shown to converge point wise…
Unknotting numbers for torus knots and links are well known. In this paper, we present a method for determining the position of unknotting number crossing changes in a toric braid B(p, q) such that the closure of the resultant braid is…
In this paper we show that the non-alternating torus knots are homologically thick, i.e. that their Khovanov homology occupies at least three diagonals. Furthermore, we show that we can reduce the number of full twists of the torus knot…
Disk contact representations realize graphs by mapping vertices bijectively to interior-disjoint disks in the plane such that two disks touch each other if and only if the corresponding vertices are adjacent in the graph. Deciding whether a…
In [13], Hillar and Lim famously demonstrated that "multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard". Despite many recent advancements, the state-of-the-art methods for…
A torus-covering $T^2$-knot is a surface-knot of genus one determined from a pair of commutative braids. For a torus-covering $T^2$-knot $F$, we determine the number of irreducible metabelian $SU(2)$-representations of the knot group of $F$…
Optical knots and links have attracted great attention because of their exotic topological characteristics. Recent investigations have shown that the information encoding based on optical knots could possess robust features against external…
We prove that Khovanov homology with coefficients in $\mathbb{Z}/2\mathbb{Z}$ detects the $(2,5)$ torus knot. Our proof makes use of a wide range of deep tools in Floer homology, Khovanov homology, and Khovanov homotopy. We combine these…
In this article we discuss applications of neural networks to recognising knots and, in particular, to the unknotting problem. One of motivations for this study is to understand how neural networks work on the example of a problem for which…
Representing graphs by their homomorphism counts has led to the beautiful theory of homomorphism indistinguishability in recent years. Moreover, homomorphism counts have promising applications in database theory and machine learning, where…
We prove that the class of topological knot types that are both Legendrian simple and satisfy the uniform thickness property (UTP) is closed under cabling. An immediate application is that all iterated cabling knot types that begin with…
We present a learning-based approach to computing solutions for certain NP-hard problems. Our approach combines deep learning techniques with useful algorithmic elements from classic heuristics. The central component is a graph…
We have studied the dynamics and symmetries of a particle constrained to move in a torus knot. The Hamiltonian system turns out to be Second Class in Dirac's formulation and the Dirac brackets yield novel noncommutative structures. The…
In this paper we study the long-standing open question regarding the computational complexity of one of the core problems in supply chains management, the periodic joint replenishment problem. This problem has received a lot of attention…
Neuron identification is a popular tool in mechanistic interpretability, aiming to uncover the human-interpretable concepts represented by individual neurons in deep networks. While algorithms such as Network Dissection and CLIP-Dissect…
Ordered matchings, defined as graphs with linearly ordered vertices, where each vertex is connected to exactly one edge, play a crucial role in the area of ordered graphs and their homomorphisms. Therefore, we consider related problems from…
We introduce the notion of rational links in the solid torus. We show that rational links in the solid torus are fully characterized by rational tangles, and hence by the continued fraction of the rational tangle. Furthermore, we generalize…
Itemset mining is one of the most studied tasks in knowledge discovery. In this paper we analyze the computational complexity of three central itemset mining problems. We prove that mining confident rules with a given item in the head is…
The recursive removal of leaves (dead end vertices) and their neighbors from an undirected network results, when this pruning algorithm stops, in a so-called core of the network. This specific subgraph should be distinguished from…