[Paper Review] Virtual links are algorithmically recognisable

Vassily Olegovich Manturov|ArXiv.org|Aug 19, 2004

Geometric and Algebraic Topology4 references3 citations

TL;DR

This paper proves that virtual links are algorithmically recognizable by reducing the equivalence problem to a topological decision procedure in 3-manifolds. Using Haken's theory of normal surfaces and algorithmic recognition of Haken manifolds with boundary patterns, the authors construct an effective algorithm to determine whether two virtual links are equivalent via their associated link exteriors and boundary patterns.

ABSTRACT

We prove that there is an algorithm to decide whehter two virtual links are equivalent or not

Motivation & Objective

• To establish a decision procedure for virtual link equivalence using topological invariants.
• To extend algorithmic recognition techniques from classical links to virtual links.
• To show that the topological structure of link exteriors in surface×I bundles enables algorithmic comparison.
• To prove that minimal representatives of virtual links are algorithmically constructible and unique up to isotopy.
• To demonstrate that virtual link equivalence reduces to homeomorphism recognition of 3-manifolds with boundary patterns.

Proposed method

• Represent each virtual link as a link in a thickened surface $M \times I$, where $M$ is a compact 2-manifold.
• Construct the link exterior $M_L$ by removing a tubular neighborhood of the link from $M \times I$, resulting in a 3-manifold with torus boundary components.
• Endow each torus boundary component with a meridian pattern $\Gamma_L$ encoding the link component's framing.
• Apply Haken's theory of normal surfaces and algorithmic recognition of Haken manifolds to determine whether two such manifolds with patterns are homeomorphic.
• Use the algorithmic decidability of irreducibility, boundary irreducibility, and essential surface detection in Haken manifolds.
• Reduce the virtual link equivalence problem to checking homeomorphism between $ (M_L, \Gamma_L) $ and $ (M'_{L'}, \Gamma'_{L'}) $, which is decidable via known algorithms.

Experimental results

Research questions

• RQ1 Can an algorithm determine whether two virtual links are equivalent?
• RQ2 Is the minimal representative of a virtual link unique up to isotopy and stabilization?
• RQ3 Can the topological invariants of link exteriors in surface×I bundles be used to algorithmically distinguish virtual links?
• RQ4 Does the presence of classical split components in a virtual link affect the algorithmic decidability of equivalence?
• RQ5 Can the homeomorphism type of the link exterior with meridian pattern determine the virtual link up to equivalence?

Key findings

• There exists a finite, effective algorithm to decide whether two virtual links are equivalent.
• The algorithm relies on constructing the exterior manifold $M_L$ of a virtual link and equipping it with a meridian pattern $\Gamma_L$.
• The manifold $ (M_L, \Gamma_L) $ is Haken if the virtual link is not a split union of a classical link and another link.
• Algorithmic recognition of Haken manifolds with boundary patterns allows for decision of homeomorphism between such manifolds.
• If two virtual links have homeomorphic exteriors with equivalent patterns, they are equivalent as virtual links.
• The result holds for both oriented and framed virtual links, generalizing classical link recognition algorithms to the virtual setting.