English
Related papers

Related papers: Computing Heegaard genus is NP-hard

200 papers

In this paper we define a restricted version of Monotone NAE-3SAT and show that it remains NP-Complete even under that restriction. We expect this result would be useful in proving NP-Completeness results for problems on $k$-colourable…

Computational Complexity · Computer Science 2010-03-30 Peiyush Jain

It is shown that for given positive integers g and b, there is a number C(g,b), such that any orientable compact irreducible 3-manifold of Heegaard genus g has at most C(g,b) disjoint, nonparallel incompressible surfaces with first Betti…

Geometric Topology · Mathematics 2014-10-01 Mario Eudave-Munoz , Jeremy Shor

A Heegaard diagram for a 3-manifold is regarded as a pair of simplexes in the complex of curves on a surface and a Heegaard splitting as a pair of subcomplexes generated by the equivalent diagrams. We relate geometric and combinatorial…

Geometric Topology · Mathematics 2007-05-23 John Hempel

The relationship between the complexity classes P and NP is an unsolved question in the field of theoretical computer science. In this paper, we investigate a descriptor approach based on lattice properties. This paper proposes a new way to…

Computational Complexity · Computer Science 2020-01-06 Marcel Rémon , Johan Barthélemy

A Heegaard diagram for a 3-manifold M is a closed, oriented surface S together with a pair (X, Y) of compact 1-manifolds in S whose components serve as attaching curves for the 2-handles of the two sides of a Heegaard splitting for M. The…

Geometric Topology · Mathematics 2007-05-23 John Hempel

We examine three key conjectures in 3-manifold theory: the virtually Haken conjecture, the positive virtual b_1 conjecture and the virtually fibred conjecture. We explore the interaction of these conjectures with the following seemingly…

Geometric Topology · Mathematics 2007-05-23 Marc Lackenby

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…

Discrete Mathematics · Computer Science 2014-04-10 Carl Feghali , Faisal N. Abu-Khzam , Haiko Müller

Given a small polygon S, a big simple polygon B and a positive integer k, it is shown to be NP-hard to determine whether k copies of the small polygon (allowing translation and rotation) can be placed in the big polygon without overlap.…

Computational Geometry · Computer Science 2012-09-25 Sarah R. Allen , John Iacono

We show that, for any integers, $g \geq 3$ and $n \geq 2$, there exists a link in $S^3$ such that its complement has a genus $g$ Heegaard splitting with distance $n$.

Geometric Topology · Mathematics 2021-01-19 Xifeng Jin

We give a combinatorial proof of a theorem first proved by Souto which says the following. Let M_1 and M_2 be simple 3-manifolds with connected boundary of genus g>0. If M_1 and M_2 are glued via a complicated map, then every minimal…

Geometric Topology · Mathematics 2009-03-31 Tao Li

We show that determining the crossing number of a link is NP-hard. For some weaker notions of link equivalence, we also show NP-completeness.

Computational Geometry · Computer Science 2019-08-13 Arnaud de Mesmay , Marcus Schaefer , Eric Sedgwick

A Heegaard splitting of an open 3-manifold is the partition of the manifold into two non-compact handlebodies which intersect on their common boundary. This paper proves several non-compact analogues of theorems about compact Heegaard…

Geometric Topology · Mathematics 2014-10-01 Scott Taylor

We consider the problem of deciding whether a polygonal knot in 3-dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that it lies in a plane. We show that this problem, {\sc…

Geometric Topology · Mathematics 2007-05-23 Joel Hass , Jeffrey C. Lagarias , Nicholas Pippenger

Kevin Hartshorn showed that if a three-dimensional manifold $M$ admits a Heegaard surface $\Sigma$ with Hempel distance $d$ then every incompressible surface in $M$ has genus at least $\frac{d}{2}$. Scharlemann-Tomova generalized this,…

Geometric Topology · Mathematics 2013-08-22 Jesse Johnson

We strengthen a result by Laskar and Lyle (Discrete Appl. Math. (2009), 330-338) by proving that it is NP-complete to decide whether a bipartite planar graph can be partitioned into three independent dominating sets. In contrast, we show…

Computational Complexity · Computer Science 2019-05-14 Juho Lauri , Christodoulos Mitillos

We show that Not-All-Equal 3-Sat remains NP-complete when restricted to instances that simultaneously satisfy the following properties: (i) The clauses are given as the disjoint union of k partitions, for any fixed $k \geq 4$, of the…

Computational Complexity · Computer Science 2024-12-06 Andreas Darmann , Janosch Döcker , Britta Dorn

In this paper we show that for a given 3-manifold and a given Heegaard splitting there are finitely many preferred decomposing systems of $3g - 3$ disjoint essential disks. These are characterized by a combinatorial criterion which is a…

Geometric Topology · Mathematics 2007-05-23 Martin Lustig , Yoav Moriah

We consider closed acylindrical surfaces in 3-manifolds and in knot and link complements, and show that the genus of these surfaces is bounded linearly by the number of tetrahedra in the triangulation of the manifold and by the number of…

Geometric Topology · Mathematics 2009-09-29 Mario Eudave-Munoz , Max Neumann-Coto

We show if M is a closed, connected, orientable, hyperbolic 3-manifold with Heegaard genus g then g >= 1/2 cosh(r) where r denotes the radius of any isometrically embedded ball in M. Assuming an unpublished result of Pitts and Rubinstein…

Geometric Topology · Mathematics 2014-10-01 David Bachman , Daryl Cooper , Matthew E. White

We show the problem of counting homomorphisms from the fundamental group of a homology $3$-sphere $M$ to a finite, non-abelian simple group $G$ is #P-complete, in the case that $G$ is fixed and $M$ is the computational input. Similarly,…

Geometric Topology · Mathematics 2018-10-03 Greg Kuperberg , Eric Samperton
‹ Prev 1 3 4 5 6 7 10 Next ›