Related papers: The Computational Complexity of Knot Genus and Spa…
It is known that any tame hyperbolic 3-manifold with infinite volume and a single end is the geometric limit of a sequence of finite volume hyperbolic knot complements. Purcell and Souto showed that if the original manifold embeds in the…
Suppose F is a compact orientable surface, K is a knot in F x I, and N is the 3-manifold obtained by some non-trivial surgery on K. If F x {0} compresses in N, then there is an annulus in F x I with one end K and the other end an essential…
Knots are deeply entangled with every branch of science. One of the biggest open challenges in knot theory is to formalise a knot invariant that can unambiguously and efficiently distinguish any two knotted curves. Additionally, the…
The notion of graph covers (also referred to as locally bijective homomorphisms) plays an important role in topological graph theory and has found its computer science applications in models of local computation. For a fixed target graph…
We consider the problem of finding a 1-planar drawing for a general graph, where a 1-planar drawing is a drawing in which each edge participates in at most one crossing. Since this problem is known to be NP-hard we investigate the…
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 answer the following question posed by Lechuga: Given a simply-connected space $X$ with both $H_*(X,\qq)$ and $\pi_*(X)\otimes \qq$ being finite-dimensional, what is the computational complexity of an algorithm computing the cup-length…
In this brief note, we investigate the $\mathbb{CP}^2$-genus of knots, i.e. the least genus of a smooth, compact, orientable surface in $\mathbb{CP}^2\setminus \mathring{B^4}$ bounded by a knot in $S^3$. We show that this quantity is…
Quantum invariants in low dimensional topology offer a wide variety of valuable invariants of knots and 3-manifolds, presented by explicit formulas that are readily computable. Their computational complexity has been actively studied and is…
The Heegaard genus is a fundamental invariant of 3-manifolds. However, computing the Heegaard genus of a triangulated 3-manifold is NP-hard, and while algorithms exist, little work has been done in making such an algorithm efficient and…
Neural networks with rectified linear unit activations are essentially multivariate linear splines. As such, one of many ways to measure the "complexity" or "expressivity" of a neural network is to count the number of knots in the spline…
In three-dimensional computational topology, the theory of normal surfaces is a tool of great theoretical and practical significance. Although this theory typically leads to exponential time algorithms, very little is known about how these…
A slope $p/q$ is characterising for a knot $K \subset \mathbb{S}^3$ if the orientation-preserving homeomorphism type of the manifold $\mathbb{S}^3_K(p/q)$ obtained by performing Dehn surgery of slope $p/q$ along $K$ uniquely determines the…
We study the $\mathbb{CP}^2$-slicing number of knots, i.e. the smallest $m\geq 0$ such that a knot $K\subseteq S^3$ bounds a properly embedded, null-homologous disk in a punctured connected sum $(\#^m\mathbb{CP}^2)^{\times}$. We give a…
This paper investigates the computational complexity of deciding whether the vertices of a graph can be partitioned into a disjoint union of cliques and a triangle-free subgraph. This problem is known to be $\NP$-complete on arbitrary…
We prove that if positive integer p-surgery along a knot K \subset S^3 produces an L-space and it bounds a sharp 4-manifold, then the knot genus obeys the bound 2g(K) -1 \leq p - \sqrt{3p+1}. Moreover, there exists an infinite family of…
We discuss an obstruction to a knot being smoothly slice that comes from minimum-genus bounds on smoothly embedded surfaces in definite 4-manifolds. As an example, we provide an alternate proof of the fact that the (2,1)-cable of the figure…
In this paper we investigate the descriptional complexity of knot theoretic problems and show upper bounds for planarity problem of signed and unsigned knot diagrams represented by Gauss words. Since a topological equivalence of knots can…
A branched covering surface-knot is a surface-knot in the form of a branched covering over a surface-knot. For a branched covering surface-knot, we have a numerical invariant called the simplifying number. We show that branched covering…
We prove that if a fibered knot $K$ with genus greater than one in a three-manifold $M$ has a sufficiently complicated monodromy, then $K$ induces a minimal genus Heegaard splitting $P$ that is unique up to isotopy, and small genus Heegaard…