Heegaard disc-subset distance conjecture for triangulation complexity
Heegaard disc-subset distance conjecture for triangulation complexity
Let be a closed orientable manifold with a Heegaard surface that divides into handlebodies and . Let be the spine graph of , and let and be the disc subsets associated to and . The Heegaard disc-subset distance conjecture. The complexity is bounded above and below by linear functions of the distance in between and . The conjecture proposes a complexity estimate for a manifold presented by a Heegaard splitting; the source does not state any resolution.
Sources & referencesView supporting material
Primary source
Marc Lackenby and Jessica S. Purcell, “The triangulation complexity of fibred 3-manifolds”, arXiv:1910.10914 (2022).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.