Minimal diagrams of classical and virtual links
classification
🧮 math.GT
keywords
virtualclassicaldiagramslinklinksminimalapproachconditions
read the original abstract
We prove that a virtual link diagrams satisfying two conditions on the Khovanov homology is minimal, that is, there is no virtual diagram representing the same link with smaller number of crossings. This approach works for both classical and virtual links
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.