Computing trisections of 4-manifolds.
basic_science · Level V
Where this comes from
- Record sourced from PubMed, PMID 30348800.
- Also identified by DOI 10.1073/pnas.1717173115 and PMC identifier 6205454.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
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.