Turaev Surfaces And Toroidally Alternating Knots, 2017 The Graduate Center, City University of New York

#### Turaev Surfaces And Toroidally Alternating Knots, Seungwon Kim

*All Graduate Works by Year: Dissertations, Theses, and Capstone Projects*

In this thesis, we study knots and links via their alternating diagrams on closed orientable surfaces. Every knot or link has such a diagram by a construction of Turaev, which is called the Turaev surface of the link. Links that have an alternating diagram on a torus were defined by Adams as toroidally alternating. For a toroidally alternating link, the minimal genus of its Turaev surface may be greater than one. Hence, these surfaces provide different topological measures of how far a link is from being alternating.

First, we classify link diagrams with Turaev genus one and two in terms ...

Intercusp Geodesics And Cusp Shapes Of Fully Augmented Links, 2017 The Graduate Center, City University of New York

#### Intercusp Geodesics And Cusp Shapes Of Fully Augmented Links, Rochy Flint

*All Graduate Works by Year: Dissertations, Theses, and Capstone Projects*

We study the geometry of fully augmented link complements in the 3-sphere by looking at their link diagrams. We extend the method introduced by Thistlethwaite and Tsvietkova to fully augmented links and define a system of algebraic equations in terms of parameters coming from edges and crossings of the link diagrams. Combining it with the work of Purcell, we show that the solutions to these algebraic equations are related to the cusp shapes of fully augmented link complements. As an application we use the cusp shapes to study the commensurability classes of fully augmented links.

On Vector-Valued Automorphic Forms On Bounded Symmetric Domains, 2017 The University of Western Ontario

#### On Vector-Valued Automorphic Forms On Bounded Symmetric Domains, Nadia Alluhaibi

*Electronic Thesis and Dissertation Repository*

The objective of the study is to investigate the behaviour of the inner products of vector-valued Poincare series, for large weight, associated to submanifolds of a quotient of the complex unit ball and how vector-valued automorphic forms could be constructed via Poincare series. In addition, it provides a proof of that vector-valued Poincare series on an irreducible bounded symmetric domain span the space of vector-valued automorphic forms.

A Nonexpert Introduction To Rational Homotopy Theory, 2017 University of Colorado, Boulder

#### A Nonexpert Introduction To Rational Homotopy Theory, Nicholas Boschert

*Mathematics Undergraduate Contributions*

This article attempts to render the rational homotopy theory of Sullivan and Quillen more comprehensible to non-experts in algebraic topology by expounding on many of the results and proofs in a more detailed and elementary way.

Conditions For Obtaining Nontrivial Knots From Collections Of Vectors, 2017 Merrimack College

#### Conditions For Obtaining Nontrivial Knots From Collections Of Vectors, Joseph Borgatti

*Honors Senior Capstone Projects*

We explore under what conditions one can obtain a nontrivial knot, given a collection of n vectors. First, we show how to get a crossing from any 3 vectors equal in magnitude, by arbitrarily picking 2 vectors and identifying the sufficient and necessary criteria for picking a third vector that will guarantee a crossing when the vectors are reordered. We also show that it’s always possible for a set of vectors to be reordered to form the unknot, if they sum to ~0 when added together. Our main results are restricted to sets of n vectors that, when reordered ...

Intrinsic Linking And Knotting Of Graphs In Arbitrary 3–Manifolds, 2017 Loyola Marymount University

#### Intrinsic Linking And Knotting Of Graphs In Arbitrary 3–Manifolds, Erica Flapan, Hugh Howards, Don Lawrence, Blake Mellor

*Blake Mellor*

We prove that a graph is intrinsically linked in an arbitrary 3–manifold MM if and only if it is intrinsically linked in S3. Also, assuming the Poincaré Conjecture, we prove that a graph is intrinsically knotted in M if and only if it is intrinsically knotted in S3.

Tree Diagrams For String Links, 2017 Loyola Marymount University

#### Tree Diagrams For String Links, Blake Mellor

*Blake Mellor*

In previous work, the author defined the intersection graph of a chord diagram associated with string links (as in the theory of finite type invariants). In this paper, we classify the trees which can be obtained as intersection graphs of string link diagrams.

On The Existence Of Finite Type Link Homotopy Invariants, 2017 Loyola Marymount University

#### On The Existence Of Finite Type Link Homotopy Invariants, Blake Mellor, Dylan Thurston

*Blake Mellor*

We show that for links with at most 5 components, the only finite type homotopy invariants are products of the linking numbers. In contrast, we show that for links with at least 9 components, there must exist finite type homotopy invariants which are not products of the linking numbers. This corrects previous errors of the first author.

Tree Diagrams For String Links Ii: Determining Chord Diagrams, 2017 Loyola Marymount University

#### Tree Diagrams For String Links Ii: Determining Chord Diagrams, Blake Mellor

*Blake Mellor*

In previous work, we defined the intersection graph of a chord diagram associated with a string link (as in the theory of finite type invariants). In this paper, we look at the case when this graph is a tree, and we show that in many cases these trees determine the chord diagram (modulo the usual 1-term and 4-term relations).

Spatial Graphs With Local Knots, 2017 Loyola Marymount University

#### Spatial Graphs With Local Knots, Erica Flapan, Blake Mellor, Ramin Naimi

*Blake Mellor*

It is shown that for any locally knotted edge of a 3-connected graph in S3, there is a ball that contains all of the local knots of that edge and is unique up to an isotopy setwise fixing the graph. This result is applied to the study of topological symmetry groups of graphs embedded in S3.

The Intersection Graph Conjecture For Loop Diagrams, 2017 Loyola Marymount University

#### The Intersection Graph Conjecture For Loop Diagrams, Blake Mellor

*Blake Mellor*

Vassiliev invariants can be studied by studying the spaces of chord diagrams associated with singular knots. To these chord diagrams are associated the intersection graphs of the chords. We extend results of Chmutov, Duzhin and Lando to show that these graphs determine the chord diagram if the graph has at most one loop. We also compute the size of the subalgebra generated by these "loop diagrams."

Symmetries Of Embedded Complete Bipartite Graphs, 2017 Loyola Marymount University

#### Symmetries Of Embedded Complete Bipartite Graphs, Erica Flapan, Nicole Lehle, Blake Mellor, Matt Pittluck, Xan Vongsathorn

*Blake Mellor*

We characterize which automorphisms of an arbitrary complete bipartite graph Kn,m can be induced by a homeomorphism of some embedding of the graph in S3.

A Few Weight Systems Arising From Intersection Graphs, 2017 Loyola Marymount University

#### A Few Weight Systems Arising From Intersection Graphs, Blake Mellor

*Blake Mellor*

No abstract provided.

Complete Graphs Whose Topological Symmetry Groups Are Polyhedral, 2017 Loyola Marymount University

#### Complete Graphs Whose Topological Symmetry Groups Are Polyhedral, Eric Flapan, Blake Mellor, Ramin Naimi

*Blake Mellor*

We determine for which m the complete graph Km has an embedding in S3 whose topological symmetry group is isomorphic to one of the polyhedral groups A4, A5 or S4.

A Geometric Interpretation Of Milnor's Triple Invariants, 2017 Loyola Marymount University

#### A Geometric Interpretation Of Milnor's Triple Invariants, Blake Mellor, Paul Melvin

*Blake Mellor*

Milnor's triple linking numbers of a link in the 3-sphere are interpreted geometrically in terms of the pattern of intersections of the Seifert surfaces of the components of the link. This generalizes the well known formula as an algebraic count of triple points when the pairwise linking numbers vanish.

Finite Type Link Concordance Invariants, 2017 Loyola Marymount University

#### Finite Type Link Concordance Invariants, Blake Mellor

*Blake Mellor*

This paper is a generalization of the author's previous work on link homotopy to link concordance. We show that the only real-valued finite type link concordance invariants are the linking numbers of the components.

Finite Type Link Homotopy Invariants, 2017 Loyola Marymount University

#### Finite Type Link Homotopy Invariants, Blake Mellor

*Blake Mellor*

Bar-Natan used Chinese characters to show that finite type invariants classify string links up to homotopy. In this paper, I construct the correct spaces of chord diagrams and Chinese characters for links up to homotopy. I use these spaces to show that the only rational finite type invariants of link homotopy are the pairwise linking numbers of the components.

Colorings, Determinants And Alexander Polynomials For Spatial Graphs, 2017 Loyola Marymount University

#### Colorings, Determinants And Alexander Polynomials For Spatial Graphs, Terry Kong, Alec Lewald, Blake Mellor, Vadim Pigrish

*Blake Mellor*

A {\em balanced} spatial graph has an integer weight on each edge, so that the directed sum of the weights at each vertex is zero. We describe the Alexander module and polynomial for balanced spatial graphs (originally due to Kinoshita \cite{ki}), and examine their behavior under some common operations on the graph. We use the Alexander module to define the determinant and p-colorings of a balanced spatial graph, and provide examples. We show that the determinant of a spatial graph determines for which p the graph is p-colorable, and that a p-coloring of a graph corresponds to a representation ...

Chord Diagrams And Gauss Codes For Graphs, 2017 Loyola Marymount University

#### Chord Diagrams And Gauss Codes For Graphs, Thomas Fleming, Blake Mellor

*Blake Mellor*

Chord diagrams on circles and their intersection graphs (also known as circle graphs) have been intensively studied, and have many applications to the study of knots and knot invariants, among others. However, chord diagrams on more general graphs have not been studied, and are potentially equally valuable in the study of spatial graphs. We will define chord diagrams for planar embeddings of planar graphs and their intersection graphs, and prove some basic results. Then, as an application, we will introduce Gauss codes for immersions of graphs in the plane and give algorithms to determine whether a particular crossing sequence is ...

Alexander And Writhe Polynomials For Virtual Knots, 2017 Loyola Marymount University

#### Alexander And Writhe Polynomials For Virtual Knots, Blake Mellor

*Blake Mellor*

We give a new interpretation of the Alexander polynomial Δ0 for virtual knots due to Sawollek and Silver and Williams, and use it to show that, for any virtual knot, Δ0 determines the writhe polynomial of Cheng and Gao (equivalently, Kauffman's affine index polynomial). We also use it to define a second-order writhe polynomial, and give some applications.