Skip to main content
Download PDF
- Main
Computing trisections of 4-manifolds
Published Web Location
https://doi.org/10.1073/pnas.1717173115Abstract
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.
Many UC-authored scholarly publications are freely available on this site because of the UC's open access policies. Let us know how this access is important for you.
Main Content
For improved accessibility of PDF content, download the file to your device.
Enter the password to open this PDF file:
File name:
-
File size:
-
Title:
-
Author:
-
Subject:
-
Keywords:
-
Creation Date:
-
Modification Date:
-
Creator:
-
PDF Producer:
-
PDF Version:
-
Page Count:
-
Page Size:
-
Fast Web View:
-
Preparing document for printing…
0%