Related papers: Computing Heegaard genus is NP-hard
For the genus-$4$ Heegaard surface in the $3$-sphere, we present a sufficient condition for a non-separating weak reducing pair to be separated by a reducing sphere for the surface. As a consequence, we reduce the connectivity problem in…
We study complexity of rearrangement problems in the generalized breakpoint model and settle several open questions. The model was introduced by Tannier et al. (2009) who showed that the median problem is solvable in polynomial time in the…
It is a classical result that any complex analytic Lie supergroup $\mathcal{G}$ is split \cite{kosz}, that is its structure sheaf is isomorphic to the structure sheaf of a certain vector bundle. However, there do exist non-split complex…
The K-way vertex cut problem} consists in, given a graph G, finding a subset of vertices of a given size, whose removal partitions G into the maximum number of connected components. This problem has many applications in several areas. It…
Using Seifert fibered three-manifold examples of Boileau and Zieschang, we demonstrate that the Reshetikhin-Turaev quantum invariants may be used to provide a sharp lower bound on the Heegaard genus which is strictly larger than the rank of…
The Surjective Homomorphism problem is to test whether a given graph G called the guest graph allows a vertex-surjective homomorphism to some other given graph H called the host graph. The bijective and injective homomorphism problems can…
An NP-complete coloring or homomorphism problem may become polynomial time solvable when restricted to graphs with degrees bounded by a small number, but remain NP-complete if the bound is higher. For instance, 3-colorability of graphs with…
For a fixed property (graph class) ${\Pi}$, given a graph G and an integer k, the ${\Pi}$-deletion problem consists in deciding if we can turn $G$ into a graph with the property ${\Pi}$ by deleting at most $k$ edges. The ${\Pi}$-deletion…
The idea of computing Matveev complexity by using Heegaard decompositions has been recently developed by two different approaches: the first one for closed 3-manifolds via crystallization theory, yielding the notion of Gem-Matveev…
We define essential and strongly essential triangulations of 3-manifolds, and give four constructions using different tools (Heegaard splittings, hierarchies of Haken 3-manifolds, Epstein-Penner decompositions, and cut loci of Riemannian…
We show there exists a linear function w: N->N with the following property. Let K be a hyperbolic knot in a hyperbolic 3-manifold M admitting a non-longitudinal S^3 surgery. If K is put into thin position with respect to a strongly…
The 3SUM problem represents a class of problems conjectured to require $\Omega (n^2)$ time to solve, where $n$ is the size of the input. Given two polygons $P$ and $Q$ in the plane, we show that some variants of the decision problem,…
This paper investigates why and when the edge-based districting problem becomes computationally intractable. The overall problem is represented as an exact mathematical programming formulation consisting of an objective function and several…
Haken showed that the Heegaard splittings of reducible 3-manifolds are reducible, that is, a reducing 2-sphere can be found which intersects the Heegaard surface in a single simple closed curve. When the genus of the "interesting" surface…
We study the problem of computing minimal distinguishing formulas for non-bisimilar states in finite LTSs. We show that this is NP-hard if the size of the formula must be minimal. Similarly, the existence of a short distinguishing trace is…
We show that P2T - the problem of deciding whether the edge set of a simple graph can be partitioned into two trees or not - is NP-complete.
We improve and extend to the non-orientable case a recent result of Karabas, Malicki and Nedela concerning the classification of all orientable prime 3-manifolds of Heegaard genus two, triangulated with at most 42 coloured tetrahedra.
It has recently been established by Below, De Loera, and Richter-Gebert that finding a minimum size (or even just a small) triangulation of a convex polyhedron is NP-complete. Their 3SAT-reduction proof is discussed.
We answer, in the affirmative, the following question proposed by Mike Steel as a $100 challenge: "Is the following problem NP-hard? Given a ternary phylogenetic X-tree T and a collection Q of quartet subtrees on X, is T the only tree that…
We study the decision version of tensor spectral norm from the viewpoint of real algebraic complexity. For a rationally specified tensor, the tensor spectral threshold problem asks whether its spectral norm exceeds a prescribed rational…