Related papers: The computational complexity of the solid torus co…
We consider knots whose diagrams have a high amount of twisting of multiple strands. By encircling twists on multiple strands with unknotted curves, we obtain a link called a generalized augmented link. Dehn filling this link gives the…
The complexity-precision trade-off of an object detector is a critical problem for resource constrained vision tasks. Previous works have emphasized detectors implemented with efficient backbones. The impact on this trade-off of proposal…
We compute rho-invariant for iterated torus knots $K$ for the standard representation of the knot group given by abelianisation. For algebraic knots, this invariant turns out to be very closely related to an invariant of a plane curve…
We show that the Kth largest subset problem and the Kth largest m-tuple problem are in PP and hard for PP under polynomial-time Turing reductions. Several problems from the literature were previously shown NP-hard via reductions from those…
We collect and discuss various results on an important family of knots and links called Turk's head knots and links $Th (p,q)$. In the mathematical literature, they also appear under different names such as rosette knots and links or…
The notion of critical tuple was introduced by Miklau and Suciu (Gerome Miklau and Dan Suciu. A formal analysis of information disclosure in data exchange. J. Comput. Syst. Sci., 73(3):507-534, 2007), who also claimed that the problem of…
We present a new, practical algorithm to test whether a knot complement contains a closed essential surface. This property has important theoretical and algorithmic consequences; however, systematically testing it has until now been…
We consider the problem of determining the structure of the dark halo of nearby dwarf spheroidal galaxies (dSphs) from the spherical Jeans equations. Whether the dark halos are cusped or cored at the centre is an important strategic problem…
In this paper, we generalize the rough topology and the core to numerical data by classifying objects in terms of the attribute values. A new approach to finding the core for numerical data is discussed. Then a measurement to find whether…
We describe some problems, observations, and conjectures concerning thickness and packing density of knots and links in $\sp^3$ and $\R^3$. We prove the thickness of a nontrivial knot or link in $\sp^3$ is no more than $\frac{\pi}{4}$, the…
With the proliferation of mobile technology and IT development, people can use social network services at any place and anytime. Among many social network mining problems, identifying cohesive subgraphs attract many attentions from…
The polytope containment problem is deciding whether a polytope is a contained within another polytope. This problem is rooted in computational convexity, and arises in applications such as verification and control of dynamical systems. The…
We construct an enhanced version of knot contact homology, and show that we can deduce from it the group ring of the knot group together with the peripheral subgroup. In particular, it completely determines a knot up to smooth isotopy. The…
A fundamental graph problem is to recognize whether the vertex set of a graph $G$ can be bipartitioned into sets $A$ and $B$ such that $G[A]$ and $G[B]$ satisfy properties $\Pi_A$ and $\Pi_B$, respectively. This so-called…
In this paper, we extend the theory of planar pseudo knots to the theories of annular and toroidal pseudo knots. Pseudo knots are defined as equivalence classes under Reidemeister-like moves of knot diagrams characterized by crossings with…
There are many fundamental algorithmic problems on triangulated 3-manifolds whose complexities are unknown. Here we study the problem of finding a taut angle structure on a 3-manifold triangulation, whose existence has implications for both…
Bootstrap percolation is a class of cellular automata with random initial state. Two-dimensional bootstrap percolation models have three rough universality classes, the most studied being the `critical' one. For this class the scaling of…
The robustness of deep neural networks is crucial to modern AI-enabled systems and should be formally verified. Sigmoid-like neural networks have been adopted in a wide range of applications. Due to their non-linearity, Sigmoid-like…
We study torus knot invariants in the lens space $S^{3}/\mathbb{Z}_{p}$ within Chern--Simons theory. Using the surgery and modular description of lens spaces, we derive a general expression for the invariant of an $(\alpha,\beta)$ torus…
We study the structure of the augmented fundamental quandle of a knot whose complement contains an incompressible torus. We obtain the relationship between the fundamental quandle of a satellite knot and the fundamental quandles/groups of…