An even-strand Markov calculus for classical and virtual links
Read the paper (PDF) · Download PDF · Supporting ZIP · Zenodo record
Plain-English explanation · Read on this page · Collaboration
Abstract
We give an explicit affirmative answer to the ordinary-closure interpretation of Problem 42 in the 2014 survey of Fenn, Ilyutko, Kauffman and Manturov. Four reversible algebraic schemes classify oriented classical link closures using only even-strand braid states. Four additional exchange schemes give the corresponding statement for oriented virtual links. The proof is an elementary conversion of the established unrestricted Markov theorems: positively stabilize each odd-strand vertex and lift every generating edge. Arbitrary finite word blocks are allowed; minimality and uniform geometric locality are not asserted. Historical priority remains unresolved: we could not access the identified fuller texts of Nencka to complete the priority review. No first-priority or present-openness claim is made.
The idea in plain English
Closing a braid joins its upper ends to its lower ends to form a link. Markov moves describe when different braids close to the same link, but a usual stabilization changes the strand count by one. The construction pads each odd-strand state with one positive crossing, then translates every original move into a move between even-strand states.
The precise result
Every nonempty oriented classical link has an even-strand braid representative. Two even-tagged classical braids have isotopic ordinary oriented, unframed closures exactly when they are connected by defining braid relations and four reversible scheme families.
For oriented virtual links, four additional exchange scheme families give the corresponding classification, together with the defining virtual braid relations. The state retains both the even strand count N and the braid word; empty words on different strand counts can close to different unlinks.
The word blocks may have arbitrary finite length. Their literal index-support restrictions are part of the theorem. For a supplied unrestricted Markov chain whose maximum strand count is M, the converted even chain uses at most 2⌈M/2⌉ strands.
Why the result holds
Leave an even-strand state unchanged. Replace an odd-strand word on m strands by its positive right stabilization on m + 1 strands. This preserves its ordinary closure and fixes the original even endpoints.
Conjugation, either sign of stabilization, defining relations and the virtual exchanges can each be lifted through this padding operation. The two parity cases give the displayed scheme families. Every new scheme also unpacks into the permitted original moves, proving both directions of the classification.
Scope and limitations
- The closure is ordinary, oriented and unframed. Plat closure, framed links and transverse isotopy are different settings.
- The scheme families allow arbitrary finite blocks and require the stated syntactic support bounds. Minimality and uniform geometric locality are not claimed.
- The strand-height estimate converts a supplied certificate; it is not an algorithm or complexity bound for finding one.
- The argument imports the established classical and virtual Markov theorems. Historical priority and present openness are not established.
Background and prior work
The formulation addresses the ordinary-closure interpretation of Problem 42 in the 2014 survey by Fenn, Ilyutko, Kauffman and Manturov. The classical inputs are Alexander’s braid representation and Markov equivalence, as stated in Gorsky, Kivinen and Simental’s lecture notes. The virtual inputs are Kamada’s representation and Markov theorems, with exchange conventions also recorded by Kauffman and Lambropoulou.
Nencka’s earlier power-of-two braid announcement is materially related. The fuller identified texts were not accessible for a complete priority comparison; the native paper leaves historical priority unresolved. Fiedler’s result on conjugation and double Markov moves supplies further context, with the source-access qualification stated in the paper.
Status and AI use
This is an unrefereed, AI-assisted research note. The author is responsible for its contents. The linked native paper and supporting material are the source of record.
The manuscript and new first-party documentation are available under Creative Commons Attribution 4.0 International. The enclosed Python code uses its separate MIT license. Third-party material retains its original rights and attribution requirements.
Read the paper
Supporting materials
These are unchanged copies of the native files, in the order shown by the native record.
The native record declares no manuscript version, and the PDF prints no manuscript version or date. The v3 label belongs to the verification ZIP only.
- even_strand_markov.pdf — paper PDF. Original file on Zenodo.
- even-strand-markov-verification-v3.zip — supporting material. Original file on Zenodo.
Collaborate on this result
Researchers interested in independently assessing the even-strand formulation or discussing a substantive collaboration are welcome to contact Alec. Authorship and responsibilities would be discussed in relation to actual contributions.
Cite this paper
Alec Kriebel. An even-strand Markov calculus for classical and virtual links. Original deposit, 4 October 2026. Zenodo. 10.5281/zenodo.23131001. Download BibTeX.