A discrete Morse perspective on knot projections and a generalised clock theorem

DOI10.37236/9979MaRDI QIDQ2039999zbMATH OpenOpenAlexFDO

Authors Daniele Celoria, Naya Yerolemou

Publication date 6 July 2021

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2010.05833

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

discrete Morse theoryclock theoremKauffman statesKenyon-Propp-Wilson correspondenceKPW correspondence

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Relations of low-dimensional topology with graph theory (57M15) Knot theory (57K10) Discrete Morse theory and related ideas in manifold topology (57Q70)

Abstract: We obtain a simple and complete characterisation of which matchings on the Tait graph of a knot diagram induce a discrete Morse function (dMf) on $S^2$, extending a construction due to Cohen. We show these dMfs are in bijection with certain rooted spanning forests in the Tait graph. We use this to count the number of such dMfs with a closed formula involving the graph Laplacian. We then simultaneously generalise Kauffman's Clock Theorem and Kenyon-Propp-Wilson's correspondence in two different directions; we first prove that the image of the correspondence induces a bijection on perfect dMfs, then we show that all perfect matchings, subject to an admissibility condition, are related by a finite sequence of click and clock moves. Finally, we study and compare the matching and discrete Morse complexes associated to the Tait graph, in terms of partial Kauffman states, and provide some computations.

Recommendations

• Kauffman's clock lattice as a graph of perfect matchings: a formula for its height
• Discrete Morse theory for complexes of 2-connected graphs
• Discrete Morse theory on digraphs
• Discrete Morse theory on graphs
• Complexes of discrete Morse functions

Cites work

• scientific article; zbMATH DE number 3530652 (Why is no real title available?)
• A note on the pure Morse complex of a graph
• A twisted dimer model for knots
• Algebraic Graph Theory
• Complexes of discrete Morse functions
• Interpolation theorem for diameters of spanning trees
• Kauffman states, bordered algebras, and a bigraded knot invariant
• Kauffman's clock lattice as a graph of perfect matchings: a formula for its height
• Knots
• Morse theory for cell complexes
• On discrete Morse functions and combinatorial decompositions
• On the Seifert graphs of a link diagram and its parallels
• Peculiar modules for 4‐ended tangles
• Spanning forests and the golden ratio
• Trees and matchings

Cited in

(1)

• Kauffman's clock lattice as a graph of perfect matchings: a formula for its height

Describes a project that uses

Uses Software

• MathOverflow
• SnapPy
• SageMath

This page was built for publication: A discrete Morse perspective on knot projections and a generalised clock theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2039999)