Tree Diagrams for String Links II: Determining Chord Diagrams
Blake Mellor
Abstract
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).
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