Related papers: The computational complexity of the solid torus co…
Knots are intricate structures that cannot be unambiguously distinguished with any single topological invariant. Momentum space knots, in particular, have been elusive due to their requisite finely tuned long-ranged hoppings. Even if…
The K-way vertex cut problem} consists in, given a graph G, finding a subset of vertices of a given size, whose removal partitions G into the maximum number of connected components. This problem has many applications in several areas. It…
We investigate the complexity of the reachability problem for (deep) neural networks: does it compute valid output given some valid input? It was recently claimed that the problem is NP-complete for general neural networks and…
As a first step to understand how complicated attractors for dynamical systems can be, one may consider the following realizability problem: given a continuum $K \subseteq \mathbb{R}^3$, decide when $K$ can be realized as an attractor for a…
Establishing the complexity of {\em Bounded Distance Decoding} for Reed-Solomon codes is a fundamental open problem in coding theory, explicitly asked by Guruswami and Vardy (IEEE Trans. Inf. Theory, 2005). The problem is motivated by the…
We propose and analyze a structure with which to organize the difference between a knot in the 3-sphere bounding a topologically embedded 2-disk in the 4-ball and it bounding a smoothly embedded disk. The n-solvable filtration of the…
The curves of zero intensity of a complex optical field can form knots and links: optical vortex knots. Both theoretical constructions and experiments have so far been restricted to the very small families of torus knots or lemniscate…
We survey the problem of deciding the stability or stabilizability of uncertain linear systems whose region of uncertainty is a polytope. This natural setting has applications in many fields of applied science, from Control Theory to…
This work studies the combinatorial optimization problem of finding an optimal core tensor shape, also called multilinear rank, for a size-constrained Tucker decomposition. We give an algorithm with provable approximation guarantees for its…
We introduce a framework to analyze knots and links in an unmarked solid torus. We discuss invariants that detect when such links are equivalent under an ambient homeomorphism, and show that the multivariable Alexander polynomial is such in…
Knots are entangled structures that cannot be untangled without a cut. Topological stability of knots is one of the many examples of their important properties that can be used in information storage and transfer. Knot dynamics is important…
The cohomological rigidity problem for toric orbifolds asks when an integral cohomology isomorphism implies a homotopy equivalence. In this paper we reformulate the cohomological rigidity problem in the context of $4$-dimensional toric…
We consider the problem of deciding, given a sequence of regions, if there is a choice of points, one for each region, such that the induced polyline is simple or weakly simple, meaning that it can touch but not cross itself. Specifically,…
Theoretical complexity is a vital subfield of computer science that enables us to mathematically investigate computation and answer many interesting queries about the nature of computational problems. It provides theoretical tools to assess…
In this paper we show that the problem of identifying an edge $(i,j)$ in a graph $G$ such that there exists an optimal vertex cover $S$ of $G$ containing exactly one of the nodes $i$ and $j$ is NP-hard. Such an edge is called a weak edge.…
In this paper we investigate formal verification problems for Neural Network computations. Various reachability problems will be in the focus, such as: Given symbolic specifications of allowed inputs and outputs in form of Linear…
It has recently been shown that the problem of testing global convexity of polynomials of degree four is {strongly} NP-hard, answering an open question of N.Z. Shor. This result is minimal in the degree of the polynomial when global…
Knot theory is actively studied both by physicists and mathematicians as it provides a connecting centerpiece for many physical and mathematical theories. One of the challenging problems in knot theory is distinguishing mutant knots. Mutant…
We consider the robust Perspective-n-Point (PnP) problem using a hybrid approach that combines deep learning with model based algorithms. PnP is the problem of estimating the pose of a calibrated camera given a set of 3D points in the world…
The prime motivation behind this paper is to prove that any torus link can be realized as the union of the one-dimensional connected components of the set of critical values of the argument map restricted to a complex algebraic plane curve.…