Three-Page Embeddings of Singular Knots

Vitaliy Kurlin, V. V. Vershinin

This paper, "Three-page embeddings of singular knots" by V. Kurlin and V. Vershinin, provides a rigorous algebraic framework for classifying singular knots—mathematical objects that look like tangled loops but are allowed to intersect themselves at a finite number of points.

TL;DR

The authors develop an algebraic solution to the "isotopy problem" for singular knots by projecting them into a "three-page book" structure. They prove that every singular knot can be uniquely represented by a central element in a specific semigroup (SK) consisting of just 15 generators and 84 relations, effectively turning a complex topological problem into a question of word equality in algebra.

What Problem Does This Paper Address?

In topology, a fundamental question is: "Are these two knots actually the same?" For regular knots (smooth loops in 3D space), we determine this through isotopy—deforming one loop into the other without cutting it. Singular knots add a layer of complexity: they are allowed to have a finite number of "singular points" where the string passes through itself (double intersections).

While we have "Reidemeister moves" (a set of local diagram changes) to describe these deformations visually, using them to prove two complex knots are identical is computationally difficult. The authors seek an algebraic classification: a way to translate these geometric tangles into a string of letters (a word) such that two knots are isotopic if and only if their corresponding words are equal under a set of algebraic rules.

Methods

The paper builds on the "Dynnikov method," which simplifies 3D knots by embedding them into an "open book" with three pages (three half-planes meeting at a single axis).

  1. 3-Page Embedding: The authors prove that any singular knot can be shifted so that all its singular points lie on the "spine" (the axis) of the book. The rest of the knot is arranged such that it only moves "monotonically" across the three pages.
  2. Encoding into Words: As the knot crosses the spine, it creates a sequence of intersection points. Each type of intersection is assigned a letter from a 15-letter alphabet ($\mathbb{A} = \{a_i, b_i, c_i, d_i, x_i\}$ where $i \in \{0, 1, 2\}$).
  3. The Semigroup SK: The authors define a semigroup, $SK$, governed by 10 types of relations (84 total equations). These relations are designed to mimic "elementary ambient isotopies"—the mathematical equivalent of wiggling the string or sliding a crossing point without changing the knot's fundamental structure.
  4. Tangle Theory: To prove their main theorems, the authors use "singular tangles" (knots with loose ends) as an intermediate step, showing that the algebra holds up even when the loops aren't closed.

Datasets

Not discussed in the paper. As a work of pure mathematics, the "data" consists of theoretical proofs and logical derivations rather than empirical datasets or benchmarks.

Key Insights and Ideas

  • The Spine as an Anchor: By forcing all singular points onto the axis of the three-page book, the authors reduce a 3D problem into a 1D sequence of events along that axis.
  • Centrality Equals "Knotness": One of the most elegant findings (Theorem 3) is that a word in the semigroup represents a closed, singular knot if and only if that word is central—meaning it commutes with every other element in the semigroup ($w \cdot s = s \cdot w$). This provides a clean algebraic test for whether a sequence of letters represents a complete loop or just a fragment.
  • Rigidity vs. Flexibility: The paper distinguishes between "singular knots" (where the intersection points have a fixed "template" or orientation) and "knuckle graphs" (where the intersections can be twisted). They provide a slight variation of their algebraic rules (changing relation 6 to 6') to classify these more flexible knuckle graphs.

Key Results

  • Theorem 1 & 2: Every singular knot has a representative in the semigroup $SK$, and two knots are isotopic if and only if their algebraic representations are equal.
  • Semigroup Construction: The authors successfully condensed the complex geometry of singular knots into a system with only 15 generators.
  • Extension of Dynnikov’s Work: This paper successfully extends Ivan Dynnikov's 1999 classification of regular knots to the more complex domain of singular knots and 4-valent graphs.

Limitations and Future Work

  • Non-Oriented Focus: The current work focuses on non-oriented knots (where the "direction" of the string doesn't matter). Classifying oriented singular knots would likely require a larger alphabet and a more complex set of relations.
  • Computational Implementation: While the paper provides an "algebraic solution," it does not discuss the algorithmic complexity of checking word equality within the 84 relations of $SK$. Implementing this as a computer program to automatically identify knots would be a natural next step.
  • Higher Valency: The singular points here are "double intersections" (4-valent vertices). Future work could explore 3-page embeddings for higher-order intersections (e.g., triple points or 6-valent vertices).

Summary updated

Abstract

Construction of a semigroup with 15 generators and 84 relations is given. The center of this semigroup is in one-to-one correspondence with the set of all isotopy classes of non-oriented singular knots (links with finitely many double intersections in general position) in three-dimensional space.
BibTeX
@inproceedings{kurlin2004three,
  author = {Vitaliy Kurlin and V. V. Vershinin},
  title = {{Three-Page Embeddings of Singular Knots}},
  booktitle = {Functional},
  year = {2004},
  doi = {10.1023/b:faia.0000024864.64045.de},
}

Loading related content...

Figure