English
Related papers

Related papers: Computing Heegaard genus is NP-hard

200 papers

For complexity of the heterogeneous minimum spanning forest problem has not been determined, we reduce 3-SAT which is NP-complete to 2-heterogeneous minimum spanning forest problem to prove this problem is NP-hard and spread result to…

Computational Complexity · Computer Science 2016-01-19 Zhujun Zhang , Qiang Sun

Let $M_1$ and $M_2$ be orientable irreducible 3--manifolds with connected boundary and suppose $\partial M_1\cong\partial M_2$. Let $M$ be a closed 3--manifold obtained by gluing $M_1$ to $M_2$ along the boundary. We show that if the gluing…

Geometric Topology · Mathematics 2014-11-11 Tao Li

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…

Geometric Topology · Mathematics 2025-06-27 Henrique Ennes , Clément Maria

Let $M$ be an orientable, irreducible $3$-manifold admitting a weakly reducible genus three Heegaard splitting as a minimal genus Heegaard splitting. In this article, we prove that if $[f]$, $[g]\in Mod(M)$ give the same correspondence…

Geometric Topology · Mathematics 2015-09-02 Jungsoo Kim

Let M_1 and M_2 be compact, orientable 3-manifolds with incompressible boundary, and M the manifold obtained by gluing with a homeomorphism $\phi:\bdy M_1 \to \bdy M_2$. We analyze the relationship between the sets of low genus Heegaard…

Geometric Topology · Mathematics 2012-01-18 David Bachman

We show that the problem of determining whether a knot in the 3-sphere is non-trivial lies in NP. This is a consequence of the following more general result. The problem of determining whether the Thurston norm of a second homology class in…

Geometric Topology · Mathematics 2021-04-13 Marc Lackenby

Following work of Jaco and Rubinstein (2006), which (non-constructively) proved that any 3-manifold admits a one-vertex layered triangulation, we present an algorithm, with implementation using Regina, that uses a combinatorial presentation…

Geometric Topology · Mathematics 2025-07-22 Alexander He , James Morgan , Em K. Thompson

Fix a finite group $G$. We study the computational complexity of counting problems of the following flavor: given a group $\Gamma$, count the number of homomorphisms $\Gamma \to G$. Our first result establishes that this problem is…

Group Theory · Mathematics 2026-04-22 Eric Samperton , Armin Weiß

Heegaard splittings provide a natural representation of closed 3-manifolds by gluing two handlebodies along a common surface. These splittings can be equivalently given by two finite sets of meridians lying on the surface, which define a…

Computational Geometry · Computer Science 2026-01-01 Henrique Ennes , Clément Maria

We consider a Heegaard splitting M=H_1 \cup_S H_2 of a 3-manifold M having an essential disk D in H_1 and an essential surface F in H_2 with |D \cap F|=1. (We require that boundary of F is in S when H_2 is a compressionbody with non-empty…

Geometric Topology · Mathematics 2008-12-31 Jung Hoon Lee

We show that the decision problem of recognising whether a triangulated 3-manifold admits a Seifert fibered structure with non-empty boundary is in NP. We also show that the problem of producing Seifert data for a triangulation of such a…

Geometric Topology · Mathematics 2024-06-27 Adele Jackson

Let $g \ge 2$ and assume that we are given a genus $g$ Heegaard splitting of a closed orientable $3$-manifold with the distance greater than $2g+2$. We prove that the mapping class group of the once-stabilization of such a Heegaard…

Geometric Topology · Mathematics 2024-12-18 Daiki Iguchi

We survey known (and unknown) results about the behavior of Heegaard genus of 3-manifolds constructed via various gluings. The constructions we consider are (1) gluing together two 3-manifolds with incompressible boundary, (2) gluing…

Geometric Topology · Mathematics 2009-03-30 David Bachman , Ryan Derby-Talbot

The question of whether the complexity class P is equal to the complexity class NP has been a seemingly intractable problem for over 4 decades. It has been clear that if an algorithm existed that would solve the problems in the NP class in…

Computational Complexity · Computer Science 2015-06-04 Jason W. Steinmetz

We prove that it is $\#\mathsf{P}$-complete to count the triangulations of a (non-simple) polygon.

Computational Geometry · Computer Science 2020-12-07 David Eppstein

Let $G$ be a complete edge-weighted graph on $n$ vertices. To each subset of vertices of $G$ assign the cost of the minimum spanning tree of the subset as its weight. Suppose that $n$ is a multiple of some fixed positive integer $k$. The…

Using the theory of hyperbolic manifolds with totally geodesic boundary, we provide for every integer n greater than 1 a class of such manifolds all having Matveev complexity equal to n and Heegaard genus equal to n+1. All the elements of…

Geometric Topology · Mathematics 2016-09-07 Roberto Frigerio , Bruno Martelli , Carlo Petronio

We show that if two 3-manifolds with toroidal boundary are glued via a `sufficiently complicated' map then every Heegaard splitting of the resulting 3-manifold is weakly reducible. Additionally, if Z is a manifold obtained by gluing X and…

Geometric Topology · Mathematics 2009-09-29 David Bachman , Saul Schleimer , Eric Sedgwick

We describe for each postive integer $k$ a 3-manifold with Heegaard surfaces of genus $2k$ and $2k-1$ such that any common stabilization of these two surfaces has genus at least $3k-1$. We also show that for every positive $n$, there is a…

Geometric Topology · Mathematics 2014-02-26 Jesse Johnson

In graph theory, as well as in 3-manifold topology, there exist several width-type parameters to describe how "simple" or "thin" a given graph or 3-manifold is. These parameters, such as pathwidth or treewidth for graphs, or the concept of…

Geometric Topology · Mathematics 2021-10-26 Kristóf Huszár , Jonathan Spreer , Uli Wagner