Invariants of Knot Diagrams
Joel Hass, Tahl Nowik
TL;DR
This paper introduces a new order 1 invariant for knot diagrams, which helps determine the minimal number of Reidemeister moves needed to transform between specific pairs of diagrams.
Contribution
The paper presents a novel order 1 invariant for knot diagrams that aids in calculating minimal Reidemeister move sequences.
Findings
New order 1 invariant for knot diagrams
Application to minimal Reidemeister move calculations
Enhanced understanding of knot diagram transformations
Abstract
We construct a new order 1 invariant for knot diagrams. We use it to determine the minimal number of Reidemeister moves needed to pass between certain pairs of knot diagrams.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Computational Geometry and Mesh Generation · semigroups and automata theory