Related papers: The Computational Complexity of Knot Genus and Spa…
Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…
We give a flexible construction for knots in the 3-sphere that bound surfaces of unexpectedly low genus in punctured open books on 3-manifolds. We use this construction to give the first examples of knots whose genus differs in different…
We analyze the connections between the mathematical theory of knots and quantum physics by addressing a number of algorithmic questions related to both knots and braid groups. Knots can be distinguished by means of `knot invariants', among…
Computational knot theory and 3-manifold topology have seen significant breakthroughs in recent years, despite the fact that many key algorithms have complexity bounds that are exponential or greater. In this setting, experimentation is…
We show that the triple-crossing number of any knot is greater or equal to twice its (canonical) genus and we show an even stronger bound in the case of links. As an application we show that this bound is strong enough to obtain the…
We study compact orientable essential surfaces in knot exteriors in the 3-sphere. The genus $g$, the number of boundary components $b$, and the boundary slope $p/q$ are fundamental invariants of an essential surface. The \textit{realization…
Let $M$ be a compact 3--manifold with boundary a single torus. We present upper and lower complexity bounds for closed 3--manifolds obtained as even Dehn fillings of $M.$ As an application, we characterise some infinite families of even…
We study the complexity of birational self-maps of a projective threefold $X$ by looking at the birational type of surfaces contracted. These surfaces are birational to the product of the projective line with a smooth projective curve. We…
It was recently shown that there exists an explicit bound for the number of Pachner moves needed to connect any two triangulation of any Haken 3-manifold which contains no fibred sub-manifolds as strongly simple pieces of its…
For many fundamental problems in computational topology, such as unknot recognition and $3$-sphere recognition, the existence of a polynomial-time solution remains unknown. A major algorithmic tool behind some of the best known algorithms…
We discuss an "extrinsic" property of knots in a 3-subspace of the 3-sphere $S^3$ to characterize how the subspace is embedded in $S^3$. Specifically, we show that every knot in a subspace of the 3-sphere is transient if and only if the…
Let $p$ be a branched covering of a Riemann surface to the Riemann sphere $\mathbb{P}^1$, with branching set $B \subset \mathbb{P}^1$. We define the complexity of $p$ as infinity, if $\mathbb{P}^1 \setminus B$ does not admit a hyperbolic…
This is a survey paper on algorithms for solving problems in 3-dimensional topology. In particular, it discusses Haken's approach to the recognition of the unknot, and recent variations.
This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…
We present new lower bounds on the complexity of Dehn surgery manifolds of knots, using our recent result on the Cheeger-Gromov rho invariants and triangulations. As an application, we give explicit examples of closed hyperbolic 3-manifolds…
The primary objects of study in the ``knot theory of complex plane curves'' are C-links: links (or knots) cut out of a 3-sphere in the complex plane by complex plane transverse and totally tangential. Transverse C-links are naturally…
This paper contains the results of efforts to determine values of the smooth and the topological slice genus of 11- and 12-crossing knots. Upper bounds for these genera were produced by using a computer to search for genus one concordances…
Geometric embedding of graphs in a point set in the plane is a well known problem. In this paper, the complexity of a variant of this problem, where the point set is bounded by a simple polygon, is considered. Given a point set in the plane…
We show that in the quantum query model the complexity of detecting a triangle in an undirected graph on $n$ nodes can be done using $O(n^{1+{3\over 7}}\log^{2}n)$ quantum queries. The same complexity bound applies for outputting the…
We consider irreducible 3-manifolds M that arise as knot complements in closed 3-manifolds and that contain at most two connected strict essential surfaces. The results in the paper relate the boundary slopes of the two surfaces to their…