Using complexity bounds to study positive Heegaard diagrams of genus two
dc.contributor.advisor | Hempel, John | en_US |
dc.creator | Bellis, Amy Christner | en_US |
dc.date.accessioned | 2009-06-04T08:21:57Z | en_US |
dc.date.available | 2009-06-04T08:21:57Z | en_US |
dc.date.issued | 2001 | en_US |
dc.description.abstract | The complexity of a Heegaard splitting is the minimal intersection number of two essential simple closed curves which bound disks on either side of the splitting. In order to study the complexity of a splitting, we discuss symmetries and other properties of positive genus two Heegaard diagrams. The complementary regions in such a diagram are either octagonal or square, and we are able to find upper and lower bounds on the complexity of the splitting represented by the diagram in terms of the number of complementary squares of each of nine types. We are then able to give obstructions to a manifold being Seifert fibered in terms of this data, in addition to showing that manifolds with diagrams of a particular type are Seifert fibered. We also discuss manifolds with a Heegaard splitting of complexity two or less, which are Seifert fibered. We show how to compute the orbit space and the Seifert invariants for these manifolds. | en_US |
dc.format.extent | 88 p. | en_US |
dc.format.mimetype | application/pdf | en_US |
dc.identifier.callno | THESIS MATH. 2001 BELLIS | en_US |
dc.identifier.citation | Bellis, Amy Christner. "Using complexity bounds to study positive Heegaard diagrams of genus two." (2001) Diss., Rice University. <a href="https://hdl.handle.net/1911/17937">https://hdl.handle.net/1911/17937</a>. | en_US |
dc.identifier.uri | https://hdl.handle.net/1911/17937 | en_US |
dc.language.iso | eng | en_US |
dc.rights | Copyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder. | en_US |
dc.subject | Mathematics | en_US |
dc.title | Using complexity bounds to study positive Heegaard diagrams of genus two | en_US |
dc.type | Thesis | en_US |
dc.type.material | Text | en_US |
thesis.degree.department | Mathematics | en_US |
thesis.degree.discipline | Natural Sciences | en_US |
thesis.degree.grantor | Rice University | en_US |
thesis.degree.level | Doctoral | en_US |
thesis.degree.name | Doctor of Philosophy | en_US |
Files
Original bundle
1 - 1 of 1