Title Information
Title
Lifting Arc Diagrams Under Branched Covers: An Inverse Problem and its Algorithmic Solution
Name: Personal
Name Part
Peterpaul, Cyrus
Role
Role Term: Text
creator
Name: Personal
Name Part
Kahn, Jeremy
Role
Role Term: Text
Advisor
Name: Personal
Name Part
Mann, Katherine
Role
Role Term: Text
Reader
Name: Personal
Name Part
Goodwillie, Thomas
Role
Role Term: Text
Reader
Name: Corporate
Name Part
Brown University. Department of Mathematics
Role
Role Term: Text
sponsor
Origin Information
Copyright Date
2019
Physical Description
Extent
vii, 45 p.
digitalOrigin
born digital
Note: thesis
Thesis (Ph. D.)--Brown University, 2019
Genre (aat)
theses
Abstract
Arc diagrams are simple, combinatorial objects associated to surfaces with boundary. They consist of homotopy classes of disjoint curves, and can be thought of as embedded graphs on suitably marked surfaces. This dissertation examines the behavior of weighted arc diagrams, that is, diagrams with nonnegative real numbers assigned to each arc, under branched covering maps. The lift of an arc under a branched covering map is an arc. Therefore, we can interpret a branched covering map as inducing a map on weighted arc diagrams by lifting. We are interested in the inverse problem: when can a weighted arc diagram be realized by lifting the arcs of a diagram under a suitable branched cover? This dissertation solves the problem in the case of a maximal diagram covering a disk with two marked boundary points, called a bigon. This dissertation presents an algorithm which decides whether a given maximal, weighted arc diagram may be realized by lifting a weighted arc diagram on the bigon, and which produces a branched cover and weighted arc diagram on the bigon which realize this diagram by lifting. It also proves that this algorithm is sound and complete.
Subject
Topic
Combinatorics
Subject (fast) (authorityURI="http://id.worldcat.org/fast", valueURI="http://id.worldcat.org/fast/01152692")
Topic
Topology
Language
Language Term (ISO639-2B)
English
Record Information
Record Content Source (marcorg)
RPB
Record Creation Date (encoding="iso8601")
20190603
Identifier: DOI
10.26300/qa83-b595
Access Condition: rights statement (href="http://rightsstatements.org/vocab/InC/1.0/")
In Copyright
Access Condition: restriction on access
All rights reserved. Collection is open to the Brown community for research.
Type of Resource (primo)
dissertations