Related papers: Computing Heegaard genus is NP-hard

We introduce a computational origami problem which we call the segment folding problem: given a set of $n$ line-segments in the plane the aim is to make creases along all segments in the minimum number of folding steps. Note that a folding…

Given an order, a commutative ring whose additive group is free of finite rank, a natural computational question is whether a fixed univariate polynomial $f \in \mathbb{Z}[X]$ has a root in this ring. In this paper, we show that the…

We show that the correction terms in Heegaard Floer homology give a lower bound to the the genus of one-sided Heegaard splittings and the $\mathbb Z_2$--Thurston norm. Using a result of Jaco--Rubinstein--Tillmann, this gives a lower bound…

We prove a rigidity theorem for degree one maps between small 3-manifolds using Heegaard genus, and provide some applications and connections to Heegaard genus and Dehn surgery problems.

A manifold which admits a reducible genus-$2$ Heegaard splitting is one of the $3$-sphere, $S^2 \times S^1$, lens spaces or their connected sums. For each of those splittings, the complex of Haken spheres is defined. When the manifold is…

In this paper, we show that, for each non-trivial two bridge knot K and for each g > 2, every genus g Heegaard splitting of the exterior E(K) of K is reducible.

Recently a large number of graph separator problems have been proven to be \textsc{NP-Hard}. Amazingly we have found that $\alpha$-Subgraph-Balanced-Vertex-Separator, an important variant, has been overlooked. In this work ``Yet Another…

If $X$ is a smooth complex projective 3-fold with ample canonical divisor $K$, then the inequality $K^3\ge {2/3}(2p_g-7)$ holds, where $p_g$ denotes the geometric genus. This inequality is nearly sharp. We also give similar, but more…

We investigate the computational complexity of the problem of deciding if an algebra homomorphism can be factored through an intermediate algebra. Specifically, we fix an algebraic language, L, and take as input an algebra homomorphism f…

We prove that it is NP-hard to decide whether two points in a polygonal domain with holes can be connected by a wire. This implies that finding any approximation to the shortest path for a long snake amidst polygonal obstacles is NP-hard.…

A famous example of Casson and Gordon shows that a Haken 3-manifold can have an infinite family of irreducible Heegaard splittings with different genera. In this paper, we prove that a closed non-Haken 3-manifold has only finitely many…

In phylogenetics, the consensus problem consists in summarizing a set of phylogenetic trees that all classify the same set of species into a single tree. Several definitions of consensus exist in the literature; in this paper we focus on…

We study the growth of the rank of subgroups of finite index in residually finite groups, by relating it to the notion of cost. As a by-product, we show that the `Rank vs. Heegaard genus' conjecture on hyperbolic 3-manifolds is incompatible…

We give a new perspective of Heegaard splittings in terms square complexes and Guirardel's notion of a \textit{core} which allows for combinatorial measurement of the obstruction to being a connect sum of Heegaard diagrams. A Heegaard…

Let M be a closed, irreducible, genus two 3-manifold, and F a maximal collection of pairwise disjoint, closed, orientable, incompressible surfaces embedded in M. Then each component manifold M_i of M-F has handle number at most one, i.e.…

Let $M$ be a 3-manifold with torus boundary components $T_1$ and $T_2$. Let $\phi \colon T_1 \to T_2$ be a homeomorphism, $M_\phi$ the manifold obtained from $M$ by gluing $T_1$ to $T_2$ via the map $\phi$, and $T$ the image of $T_1$ in…

NP-Complete problems have an important attribute that if one NP-Complete problem can be solved in polynomial time, all NP-Complete problems will have a polynomial solution. The 3-CNF-SAT problem is a NP-Complete problem and the primary…

The relationship between the complexity classes $P$ and $NP$ is an unsolved question in the field of theoretical computer science. In the first part of this paper, a lattice framework is proposed to handle the 3-CNF-SAT problems, known to…

We prove that for every $d\geq 2$, deciding if a pure, $d$-dimensional, simplicial complex is shellable is NP-hard, hence NP-complete. This resolves a question raised, e.g., by Danaraj and Klee in 1978. Our reduction also yields that for…

We prove a complexity dichotomy for a class of counting problems expressible as bipartite 3-regular Holant problems. For every problem of the form $\operatorname{Holant}\left(f\mid =_3 \right)$, where $f$ is any integer-valued ternary…