162 citations · 249 across the 6 of their papers we have counts for
6 papers
A reduced set of moves on one-vertex ribbon graphs coming from links
Susan Abernathy, Cody Armond, Moshe Cohen +5
Every link in R^3 can be represented by a one-vertex ribbon graph. We prove a Markov type theorem on this subset of link diagrams.
Graphs on surfaces and Khovanov homology
Abhijit Champanerkar, Ilya Kofman, Neal Stoltzfus
Oriented ribbon graphs (dessins d'enfant) are graphs embedded in oriented surfaces. A quasi-tree of a ribbon graph is a spanning subgraph with one face, which is described by an or…
Quasi-tree expansion for the Bollobás-Riordan-Tutte polynomial
Abhijit Champanerkar, Ilya Kofman, Neal Stoltzfus
Oriented ribbon graphs (dessins d'enfant) are graphs embedded in oriented surfaces. The Bollobás-Riordan-Tutte polynomial is a three-variable polynomial that extends the Tutte poly…
Alternating sum formulae for the determinant and other link invariants
Oliver T. Dasbach, David Futer, Efstratia Kalfagianni +2
A classical result states that the determinant of an alternating link is equal to the number of spanning trees in a checkerboard graph of an alternating connected projection of the…
The Jones polynomial and graphs on surfaces
Oliver T. Dasbach, David Futer, Efstratia Kalfagianni +2
The Jones polynomial of an alternating link is a certain specialization of the Tutte polynomial of the (planar) checkerboard graph associated to an alternating projection of the li…
Explicit diagonalization of the Markov form on the Temperley-Lieb algebra
Josh Genauer, Neal W. Stoltzfus
We define a triangular change of basis in which the form is diagonal and explicitly compute the diagonal entries of this matrix as products of quotients of Chebyshev polynomials, c…