Kauffman's clock lattice as a graph of perfect matchings: a formula for its height
arXiv:1211.2558
Abstract
We give an algorithmic computation for the height of Kauffman's clock lattice obtained from a knot diagram with two adjacent regions starred and without crossing information specified. We show that this lattice is more familiarly the graph of perfect matchings of a bipartite graph obtained from the knot diagram by overlaying the two dual Tait graphs of the knot diagram. This setting also makes evident applications to Chebyshev or harmonic knots, whose related bipartite graph is the popular grid graph, and to discrete Morse functions. Furthermore we prove structural properties of the bipartite graph in general.
29 pages, 21 figures
References in corpus (9)
- The Jones polynomial and graphs on surfaces
- A spanning tree model for the Heegaard Floer homology of a branched double-cover
- A combinatorial spanning tree model for knot Floer homology
- Totally Twisted Khovanov Homology
- Curves defined by Chebyshev polynomials
- Discrete Morse Theory Is At Least As Perfect As Morse Theory
- A reduced set of moves on one-vertex ribbon graphs coming from links
- The clock number of a knot
- The absolute order of a permutation representation of a Coxeter group