Virtual links are algorithmically recognisable
Vassily Olegovich Manturov
TL;DR
This paper proves that there exists an algorithm capable of determining whether two virtual links are equivalent, addressing a fundamental problem in knot theory and virtual link classification.
Contribution
The paper introduces a decidability result for virtual link equivalence, providing a concrete algorithmic solution to a previously unresolved problem.
Findings
Decidability of virtual link equivalence established
Algorithm for recognizing virtual links developed
Advances understanding of virtual knot theory
Abstract
We prove that there is an algorithm to decide whehter two virtual links are equivalent or not
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 · semigroups and automata theory · Topological and Geometric Data Analysis