Invariants of Knot Diagrams
classification
🧮 math.GT
keywords
diagramsknotcertainconstructdetermineinvariantinvariantsminimal
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.