The Structure and Enumeration of Link Projections
Martin Bridgeman
Abstract
We define a decomposition of link projections whose pieces we call atoroidal graphs. We describe a surgery operation on these graphs and show that all atoroidal graphs can be generated by performing surgery repeatedly on a family of well known link projections. This gives a method of enumerating atoroidal graphs and hence link projections by recomposing the pieces of the decomposition.
Create a lesson
Related papers
Linearity of Graph Manifold Groups
Daniel T. Wise
Finding the Birman-Series set
Peter Buser, Hugo Parlier
Thurston's Legacy at the Interface of Surface Dynamics, Train Tracks, and Arithmetic
Ahmad Rafiqi, Ayberk Zeytin
Recognizing oriented knots from finite quotients with one marked element
Indranil Biswas, Shrinit Singh
Symmetries of colored Khovanov-Rozansky homology
Alexis Guérin, Felix Roz
The Colored Jones Function does not determine any colored Links--Gould polynomial
Matthew Harper, Ben-Michael Kohli