The least spanning area of a knot and the optimal bounding chain problem

@inproceedings{Dunfield2011TheLS,
  title={The least spanning area of a knot and the optimal bounding chain problem},
  author={Nathan M. Dunfield and Anil N. Hirani},
  booktitle={SoCG '11},
  year={2011}
}
Two fundamental objects in knot theory are the minimal genus surface and the least area surface bounded by a knot in a 3-dimensional manifold. When the knot is embedded in a general 3-manifold, the problems of finding these surfaces were shown to be NP-complete and NP-hard respectively. However, there is evidence that the special case when the ambient manifold is R^3, or more generally when the second homology is trivial, should be considerably more tractable. Indeed, we show here that a… Expand
Finding surfaces in simplicial complexes with bounded-treewidth 1-skeleton
TLDR
Using some of the techniques developed for the 2-Dim-Bounded-Surface problem, fixed parameter tractable algorithms are obtained for other topological problems such as computing an optimal chain with a given boundary and computing a optimal chain in a given homology class. Expand
Pachner moves, generic complexity, and randomising 3-manifold triangulations
We study the computational complexity of decision problems on triangulated 3-manifolds. In this setting there has been encouraging initial progress in recent years, but many important questionsExpand
Traversing three-manifold triangulations and spines
A celebrated result concerning triangulations of a given closed 3-manifold is that any two triangulations with the same number of vertices are connected by a sequence of so-called 2-3 and 3-2 moves.Expand
Homology flows, cohomology cuts
TLDR
This work describes the first algorithms to compute maximum flows in surface-embedded graphs in near-linear time, and key insight is to optimize the relative homology class of the flow, rather than directly optimizing the flow itself. Expand
The Parameterized Complexity of Finding Minimum Bounded Chains
TLDR
It is proved that the Minimum Bounded Chain problem is NP-hard for all d ≥ 2, if the authors parameterize the problem by solution size, and introduced and implemented two fixed parameter tractable (FPT) algorithms solving the MBCd problem for alld. Expand
Non Total-Unimodularity Neutralized Simplicial Complexes
TLDR
A condition on the simplicial complex called non total-unimodularityneutralized, or NTU neutralized, is defined, which ensures that even when the boundary matrix is not TU, the OHCP LP must contain an integral optimal vertex for every input chain. Expand
Computing trisections of 4-manifolds
TLDR
An algorithm to compute trisections of orientable four- manifolds using arbitrary triangulations as input results in explicit complexity bounds for the trisection genus of a 4-manifold in terms of the number of pentachora (4-simplices) in a triangulation. Expand
Data-inspired advances in geometric measure theory: generalized surface and shape metrics
Modern geometric measure theory, developed largely to solve the Plateau problem, has generated a great deal of technical machinery which is unfortunately regarded as inaccessible by outsiders. SomeExpand
Combinatorial optimization on embedded curves
TLDR
This work improves the best known algorithm for computing the maximum (s, t)-flow on surface embedded graph after 20 years and proves that computing the shortest even subgraph in a Z2-homology class is in general NP-hard, which explains the exponential dependence on g. Expand
The complexity of detecting taut angle structures on triangulations
TLDR
It is proved that detecting taut angle structures is NP-complete, but also fixed-parameter tractable in the treewidth of the face pairing graph of the triangulation. Expand
...
1
2
3
...

References

SHOWING 1-10 OF 40 REFERENCES
The complexity of the normal surface solution space
TLDR
A comprehensive analysis of millions of triangulations is undertaken and finds that in general the number of vertex normal surfaces is remarkably small, with strong evidence that the authors' pathological triangulation may in fact be the worst case scenarios. Expand
Intersections of least area surfaces
It is shown that hyperbolic 3-space contains an embedded curve γ with the property that any least area disk bounded by γ must intersect P. It follows that least area surfaces in 3-manifolds sometimesExpand
Optimal homologous cycles, total unimodularity, and linear programming
TLDR
The result implies, among other things, that one can compute in polynomial time an optimal (d-1)-cycle in a given homology class for any triangulation of an orientable compact d-manifold or for any finite simplicial complex embedded in Rd. Expand
The Computational Complexity of Knot Genus and Spanning Area
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, isExpand
Hardness Results for Homology Localization
TLDR
This paper addresses the problem of localizing homology classes, namely, finding the cycle representing a given class with the most concise geometric measure, and proves the problem is NP-hard to approximate within any constant factor. Expand
Hardness Results for Homology Localization
TLDR
This work addresses the problem of localizing homology classes, namely, finding the cycle representing a given class with the most concise geometric measure, and proves that for homology of dimension two or higher, the problem is NP-hard to approximate even when the Betti number is O(1). Expand
Maximal admissible faces and asymptotic bounds for the normal surface solution space
TLDR
Significant improvements upon the best known asymptotic bounds on the number of admissible vertices are improved, using polytopes in both the standard normal surface coordinate system and the streamlined quadrilateral coordinate system. Expand
Computational Aspects of Discrete Minimal Surfaces
In differential geometry the study of smooth submanifolds with distinguished curvature properties has a long history and belongs to the central themes of this Þeld. Modern work on smoothExpand
Incompressibility criteria for spun-normal surfaces
We give a simple sufficient condition for a spun-normal surface in an ideal triangulation to be incompressible, namely that it is a vertex surface with non-empty boundary which has a quadrilateral inExpand
Optimizing the double description method for normal surface enumeration
TLDR
An account of the vertex enumeration problem as it applies to normal surfaces is given and new optimizations that yield strong improvements in both running time and memory consumption are presented. Expand
...
1
2
3
4
...