# Finding Non-Orientable Surfaces in 3-Manifolds

@article{Burton2016FindingNS, title={Finding Non-Orientable Surfaces in 3-Manifolds}, author={Benjamin A. Burton and A. D. Mesmay and Uli Wagner}, journal={ArXiv}, year={2016}, volume={abs/1602.07907} }

We investigate the complexity of finding an embedded non-orientable surface of Euler genus g in a triangulated 3-manifold. This problem occurs both as a natural question in low-dimensional topology, and as a first non-trivial instance of embeddability of complexes into 3-manifolds. We prove that the problem is NP-hard, thus adding to the relatively few hardness results that are currently known in 3-manifold topology. In addition, we show that the problem lies in NP when the Euler genus g is odd… Expand

#### 5 Citations

Embeddability in the 3-Sphere Is Decidable

- Computer Science, Mathematics
- J. ACM
- 2018

We show that the following algorithmic problem is decidable: given a 2-dimensional simplicial complex, can it be embedded (topologically, or equivalently, piecewise linearly) in R3? By a known… Expand

Embeddability in R 3 is NP-hard

- Mathematics
- SODA 2018
- 2018

We prove that the problem of deciding whether a 2-or 3-dimensional simplicial complex embeds into R3 is NP-hard. This stands in contrast with the lower dimensional cases which can be solved in linear… Expand

Some Conditionally Hard Problems on Links and 3-Manifolds

- Mathematics, Computer Science
- Discret. Comput. Geom.
- 2017

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… Expand

Computing Heegaard Genus is NP-Hard

- Mathematics
- 2017

We show that Heegaard Genus ≤ g, the problem of deciding whether a triangulated 3-manifold admits a Heegaard splitting of genus less than or equal to g, is NP-hard. The result follows from a… Expand

Atomic Embeddability, Clustered Planarity, and Thickenability

- Computer Science, Mathematics
- SODA
- 2020

A polynomial-time reduction from atomic embeddability to thickenability is given, thereby showing that both problems are polynomially equivalent, and it is shown that a slight generalization of atomic embedDability to the setting in which clusters are toroidal graphs is NP-complete. Expand

#### References

SHOWING 1-10 OF 48 REFERENCES

Nonorientable surfaces in some non-haken 3-manifolds

- Mathematics
- 1982

If a closed, irreducible, orientable 3-manifold M does not possess any 2-sided incompressible surfaces, then it can be very useful to investigate embedded one-sided surfaces in M of minimal genus. In… Expand

Embeddability in the 3-Sphere Is Decidable

- Computer Science, Mathematics
- J. ACM
- 2018

We show that the following algorithmic problem is decidable: given a 2-dimensional simplicial complex, can it be embedded (topologically, or equivalently, piecewise linearly) in R3? By a known… Expand

Nonorientable surfaces in homology cobordisms

- Mathematics
- 2015

We investigate constraints on embeddings of a nonorientable surface in a 4–manifold with the homology of M I , where M is a rational homology 3–sphere. The constraints take the form of inequalities… Expand

The efficient certification of knottedness and Thurston norm

- Mathematics
- 2016

We show that the problem of determining whether a knot in the 3-sphere is non-trivial lies in NP. This is a consequence of the following more general result. The problem of determining whether the… Expand

The Computational Complexity of Knot Genus and Spanning Area

- Mathematics
- 2002

We investigate the computational complexity of some problems in three-dimensional
topology and geometry. We show that the problem of determining a bound on the genus of a
knot in a 3-manifold, is… Expand

Some Conditionally Hard Problems on Links and 3-Manifolds

- Mathematics, Computer Science
- Discret. Comput. Geom.
- 2017

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… Expand

Algorithmic homeomorphism of 3-manifolds as a corollary of geometrization

- Mathematics
- Pacific Journal of Mathematics
- 2019

In this paper we prove two results, one semi-historical and the other new. The semi-historical result, which goes back to Thurston and Riley, is that the geometrization theorem implies that there is… Expand

An algorithm to determine the Heegaard genus of a 3-manifold

- Mathematics
- 2010

We give an algorithmic proof of the theorem that a closed orientable irreducible and atoroidal 3-manifold has only finitely many Heegaard splittings in each genus, up to isotopy. The proof gives an… Expand

On 3-manifolds

- Mathematics
- 2005

It is well known that a three dimensional (closed, connected and compact) manifold is obtained by identifying boundary faces from a polyhedron P. The study of (\partial P)/~, the boundary \partial P… Expand

Seifert fibered spaces in 3-manifolds

- Mathematics
- 1979

Publisher Summary This chapter describes Seifert Fibered Spaces in 3-Manifolds. There exist finitely many disjoint, non-contractible, pairwise non-parallel, embedded 2-spheres in M, whose homotopy… Expand