Author:
Bell Mark,Hass Joel,Rubinstein Joachim Hyam,Tillmann Stephan
Abstract
We describe an algorithm to compute trisections of orientable four-manifolds using arbitrary triangulations as input. This 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.
Funder
National Science Foundation
Australian Research Council
Publisher
Proceedings of the National Academy of Sciences
Reference21 articles.
1. Thin position and the recognition problem for
S
3;Thompson;Math Res Lett,1994
2. 0-efficient triangulations of 3-manifolds;Jaco;J Differ Geom,2003
3. Construction and recognition of hyperbolic 3-manifolds with geodesic boundary;Frigerio;Trans Amer Math Soc,2004
4. Dunfield NM Hirani AN (2011) The least spanning area of a knot and the optimal bounding chain problem. Computational Geometry (SCG’11), eds Hurtado F van Kreveld M (ACM, New York), pp 135–144.
5. An algorithm to determine the Heegaard genus of a 3-manifold;Li;Geom Topol,2011
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献