On Free Knots
classification
🧮 math.GT
math.CO
keywords
knotsmovesreidemeistersomeapplicationsclasseseasilyequivalence
read the original abstract
We prove that for some knot-like objects one can easily recognize non-equivalence w.r.t. all Reidemeister moves by studying some equivalence classes modulo only 2nd Reidemeister moves. There are applications to virtual knots, graph-links and looped graphs.
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.