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:
Online Access:http://hdl.handle.net/1828/11069
id ndltd-uvic.ca-oai-dspace.library.uvic.ca-1828-11069
record_format oai_dc
spelling ndltd-uvic.ca-oai-dspace.library.uvic.ca-1828-110692019-08-28T16:40:19Z 3-manifolds algorithmically bound 4-manifolds Churchill, Samuel Mehlenbacher, Alan Budney, Ryan David Topology Geometric Topology Computational Topology Low-Dimensional Topology 3-manifold 4-manifold Triangulation Algorithmic Construction 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 such a triangulation. Our first step in this bordism construction is the geometric partitioning of an initial 3–manifold M using smooth singularity theory. This partition provides handle attachment sites on the 4–manifold Mx[0,1] and the ensuing handle attachments eliminate one of the boundary components of Mx[0,1], yielding a 4-manifold with boundary exactly M. We first present the construction in the smooth case before extending the smooth singularity theory to triangulated 3–manifolds. Graduate 2019-08-27T22:39:21Z 2019-08-27T22:39:21Z 2019 2019-08-27 Thesis http://hdl.handle.net/1828/11069 English en Available to the World Wide Web application/pdf
collection NDLTD
language English
en
format Others
sources NDLTD
topic Topology
Geometric Topology
Computational Topology
Low-Dimensional Topology
3-manifold
4-manifold
Triangulation
Algorithmic Construction
spellingShingle Topology
Geometric Topology
Computational Topology
Low-Dimensional Topology
3-manifold
4-manifold
Triangulation
Algorithmic Construction
Churchill, Samuel
3-manifolds algorithmically bound 4-manifolds
description 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 such a triangulation. Our first step in this bordism construction is the geometric partitioning of an initial 3–manifold M using smooth singularity theory. This partition provides handle attachment sites on the 4–manifold Mx[0,1] and the ensuing handle attachments eliminate one of the boundary components of Mx[0,1], yielding a 4-manifold with boundary exactly M. We first present the construction in the smooth case before extending the smooth singularity theory to triangulated 3–manifolds. === Graduate
author2 Mehlenbacher, Alan
author_facet Mehlenbacher, Alan
Churchill, Samuel
author Churchill, Samuel
author_sort Churchill, Samuel
title 3-manifolds algorithmically bound 4-manifolds
title_short 3-manifolds algorithmically bound 4-manifolds
title_full 3-manifolds algorithmically bound 4-manifolds
title_fullStr 3-manifolds algorithmically bound 4-manifolds
title_full_unstemmed 3-manifolds algorithmically bound 4-manifolds
title_sort 3-manifolds algorithmically bound 4-manifolds
publishDate 2019
url http://hdl.handle.net/1828/11069
work_keys_str_mv AT churchillsamuel 3manifoldsalgorithmicallybound4manifolds
_version_ 1719238259392905216