3-manifolds algorithmically bound 4-manifolds

3-manifolds algorithmically bound 4-manifolds

This thesis presents an algorithm for producing 4–manifold triangulations with boundary an arbitrary orientable, closed, triangulated 3–manifold. The research is an extension of Costantino and Thurston’s work on determining upper bounds on the number of 4–dimensional simplices necessary to construct...

Full description

Bibliographic Details
Main Author: Churchill, Samuel
Other Authors: Mehlenbacher, Alan
Format: Others
Language:English
en
Published: 2019
Subjects:
Topology
Geometric Topology
Computational Topology
Low-Dimensional Topology
3-manifold
4-manifold
Triangulation
Algorithmic Construction
Online Access:http://hdl.handle.net/1828/11069

Internet

http://hdl.handle.net/1828/11069

Similar Items