English
Related papers

Related papers: Computing Heegaard genus is NP-hard

200 papers

The computational complexity class #P captures the difficulty of counting the satisfying assignments to a boolean formula. In this work, we use basic tools from quantum computation to give a proof that the SO(3) Witten-Reshetikhin-Turaev…

Computational Complexity · Computer Science 2017-03-21 Gorjan Alagic , Catharine Lo

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…

Geometric Topology · Mathematics 2022-09-27 Mustafa Cengiz

We construct families of manifolds that have pairs of genus $g$ Heegaard splittings that must be stabilized roughly $g$ times to become equivalent. We also show that when two unstabilized, boundary-unstabilized Heegaard splittings are…

Geometric Topology · Mathematics 2008-07-01 David Bachman

For each g greater than one there is a 3-manifold with two genus g Heegaard splittings that require g stabilizations to become equivalent. Previously known examples required at most one stabilization. Control of families of Heegaard…

Geometric Topology · Mathematics 2014-11-11 Joel Hass , Abigail Thompson , William Thurston

In this paper, we prove that (1) For any integers $n\geq 1$ and $g\geq 2$, there is a closed 3-manifold $M_{g}^{n}$ which admits a distance $n$ Heegaard splitting of genus $g$ except that the pair of $(g, n)$ is $(2, 1)$. Furthermore,…

Geometric Topology · Mathematics 2016-01-20 Ruifeng Qiu , Yanqing Zou , Qilong Guo

We show that three natural decision problems about links and 3-manifolds are computationally hard, assuming some conjectures in complexity theory. The first problem is determining whether a link in the 3-sphere bounds a Seifert surface with…

Geometric Topology · Mathematics 2017-04-28 Marc Lackenby

The Heegaard genus of a 3-manifold, as well as the growth of Heegaard genus in its finite sheeted cover spaces, has extensively been studied in terms of algebraic, geometric and topological properties of the 3-manifold. This note shows that…

Geometric Topology · Mathematics 2018-09-14 Michelle Chu , Stephan Tillmann

We prove that the problem of deciding whether a 2- or 3-dimensional simplicial complex embeds into $\mathbb{R}^3$ is NP-hard. Our construction also shows that deciding whether a 3-manifold with boundary tori admits an $\mathbb{S}^{3}$…

Geometric Topology · Mathematics 2018-08-23 Arnaud de Mesmay , Yo'av Rieck , Eric Sedgwick , Martin Tancer

We define a trisection of a closed, orientable three dimensional manifold into three handlebodies, and a notion of stabilization for these trisections. Several examples of trisections are described in detail. We define the trisection genus…

Geometric Topology · Mathematics 2018-06-13 Dale Koenig

We show that every p-fold strictly-cyclic branched covering of a b-bridge link in $S^3$ admits a p-symmetric Heegaard splitting - in the sense of Birman and Hilden - of genus $g=(b-1)(p-1)$. This gives a complete converse of one of the…

Geometric Topology · Mathematics 2007-05-23 Michele Mulazzani

In this paper, we will prove that a problem deciding whether there is an upper-triangular coordinate in which a character is not in the state of a Hilbert point is NP-hard. This problem is related to the GIT-semistability of a Hilbert…

Algebraic Geometry · Mathematics 2018-03-12 Cheolgyu Lee

We show that for any two Heegaard splittings of genus $p$ and $q$ for the same closed 3-manifold, there is a common stabilization of genus at most 3/2 p + 2q - 1. One may compare this to recent examples of Heegaard splittings whose smallest…

Geometric Topology · Mathematics 2011-07-13 Jesse Johnson

We study complexities of 3-manifolds defined from triangulations, Heegaard splittings, and surgery presentations. We show that these complexities are related by linear inequalities, by presenting explicit geometric constructions. We also…

Geometric Topology · Mathematics 2017-08-24 Jae Choon Cha

Non-isotopic Heegaard splittings of non-minimal genus were known previously only for very special 3-manifolds. We show in this paper that they are in fact a wide spread phenomenon in 3-manifold theory: We exhibit a large class of knots and…

Geometric Topology · Mathematics 2009-09-25 Martin Lustig , Yoav Moriah

For a boundary-reducible $3$-manifold $M$ with $\partial M$ a genus $g$ surface, we show that if $M$ admits a genus $g+1$ Heegaard surface $S$, then the disk complex of $S$ is simply connected. Also we consider the connectedness of the…

Geometric Topology · Mathematics 2014-06-06 Jung Hoon Lee

We introduce a new technique for finding lower bounds on the Heegaard genus of a 3-manifold obtained by gluing a pair of 3-manifolds together along an incompressible torus or annulus. We deduce a number of inequalities, including one which…

Geometric Topology · Mathematics 2012-11-20 Trent Schirmer

Let $M$ be a compact orientable irreducible 3-manifold and $H$ be an unstabilized genus three Heegaard splitting of $M$. In this article, we will define a simplicial complex of weak reducing pairs for $H$ and find several properties of this…

Geometric Topology · Mathematics 2014-12-31 Jungsoo Kim

Given a 3-manifold M containing an incompressible surface Q, we obtain an inequality relating the Heegaard genus of M and the Heegaard genera of the components of M - Q. Here the sum of the genera of the components of M - Q is bounded above…

Geometric Topology · Mathematics 2007-05-23 Jennifer Schultens

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…

Geometric Topology · Mathematics 2025-04-03 Marc Lackenby , Saul Schleimer

Interpreting three-leaf binary trees or {\em rooted triples} as constraints yields an entailment relation, whereby binary trees satisfying some rooted triples must also thus satisfy others, and thence a closure operator, which is known to…

Data Structures and Algorithms · Computer Science 2018-07-03 Matthew P. Johnson