English
Related papers

Related papers: Computing Heegaard genus is NP-hard

200 papers

We show that for any given closed orientable 3-manifold M with a Heegaard surface of genus g, any positive integers b and n, there exists a knot K in M which admits a (g,b)-bridge splitting of distance greater than n with respect to the…

Geometric Topology · Mathematics 2013-08-01 Kazuhiro Ichihara , Toshio Saito

Decision-theoretic troubleshooting is one of the areas to which Bayesian networks can be applied. Given a probabilistic model of a malfunctioning man-made device, the task is to construct a repair strategy with minimal expected cost. The…

Artificial Intelligence · Computer Science 2013-08-02 Václav Lín

A smooth embedding of a closed $3$-manifold $M$ in $\mathbb{R}^4$ may generically be composed with projection to the fourth coordinate to determine a Morse function on $M$ and hence a Heegaard splitting $M=X\cup_\Sigma Y$. However, starting…

Geometric Topology · Mathematics 2019-06-10 Ian Agol , Michael H. Freedman

We convert, within polynomial-time and sequential processing, NP-Complete Problems into a problem of deciding feasibility of a given system S of linear equations with constants and coefficients of binary-variables that are 0, 1, or -1. S is…

Computational Complexity · Computer Science 2012-10-23 Deepak Ponvel Chermakani

We study the computational complexity of deciding whether a given set of term equalities and inequalities has a solution in an $\omega$-categorical algebra $\mathfrak{A}$. There are $\omega$-categorical groups where this problem is…

Logic · Mathematics 2021-05-18 Manuel Bodirsky , Thomas Quinn-Gregson

The standard proof of NP-Hardness of 3DM provides a power-$4$ reduction of 3SAT to 3DM. In this note, we provide a linear-time reduction. Under the exponential time hypothesis, this reduction improves the runtime lower bound from…

Computational Complexity · Computer Science 2020-03-03 Shrinu Kushagra

Calculating the probability of an individual solution being selected under lexicase selection is an important problem in attempts to develop a deeper theoretical understanding of lexicase selection, a state-of-the art parent selection…

Neural and Evolutionary Computing · Computer Science 2023-04-25 Emily Dolson

The main goal of this paper is to show that shellability is NP-hard for triangulated d-balls (this also gives hardness for triangulated d-manifolds/d-pseudomanifolds with boundary) as soon as d is at least 3. This extends our earlier work…

Computational Geometry · Computer Science 2024-07-26 Pavel Paták , Martin Tancer

We show that the only closed 4-manifolds admitting genus two trisections are $S^2 \times S^2$ and connected sums of $S^1 \times S^3$, $\mathbb{CP}^2$, and $\overline{\mathbb{CP}}^2$ with two summands. Moreover, each of these manifolds…

Geometric Topology · Mathematics 2017-06-14 Jeffrey Meier , Alexander Zupan

We describe an example of a closed orientable 3-manifold with distinct distance three genus two Heegaard splittings. This demonstrates that the constructions of alternate genus two Heegaard splittings of closed orientable 3-manifolds…

Geometric Topology · Mathematics 2009-12-08 John Berge

For each integer k > 1, Johnson gave a 3-manifold with Heegaard splittings of genera 2k and 2k-1 such that any common stabilization of these two surfaces has genus at least 3k-1. We modify his argument to produce a 3-manifold with two…

Geometric Topology · Mathematics 2011-12-30 Kazuto Takao

This paper investigates an extremely classic NP-complete problem: How to determine if a graph G, where each vertex has a degree of at most 4, can be 3-colorable(The research in this paper focuses on graphs G that satisfy the condition where…

Computational Complexity · Computer Science 2024-05-21 Zikang Deng

We define integral measures of complexity for Heegaard splittings based on the graph dual to the curve complex and on the pants complex defined by Hatcher and Thurston. As the Heegaard splitting is stabilized, the sequence of complexities…

Geometric Topology · Mathematics 2009-04-17 Jesse Johnson

A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum-weight triangulation (MWT) problem, we are looking for a triangulation of a given point set that minimizes the sum of the edge…

Computational Geometry · Computer Science 2010-04-19 Wolfgang Mulzer , Guenter Rote

In this paper we introduce "critical surfaces", which are described via a 1-complex whose definition is reminiscent of the curve complex. Our main result is that if the minimal genus common stabilization of a pair of strongly irreducible…

Geometric Topology · Mathematics 2007-05-23 David Bachman

Given a 3-uniform hypergraph H, its 2-intersection graph G has for vertex set the hyperedges of H and ee' is an edge of G whenever e and e' have exactly two common vertices in H. Di Marco et al. prove that deciding wether a graph G is the…

Combinatorics · Mathematics 2023-05-24 Niccolò Di Marco , Andrea Frosini , Christophe Picouleau

In this paper we give a method to construct Heegaard splittings of oriented graph manifolds with orientable bases. A graph manifold is a closed $3$-manifold admitting only Seifert-fibered pieces in its Jaco-Shalen decomposition; for…

Geometric Topology · Mathematics 2018-02-21 Enrique Artal Bartolo , Simón Isaza Peñaloza , Miguel Marco-BuzunÁriz

We give a new elementary proof of the parallelizability of closed orientable 3-manifolds. We use as the main tool the fact that any such manifold admits a Heegaard splitting.

Geometric Topology · Mathematics 2023-01-04 Valentina Bais , Daniele Zuddas

Let M be a closed orientable 3-manifold with a negatively curved Riemannian metric. Let {M_i} be a collection of finite regular covers with degree d_i. (1) If the Heegaard genus of M_i grows more slowly than the square root of d_i, then M_i…

Geometric Topology · Mathematics 2007-05-23 Marc Lackenby

Given a satisfiable instance of 1-in-3 SAT, it is NP-hard to find a satisfying assignment for it, but it may be possible to efficiently find a solution subject to a weaker (not necessarily Boolean) predicate than `1-in-3'. There is a…

Computational Complexity · Computer Science 2025-08-21 Andrei Krokhin , Danny Vagnozzi