← All problems

8.4 (Schleimer) — Detecting reducible Heegaard splittings

Given a Heegaard splitting M=H1∪ΣH2M=H_1\cup_\Sigma H_2, where the handlebodies H1,H2H_1,H_2 meet along the splitting surface Σ\Sigma, the question is: is there an algorithm to decide whether the splitting is reducible and, if so, to find a reducing curve? A reducing curve is an essential simple closed curve c⊂Σc\subset\Sigma that bounds a properly embedded disk in each handlebody:

∃Di⊂Hiwith∂D1=∂D2=c.\exists D_i\subset H_i\quad\text{with}\quad \partial D_1=\partial D_2=c.

Thus reducibility means that such a cc exists. The original question does not specify a class of manifolds or an encoding of the splitting as algorithmic input. Problems in Groups, Geometry, and Three-Manifolds (2015) Heegaard splittings of compact 3-manifolds

Background

Heegaard splittings describe a 3-manifold by gluing two handlebodies along their common boundary; the construction is attributed to Heegaard, though it may have been known to Poincaré. A reducing curve records a sphere meeting the splitting surface in one essential circle. Haken’s theorem gives related motivation: if the manifold is reducible, then every Heegaard splitting of it is reducible. That existence theorem does not itself provide an algorithm for deciding reducibility of a given splitting and producing its reducing curve. Heegaard splittings of compact 3-manifolds

Normal-surface methods make the search algorithmic by encoding surfaces with finitely many coordinates and reducing existence questions to a finite collection of candidates. For sphere questions, recognizing whether a candidate sphere bounds a ball is an additional difficulty; the account describes the use of almost-normal surfaces, which allow a single exceptional octagon in an otherwise normal surface. Heegaard splittings of compact 3-manifolds

References

Status

Source: Delp, Hoffoss and Manning - Problems In Groups, Geometry, and Three-Manifolds (2015) (proposed by Schleimer)

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.