Related papers: The Computational Complexity of Knot Genus and Spa…

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 conjunctive…

We study the behavior of the degree of the colored Jones polynomial and the boundary slopes of knots under the operation of cabling. We show that, under certain hypothesis on this degree, if a knot $K$ satisfies the Slope Conjecture then a…

Finding paths in graphs is a fundamental graph-theoretic task. In this work, we we are concerned with finding a path with some constraints on its length and the number of vertices neighboring the path, that is, being outside of and incident…

Tightness is a generalisation of the notion of convexity: a space is tight if and only if it is "as convex as possible", given its topological constraints. For a simplicial complex, deciding tightness has a straightforward exponential time…

We present two models for the space of knots which have endpoints at fixed boundary points in a manifold with boundary, one model defined as an inverse limit of spaces of maps between configuration spaces and another which is cosimplicial.…

We extend Matveev's complexity of 3-manifolds to PL compact manifolds of arbitrary dimension, and we study its properties. The complexity of a manifold is the minimum number of vertices in a simple spine. We study how this quantity changes…

Two decision problems related to the computation of stopping sets in Tanner graphs are shown to be NP-complete. NP-hardness of the problem of computing the stopping distance of a Tanner graph follows as a consequence

By a fixed continuous map from a $3$-space to itself, a knot in the $3$-space may be mapped to another knot in the $3$-space. We analyze possible knot types of them. Then we map a knot repeatedly by a fixed continuous map and analyze…

In this article, we propose a new approach for describing and understanding knots and links in a 3-manifold through the use of an embedded non-orientable surface. Specifically, we define a plat-like representation based on this…

We describe an action of the concordance group of knots in the three-sphere on concordances of knots in arbitrary 3-manifolds. As an application we define the notion of almost-concordance between knots. After some basic results, we prove…

We establish a lower bound on the complexity orientable locally orientable geometric 3-orbifolds in terms of Delzant's T-invariants of their orbifold-fundamental groups, generalizing previously known bounds for complexity of 3-manifolds.

We test the efficiency of applying Geometric Deep Learning to the problems in low-dimensional topology in a certain simple setting. Specifically, we consider the class of 3-manifolds described by plumbing graphs and use Graph Neural…

We study the geometry of hyperbolic knots that admit alternating projections on embedded surfaces in closed 3-manifolds. We show that, under mild hypothesis, their cusp area admits two sided bounds in terms of the twist number of the…

We study the family of irreducible curves with $\delta$ nodes belonging to a free linear system $|C|$ with smooth general member on a surface $S$ such that $|K_S|$ is ample. Under the assumption that $C$ is numerically equivalent to $pK_S$,…

We give an exponential upper and a quadratic lower bound on the number of pairwise non-isotopic simple closed curves can be placed on a closed surface of genus g such that any two of the curves intersects at most once. Although the gap is…

We show that the problem of deciding whether a closed three-manifold admits an elliptic structure lies in NP. Furthermore, determining the homeomorphism type of an elliptic manifold lies in the complexity class FNP. These are both…

In this paper we will present some ideas to use 3D topology for quantum computing extending ideas from a previous paper. Topological quantum computing used \textquotedblleft knotted\textquotedblright{} quantum states of topological phases…

We introduce a geometric invariant of knots in the three-sphere, called the first-order genus, that is derived from certain 2-complexes called gropes, and we show it is computable for many examples. While computing this invariant, we draw…

The classical knot recognition problem is the problem of determining whether the virtual knot represented by a given diagram is classical. We prove that this problem is in NP, and we give an exponential time algorithm for the problem.

We investigate the space complexity of certain perfect matching problems over bipartite graphs embedded on surfaces of constant genus (orientable or non-orientable). We show that the problems of deciding whether such graphs have (1) a…