Minimal Generating Sets of Reidemeister Moves

• Minimal generating sets of Reidemeister-type moves are the smallest collections of local diagrammatic moves that can reproduce any full set of moves via finite sequences and planar isotopy.
• In various settings—classical, directed, virtual, and singular—specific minimal sets (e.g., a 4-move set for classical oriented diagrams or an 8-move set for directed cases) ensure complete transformation and computational efficiency.
• The classification of these minimal sets not only aids in theoretical analysis and invariant derivation but also highlights open problems in diagrammatic move classification and computational verification in knot theory.

A minimal generating set of Reidemeister-type moves is a smallest possible collection of local diagrammatic moves such that any move in the full set of allowed local transformations (under a given class—classical, virtual, singular, or other diagrammatic settings) can be obtained as a finite sequence of moves from the set, together with planar isotopy. These generating sets streamline both theoretical analysis and computational verification of knot and link invariants by reducing the number of cases that must be considered, and have specific minimal forms depending on orientation, diagram class, and symmetries.

1. Classical Oriented Reidemeister Move Generating Sets

Classical knot diagrams admit 16 oriented versions of the classical Reidemeister moves: four type I, four type II, and eight type III moves. Polyak established that for oriented diagrams, a set of four moves forms a minimal generating set: two type I moves, one type II, and one type III. There exist precisely twelve such 4-element minimal generating sets, each of the form $\{R1x,R1y,R2z,R3w\}$, with generative criteria specified by pairings of type I moves (“compatible pairs”), a single type II, and one of the two non-braid-type type III moves (R3a or R3h) (Caprau et al., 2022, Ito et al., 25 Nov 2025).

Minimal Set Example	Type I	Type II	Type III
$\{R1a, R1c, R2a, R3a\}$	$R1a, R1c$	$R2a$	$R3a$
$\{R1a, R1c, R2b, R3a\}$	$R1a, R1c$	$R2b$	$R3a$
$\{R1a, R1c, R2a, R3h\}$	$R1a, R1c$	$R2a$	$R3h$

Each such set is proven minimal: removal of any move leaves some Reidemeister move irreproducible. The full list of minimal sets is classified in (Ito et al., 25 Nov 2025). In addition, generating sets that include specific “coherent” pairs for type II or III moves yield families of (slightly larger) minimal generating sets, but no minimal set has fewer than 4 moves.

2. Minimal Generating Sets for Directed and Virtual Moves

When directionality (forward/backward) is incorporated, the number of distinct move types increases due to orientation and direction splits. For instance, there are 32 directed oriented classical moves. Suwara proved that the minimal generating set for the directed case consists of eight moves: four type I (each in both directions), two type II (both directions), and two type III (both directions), specifically

$$\{\Omega_{1a}^{\uparrow},\,\Omega_{1a}^{\downarrow},\,\Omega_{1b}^{\uparrow},\,\Omega_{1b}^{\downarrow},\,\Omega_{2a}^{\uparrow},\,\Omega_{2a}^{\downarrow},\,\Omega_{3a}^{\uparrow},\,\Omega_{3a}^{\downarrow}\}$$

This set is minimal: omitting any move blocks the ability to connect all diagrams of a link or knot by directed moves (Suwara, 2016).

In the context of oriented virtual knots, the move space expands to include virtual analogs ($V1$–$V4$ families) with 17 essential oriented virtual moves. Ali–Yang–Hussain–Sheikh determined a minimal generating set composed of four classical Polyak moves ($\{C1a, C1b, C2a, C3a\}$) and four virtual moves ($\{V1a, V2a, V3a, V4g\}$), with minimality substantiated by explicit combinatorial and parity-change arguments. Any oriented virtual move can be written as a composition of these eight moves (Ali, 30 May 2025).

3. Minimal Generating Sets in Singular, Rotational, and Graph Contexts

For singular links (allowing transverse double points), Bataineh–Elhamdadi–Hajij–Youmans identified that all oriented singular Reidemeister moves can be generated by three singular moves ($\Omega_{4a}, \Omega_{4e}, \Omega_{5a}$), together with classical moves. However, minimality was left as an open problem there (Bataineh et al., 2017). Yamaguchi–Ito then established that exactly 96 minimal generating sets exist, each of the form $(x, y, z)$ with $$x\in\{\Omega_{4a},\Omega_{4b},\Omega_{4c},\Omega_{4d}\}$$, $$y\in\{\Omega_{4e},\Omega_{4f},\Omega_{4g},\Omega_{4h}\}$$, and $z\in\{\Omega_{5a},\dots,\Omega_{5f}\}$, and that each such triple, plus the classical moves, generates all oriented singular Reidemeister moves. No smaller set suffices (Yamaguchi et al., 2022).

In the rotational tangle or link context, eight moves suffice for unframed oriented tangles: four swirl moves, two type I, one type II, and one “cyclic” type III move. For framed oriented links, five moves generate all necessary transformation types (Becerra et al., 18 Jun 2025).

For spatial trivalent graphs, the minimal generating set consists of ten moves: four classical, four type-IV vertex–strand slides chosen from appropriate orientation/sign pairs, and two type-V vertex–vertex switch moves, carefully chosen to permit generation of all possible oriented local moves at trivalent vertices (Caprau et al., 2022).

4. Classification, Minimality, and Obstructions

The minimality and classification proofs center on identifying diagrammatic and algebraic invariants that are altered only by the candidate moves, ensuring necessity. For instance, winding number and writhe invariants demonstrate that at least two type I moves are essential, and specific two-component-link invariants enforce that both a type II and type III move are required (Ito et al., 25 Nov 2025, Suwara, 2016). Minimality in the virtual setting is established by exhibiting that omitting any family (V1–V4) from the generator set prevents construction of all virtual orientation patterns (Ali, 30 May 2025).

In singular and trivalent graph settings, family-spanning conditions arise due to the need for slide and switch maneuvers in all orientation and crossing configurations. The classification for spatial trivalent graphs leads to $12 \times 2^4 \times 2^2 = 768$ distinct minimal 10-move generating sets (Caprau et al., 2022). For singular knots, there are exactly 96 systems per the cited enumeration (Yamaguchi et al., 2022).

For certain classical cases, some 4-move candidates remain unclassified for minimality due to the failure of current diagram invariants, indicating open questions regarding the sufficiency of specific minimal sets (Ito et al., 25 Nov 2025).

5. Implications, Applications, and Open Problems

Adopting a minimal generating set for Reidemeister-type moves drastically reduces the burden in verifying knot or link invariants—down from consideration of 16 or more local moves to as few as four or five, depending on the context. For instance, for oriented virtual knots, any invariant only requires checking invariance under the eight key moves in the minimal set (Ali, 30 May 2025). In computational models and invariant derivations (coloring, state-sum), this yields direct efficiency gains.

The structure of minimal generating sets further carries implications for algebraic invariants: the set of local moves determines the axioms of associated quandles, biquandles, or singquandles, and thus the algebraic structures underlying knot invariants. For quantum invariants, the identification of minimal sets aligns with minimal relations imposed on corresponding tangle invariants, such as those for ribbon Hopf algebras (Becerra et al., 18 Jun 2025).

Several open problems persist, particularly the classification of minimal generating sets when certain move types are omitted or restricted, or in settings including more general diagrammatic features (e.g., arbitrary graph vertices, higher-genus surfaces, higher-order crossings). For classical projections, it is proven that any minimal set must include type II; omission provably leads to counterexamples where not all diagrams can be related (Ito et al., 2020). Four possible minimal 4-move sets in the classical oriented case remain unresolved as to their actual generating property (Ito et al., 25 Nov 2025).

6. Summary Table: Minimal Generating Sets in Selected Settings

Context	Minimal Set Size	Example Generating Set	Reference
Classical, oriented	4	$\{R1a, R1c, R2a, R3a\}$ or one of 12 possible sets	(Caprau et al., 2022, Ito et al., 25 Nov 2025)
Directed, classical	8	$$\{\Omega_{1a}^{\uparrow},\Omega_{1a}^{\downarrow},...,\Omega_{3a}^{\downarrow}\}$$	(Suwara, 2016)
Virtual, oriented	8	$\{C1a, C1b, C2a, C3a, V1a, V2a, V3a, V4g\}$	(Ali, 30 May 2025)
Singular, oriented	3 (singular moves) + classical	$(\Omega_{4a}, \Omega_{4e}, \Omega_{5a})$, 96 such triples	(Yamaguchi et al., 2022)
Trivalent graphs	10	4 classical + 4 type IV + 2 type V moves	(Caprau et al., 2022)
Rotational, unframed	8	4 swirl (Ω0), 2 type I, 1 type II, 1 cyclic type III	(Becerra et al., 18 Jun 2025)
Rotational, framed	5	Ω1f, Ω2a, Ω2d, Ω3a, Ω3h, for links	(Becerra et al., 18 Jun 2025)

The complete determination of minimal generating sets for each variation of knot, link, or diagram theory remains a central organizing principle for the study of local-to-global relations, computational algorithms, and invariant theory in knot theory and its generalizations.