Computing trisections of 4-manifolds

@article{Bell2018ComputingTO,
  title={Computing trisections of 4-manifolds},
  author={Mark C. Bell and Joel Hass and Joachim Hyam Rubinstein and Stephan Tillmann},
  journal={Proceedings of the National Academy of Sciences},
  year={2018},
  volume={115},
  pages={10901 - 10907}
}
Significance Algorithms that decompose a manifold into simple pieces reveal the geometric and topological structure of the manifold, showing how complicated structures are constructed from simple building blocks. This note describes a way to algorithmically construct a trisection, which describes a four-dimensional manifold as a union of three four-dimensional 1-handlebodies. The complexity of the 4-manifold is captured in a collection of curves on a surface, which guide the gluing of the 1… 

Figures from this paper

Generalized trisections in all dimensions
TLDR
This paper constructs multisections, which describe an n-dimensional manifold as a union of k-dimensional handlebodies, where n=2k or 2k+1, and describes a generalization of Heegaard splittings of 3-manifolds and trisection of 4- manifolds to all dimensions, using triangulations as a key tool.
The Trisection Genus of Standard Simply Connected PL 4-Manifolds
TLDR
It is shown that the K3 surface has trisection genus 22, which implies that the trisected genus of all standard simply connected PL 4-manifolds is known.
Trisections of 4-manifolds
  • R. Kirby
  • Mathematics
    Proceedings of the National Academy of Sciences
  • 2018
TLDR
The gauge theory invariants are very good at distinguishing smooth 4-manifolds that are homotopy equivalent but do not help at showing that they are diffeomorphic, so what is missing is the equivalent of the higher-dimensional s-cobordism theorem, a key to the successes in higher dimensions.
Determining the Trisection Genus of Orientable and Non-Orientable PL 4-Manifolds through Triangulations
Gay and Kirby recently introduced the concept of a trisection for arbitrary smooth, oriented closed 4-manifolds, and with it a new topological invariant, called the trisection genus. This paper
ON THE ADDITIVITY OF TRISECTION GENUS
In this paper, we explain what a trisection of a 4-manifold is and show how to construct one. A trisection naturally gives rise to a quadruple of non-negative integers (g; g0, g1, g2), encoding the
Crystallizations of compact 4-manifolds minimizing combinatorially defined PL-invariants
The present paper is devoted to present a unifying survey about some special classes of crystallizations of compact PL $4$-manifolds with empty or connected boundary, called {\it semi-simple} and
Trisections in colored tensor models
We give a procedure to construct (quasi-)trisection diagrams for closed (pseudo-)manifolds generated by colored tensor models without restrictions on the number of simplices in the triangulation,
Gem-induced trisections of compact PL $4$-manifolds
The idea of studying trisections of closed smooth $4$-manifolds via (singular) triangulations, endowed with a suitable vertex-labelling by three colors, is due to Bell, Hass, Rubinstein and Tillmann,

References

SHOWING 1-10 OF 31 REFERENCES
Trisecting 4–manifolds
We show that any smooth, closed, oriented, connected 4‐manifold can be trisected into three copies of \ k .S 1 B 3 /, intersecting pairwise in 3‐dimensional handlebodies, with triple intersection a
The Trisection Genus of Standard Simply Connected PL 4-Manifolds
TLDR
It is shown that the K3 surface has trisection genus 22, which implies that the trisected genus of all standard simply connected PL 4-manifolds is known.
Construction and recognition of hyperbolic 3-manifolds with geodesic boundary
We extend to the context of hyperbolic 3-manifolds with geodesic boundary Thurston's approach to hyperbolization by means of geometric triangulations. In particular, we introduce moduli for
0-Efficient Triangulations of 3-Manifolds
efficient triangulations of 3-manifolds are defined and studied. It is shown that any triangulation of a closed, orientable, irreducible 3-manifold M can be modified to a 0-efficient triangulation
The pachner graph and the simplification of 3-sphere triangulations
TLDR
Experimental work is presented suggesting that for 3-sphere triangulations the reality is far different: the authors never need to add more than two tetrahedra, and they never need more than a handful of local modifications.
Even triangulations of n–dimensional pseudo-manifolds
This paper introduces even triangulations of n-dimensional pseudo-manifolds and links their combinatorics to the topology of the pseudo-manifolds. This is done via normal hypersurface theory and the
The least spanning area of a knot and the optimal bounding chain problem
TLDR
It is shown here that a natural discrete version of the least area surface can be found in polynomial time, and it is proved that the related Optimal Homologous Chain Problem is NP-complete for homology with integer coefficients.
Courcelle's theorem for triangulations
Verified Computations for Hyperbolic 3-Manifolds
TLDR
Central to the method is an implementation of interval arithmetic and Krawczyk's test that represents an improvement over existing algorithms as they are faster while accounting for error accumulation in a more direct and user-friendly way.
The manifold smoothing problem
The proof commences with a modification of a procedure due to H. Noguchi [5] yielding an e-isotopy of E carrying P n _ 1 , on D, into a polyhedron Q~, admitting a transverse vector field. A
...
...