Search arXivSearch

arXiv · 2604.05597

Minimal Generating Sets of Singular Reidemeister Moves and Their Classification

Abstract

Singular knot theory extends classical knot theory by allowing transverse double points without over/under information, together with singular Reidemeister moves of types IV and V. A central open problem in this theory is to determine the minimal generating sets of oriented singular Reidemeister moves. In this paper, we completely solve this problem. In addition, we establish independence results for singular Reidemeister moves by introducing an invariant that provides obstructions and lower bounds for generating sets, including the independence of type III from types I, II, IV, and V. More precisely, starting from a minimal generating set of ordinary Reidemeister moves of types I--III, we prove that the singular moves admit exactly $96$ distinct inclusion-minimal generating sets, and that these exhaust all possibilities. Our proof introduces a new invariant for singular links, constructed via a projection to self-singular links, which detects the distinction between the two families of type IV moves and provides an obstruction for generating type V moves from types I--IV. We also determine the unoriented case, where the classification collapses to exactly $8$ minimal generating sets.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Noboru Ito, Yuichiro Iwamoto. 2026-06-11. Minimal Generating Sets of Singular Reidemeister Moves and Their Classification. https://arxiv.org/abs/2604.05597

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Word Length Formulae, Normal Forms, Conjugation and Root-finding Algorithms in Surface Groups

In this paper, we mainly study the following symmetric presentation of the surface group $$π_1(Σ_g)=\left\langle c_1,\dots, c_{2g}\mid c_1\cdots c_{2g}c_1^{-1}\cdots c_{2g}^{-1}\right\rangle.$$ For every nontrivial element $x\in π_1(Σ_g)$ and $k\geq 2$, we obtain a uniform representative of the normal forms $\mathfrak{nf}(x^k)$ of $x^k$ under the length-lexicographical order: $$\mathfrak{nf}(x^k) = \overline{LW^{k-2}R}.$$ Building on this result, we establish a new relation among these normal forms, and then derive the following three formulae related to the word length: $|x^2|>|x|$; $|x^k|=(k-1)(|x^2|-|x|)+|x|$; $\lim_{k\to\infty}\frac{|x^k|}{k}=|x^2|-|x|$. Furthermore, we extend these results to obtain a coarser analogue for every minimal geometric presentation. We then define normal forms of conjugacy classes in $π_1(Σ_g)$ and provide a criterion for determining the conjugacy of group elements. As a consequence, we provide efficient algorithms for solving the root-finding and conjugacy problems. Finally, we present applications to the computation of several growth rates.

math.GT

Plane separating continua inscribe rectangles

We prove the following: If $X$ is a plane separating continuum, then every embedding of $X$ into $\mathbb{R}^2$ contains the vertices of a Euclidean rectangle. We arrive to this result by extending a known result by H. Vaughan for Jordan curves to a wider class of topological objects via shape theory and Steenrod homology.

math.GT

Every Link Has Infinitely Many Explicit Generalised T-Link Presentations

Generalised $T$-links provide a simple description of all links in $S^3$ as closures of products of standard twisting blocks, parametrised by finite sequences of integers. We prove that every link admits infinitely many pairwise distinct generalised $T$-link presentations. Starting from any such presentation, we give explicit parameter transformations that preserve the represented link and generate families of pairwise distinct presentations depending on arbitrarily many independent integer parameters.

math.GT