Hurwitz equivalence in the universal dihedral quandle

We investigate the Hurwitz action of the $m$-braid group on the $m$-fold Cartesian product of the universal dihedral quandle. We introduce three computable invariants and prove that they give a complete classification of the orbits under this action. As a consequence, we describe an explicit complete system of orbit representatives. We further obtain analogous classifications for the corresponding Hurwitz actions of the pure $m$-braid group, the virtual $m$-braid group, and the virtual pure $m$-braid group.

💡 Research Summary

The paper studies the Hurwitz action of the braid group on the Cartesian product of the universal dihedral quandle (R_{\infty} = (\mathbb Z, *)), where the quandle operation is defined by (a * b = 2b - a). This quandle can be regarded as the universal covering of all finite dihedral quandles (R_n). The authors introduce three computable invariants for an (m)-tuple (v = (a_1,\dots,a_m) \in \mathbb Z^m):

1. (\Delta(v) = \sum_{i=1}^m (-1)^{i-1} a_i), the alternating sum of the coordinates.
2. (d(v) = \gcd{a_i - a_j \mid 1 \le i < j \le m}) (with the convention (d(v)=0) for trivial tuples where all entries are equal).
3. (M(v)), the multiset of residues ({a_i \bmod 2d(v)}_{i=1}^m); when (d(v)=0) the residues are taken to be the integers themselves.

Lemma 2.2 shows that each of these quantities is invariant under the elementary Hurwitz moves (\sigma_i) that generate the braid group (B_m). Moreover, Lemma 2.3 relates the permutation induced by a braid to the residues in (M(v)).

The core of the paper is a complete classification of the orbits of the Hurwitz action using only these invariants. The authors treat three families of braid groups separately:

• Classical braid group (B_m) – Theorem 1.1 states that two (m)-tuples lie in the same (B_m)-orbit if and only if they share the same triple ((\Delta, d, M)). The proof is divided into three cases: (m=2) (Section 3), odd (m \ge 3) (Section 4), and even (m \ge 4) (Section 5). In each case the authors construct explicit normal forms for orbit representatives. For (m=2) the representatives are ((x,x)) and ((x,y)) with the simple inequalities (0 \le 2x < y) or (0 \le 2y < x). For odd (m=2k-1) every orbit contains a tuple of the shape ((\underbrace{x,\dots,x}{2p-1},\underbrace{y,\dots,y}{2k-2p})) with (1\le p\le k) and (x<y). For even (m=2k) the normal form is ((\underbrace{x,\dots,x}{2p},\underbrace{y,\dots,y}{2k-2p})) with the same constraints. These normal forms are proved to be unique up to the obvious symmetries, giving a concrete complete system of representatives.

• Pure braid group (P_m) – The invariants (\Delta) and (d) remain unchanged, but (M) is no longer sufficient because pure braids preserve the ordering of strands. The authors refine (M) to a more detailed multiset (M^(v)) that records, modulo (2d(v)), the block structure of equal residues together with their positions. Theorem 1.2 (proved in Section 6) asserts that ((\Delta, d, M^)) completely classifies (P_m)-orbits.

• Virtual braid groups – The virtual braid group (VB_m) adds generators (\tau_i) that swap adjacent strands without affecting the quandle operation. These virtual moves change (\Delta) but leave (d) and (M) invariant. Consequently, Theorem 1.3 shows that for (VB_m) the pair ((d, M)) is a full invariant. For the virtual pure braid group (VP_m) the refined invariant (M^) is needed, leading to Theorem 1.4: two tuples are (VP_m)-equivalent iff they have the same (d) and (M^).

The paper’s methodology is constructive: starting from any tuple, a finite sequence of Hurwitz moves is exhibited that reduces the tuple to its normal form. Key technical tools include a “distance” function for three‑tuples, lemmas that strictly decrease this distance when entries are distinct, and careful bookkeeping of how the block structure evolves under braid moves.

Beyond the pure classification results, the authors emphasize the computational practicality of their invariants. All three quantities are obtained by elementary integer arithmetic, so an algorithm can decide orbit equivalence in linear time with respect to (m). This makes the results directly applicable to problems in quandle coloring of braid diagrams, Fox (n)-colorings, and the study of surface braids and branched coverings, where Hurwitz equivalence encodes monodromy data.

In summary, the paper provides a thorough and explicit description of Hurwitz orbits for the universal dihedral quandle under classical, pure, virtual, and virtual‑pure braid actions. By introducing the three invariants (\Delta), (d), and (M) (or its refined version (M^*)), the authors achieve a complete, computable classification, furnish explicit normal forms for each orbit, and extend the theory to the virtual setting. The work bridges group‑theoretic Hurwitz theory, quandle coloring, and low‑dimensional topology, offering tools that are both theoretically elegant and algorithmically feasible.