Subgroups of braid groups generated by Birman-Ko-Lee generators

1. Problem Statement

The paper investigates the structure of subgroups of the $n$-strand braid group, $B_n$, generated by subsets of the Birman-Ko-Lee (BKL) generators, denoted as $a_{ij}$ for $1 \le i < j \le n$.

• Context: While subgroups generated by subsets of the standard generators ($\sigma_i$) are well-understood (they are products of smaller braid groups corresponding to interval partitions), the structure of subgroups generated by arbitrary subsets of BKL generators is more complex.
• The Challenge: Given an arbitrary partition $Q$ of the set $\{1, \dots, n\}$, let $B_Q$ be the subgroup generated by all $a_{ij}$ where $i$ and $j$ belong to the same component of $Q$. The authors address two fundamental algorithmic and structural problems:
  1. Membership Problem (P1): How to intrinsically describe $B_Q$ to decide if a given element $b \in B_n$ belongs to $B_Q$.
  2. Decomposition Problem (P2): If $b \in B_Q$, provide an algorithm to express $b$ as a product of the generators of $B_Q$.

2. Methodology

The authors employ a combination of algebraic group theory and geometric topology, specifically utilizing the Hurwitz action and arc diagrams.

A. The Hurwitz Action

The core algebraic tool is the action of the braid group $B_n$ on the $n$-fold product of a free group $F_m = \langle x_1, \dots, x_m \rangle$.

• The action is defined on tuples $(g_1, \dots, g_n) \in F_m^n$ by the standard Hurwitz formula:
  $$\sigma_i(g_1, \dots, g_i, g_{i+1}, \dots, g_n) = (g_1, \dots, g_{i+1}, g_{i+1}^{-1}g_i g_{i+1}, \dots, g_n)$$
• The authors define a specific tuple $t \in F_m^n$ based on the partition $Q$: if $i \in Q_s$, the $i$-th component of $t$ is the generator $x_s$.
• Key Insight: The subgroup $B_Q$ is characterized as the stabilizer of this specific tuple $t$ under the Hurwitz action.

B. Arc Diagrams and Mapping Class Groups

To prove the structural results, the authors translate the algebraic problem into a geometric one using the mapping class group interpretation of $B_n$.

• Arc Diagrams: They associate a tuple of conjugates in a free group with an arc diagram on the plane $\mathbb{R}^2$ with marked points. These diagrams consist of arcs connecting marked points (representing generators) and half-lines extending to infinity.
• Reduction Sequences: The diagrams are constructed based on reduction sequences of words in the free group.
• Half-Twists: The action of the BKL generators $a_{ij}$ corresponds to half-twists ($H_{A_{ij}}$) along arcs connecting points $p_i$ and $p_j$ in the plane.
• Complexity Measure: To prove the stabilizer result, they define a "complexity" function $c(P)$ for an arc diagram $P$, counting the number of overlapping lower arcs. They demonstrate that if a braid is in the stabilizer but not generated by the specific $a_{ij}$, one can find a half-twist that reduces this complexity, leading to a contradiction via induction.

3. Key Contributions and Results

Theorem 1: Intrinsic Description and Membership (P1)

The paper establishes that $B_Q$ is exactly the stabilizer of the tuple $t$ defined by the partition $Q$.

• Result: $B_Q = \text{Stab}_{B_n}(t)$.
• Implication: To check if $b \in B_n$ is in $B_Q$, one simply computes the action $b \cdot t$. If $b \cdot t = t$, then $b \in B_Q$. This provides a computationally efficient membership criterion.

Theorem 2: Orbit Characterization

The authors describe the orbit of the tuple $t$ under the $B_n$ action.

• Result: The orbit consists of all tuples in the union of products of conjugacy classes $\bigcup_{\tau \in S_n} C(t_{\tau(1)}) \times \dots \times C(t_{\tau(n)})$ such that the product of the components equals the product of the original tuple components ($t_1 \dots t_n$).
• Significance: This generalizes known results about the transitivity of the Hurwitz action on specific sets of generators.

Theorem 3: Algorithmic Decomposition (P2)

The paper provides a constructive algorithm to decompose an element $b \in B_Q$ into the generators of $B_Q$.

• Mechanism: The algorithm iteratively reduces the "complexity" of the arc diagram associated with the tuple $b \cdot t_{triv}$ (where $t_{triv}$ is the trivial tuple of free generators).
• Process:
  1. Identify a subword in the tuple components that represents a "cancellation" (adjacent arcs with opposite orientation).
  2. Apply the inverse of the corresponding BKL generator ($a_{ij}^{\pm 1}$) to the tuple.
  3. Record the generator.
  4. Repeat until the tuple returns to the trivial state.
• Output: The sequence of applied generators yields the decomposition $b = a_{i_1 j_1}^{\epsilon_1} \dots a_{i_k j_k}^{\epsilon_k}$.

Structural Insight on Non-Non-Crossing Partitions

The paper highlights a critical distinction:

• If the partition $Q$ is non-crossing (no arcs intersect), $B_Q$ is a product of braid groups (a standard parabolic subgroup).
• If $Q$ is crossing (arcs intersect), $B_Q$ is a "different beast." Specifically, if indices $i < j < k < l$ exist such that $i, k$ are in one component and $j, l$ in another, the generators $a_{ik}$ and $a_{jl}$ generate a free subgroup of rank 2 (Lemma 2.2).

4. Significance and Applications

• Theoretical Advancement: The work extends the theory of parabolic subgroups in braid groups to the "dual" setting of Birman-Ko-Lee generators, providing a unified framework for understanding these subgroups regardless of whether the partition is crossing or non-crossing.
• Algorithmic Utility: The provided membership test and decomposition algorithm are constructive and implementable (e.g., in SageMath), solving long-standing computational questions regarding these specific subgroups.
• Future Applications: The authors note that these results are instrumental in describing the orbit and stabilizer of exceptional collections under mutation actions in the context of derived categories and algebraic geometry (specifically referencing work by [3]). This connects braid group theory to the study of stability conditions and tilting theory.

Summary

Nordskova and Van Den Bergh successfully characterize subgroups of braid groups generated by Birman-Ko-Lee generators by identifying them as stabilizers of specific tuples under the Hurwitz action. By leveraging the geometric interpretation of half-twists and arc diagrams, they prove that these subgroups are determined by the partition of indices and provide explicit algorithms for membership testing and generator decomposition. This bridges the gap between the combinatorial structure of braid groups and their geometric/topological representations.