balanced overlaid Tait graphcoloring moduleDehn coloringdimer modelFox coloringKasteleyn theoryknot determinantSmith normal form
Abstract: Fox coloring provides a combinatorial framework for studying dihedral representations of the knot group. The less well-known concept of Dehn coloring captures the same data. Recent work of Carter-Silver-Williams clarifies the relationship between the two focusing on how one transitions between Fox and Dehn colorings. In our work, we relate Dehn coloring to the dimer model for knots showing that Dehn coloring data is encoded by a certain weighted balanced overlaid Tait graph. Using Kasteleyn theory, we provide graph theoretic methods for computing the determinant and Smith normal form of a knot. These constructions are closely related to Kauffman's work on a state sum for the Alexander polynomial.
Recommendations
Cites work
- A determinant formula for the Jones polynomial of pretzel knots
- A proof of the Kauffman-Harary conjecture
- A twisted dimer model for knots
- An exploration of the permanent-determinant method
- Dimer problem in statistical mechanics-an exact result
- Equivalence classes of colorings
- Heegaard Floer homology and alternating knots
- scientific article; zbMATH DE number 3854015 (Why is no real title available?)
- scientific article; zbMATH DE number 1187103 (Why is no real title available?)
- scientific article; zbMATH DE number 3530652 (Why is no real title available?)
- scientific article; zbMATH DE number 1037084 (Why is no real title available?)
- scientific article; zbMATH DE number 3326387 (Why is no real title available?)
- Kasteleyn cokernels
- Kauffman's clock lattice as a graph of perfect matchings: a formula for its height
- Knots and graphs. I: Arc graphs and colorings
- Lectures on Dimers
- Nonalternating links
- On knot Floer width and Turaev genus
- Plane elementary bipartite graphs
- Symmetries of plane partitions and the permanent-determinant method
- The Jones polynomial and graphs on surfaces
- The Smith normal form
- Three Dimensions of Knot Coloring
Cited in
(7)- Equivalence of edge bicolored graphs on surfaces
- Dehn colorings and vertex-weight invariants for spatial graphs
- Finding knot invariants from diagram colouring
- A note on Dehn colorings and invariant factors
- Palettes of Dehn colorings for spatial graphs and the classification of vertex conditions
- The minimization of the number of colors is different at p = 11
- Goeritz matrices of spatial graphs related to Dehn colorings with alternating vertex conditions
This page was built for publication: Dehn coloring and the dimer model for knots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977922)