[Paper Review] Finite orbits of the braid group action on sets of reflections

Alexandre Stefanov|ArXiv.org|Sep 14, 2004

Geometric and Algebraic Topology12 references3 citations

TL;DR

This paper proves Dubrovin's conjecture that all finite orbits of the braid group action on tuples of reflections arise from finite Coxeter groups. Using a combinatorial approach based on arrangement matrices and graph representations, it classifies finite orbits as either non-degenerate (corresponding to generating reflections of finite Coxeter groups) or degenerate (arising from redundant generators), showing that such orbits only occur when all reflections lie within a finite reflection group, thus completing the classification of algebraic solutions to isomonodromic deformation equations via braid group dynamics.

ABSTRACT

The finite orbits of the braid group action on Stokes matrices are studied and are shown to be the orbits on ordered sets of reflections, generating finite groups. All invariants of a reflection arrangement are determined. Determination of the orbits of the braid group on non-redundant generaing reflections in finite groups is done in a new way. The original idea is to introduce universal sets of generators in each group. These sets are found for all finite Coxeter groups. The orbits are classified for non-degenerate arrangement matrices.

Motivation & Objective

• To classify all finite orbits of the braid group action on tuples of reflections.
• To resolve Dubrovin's conjecture that such finite orbits originate exclusively from finite Coxeter groups.
• To characterize degenerate orbits arising from redundant generators in finite Coxeter groups.
• To establish a combinatorial framework using arrangement matrices and universal graphs for analyzing braid group orbits.
• To determine when extended configurations of reflections yield finite orbits under braid group action.

Proposed method

• The paper uses arrangement matrices—Gram matrices of normed eigenvectors of reflections under a symmetric bilinear form—as a representation of reflection tuples.
• It introduces a graph representation of the arrangement matrix, where vertices correspond to reflections and edges encode angles between them via cosine values.
• The braid group action is modeled as a transformation on the graph: swapping the role of adjacent vertices via conjugation, which induces a non-linear transformation on the matrix entries.
• Induction is used on matrix size, proving that finite orbits must arise from non-degenerate subarrangements generating finite Coxeter groups.
• The paper analyzes degenerate cases by identifying maximal non-degenerate principal minors and showing that all additional reflections must lie in the group they generate.
• It employs invariants such as the determinant of $ C - xI $ and the structure of eigenvalues to classify orbits and distinguish between finite and infinite cases.

Experimental results

Research questions

• RQ1 Do all finite orbits of the braid group action on tuples of reflections arise from finite Coxeter groups, as conjectured by Dubrovin?
• RQ2 What characterizes the finite orbits that arise from degenerate arrangement matrices, particularly those with corank greater than one?
• RQ3 How can the braid group action on reflection tuples be systematically classified using combinatorial invariants of the associated arrangement matrices?
• RQ4 Can all finite orbits be traced back to the reflection generators of a finite Coxeter group, even in the degenerate case?
• RQ5 What conditions ensure that an extension of a reflection system by an additional reflection preserves the finiteness of the braid group orbit?

Key findings

• All finite orbits of the braid group action on tuples of reflections arise exclusively from finite Coxeter groups, confirming Dubrovin's conjecture.
• Non-degenerate arrangement matrices with finite orbits correspond precisely to generating sets of reflections in finite Coxeter groups.
• Degenerate orbits—arising from redundant generators—only occur when all reflections lie within the group generated by a maximal non-degenerate subarrangement.
• The paper establishes that for a matrix to have a finite orbit, all reflections in the tuple must be contained in the group generated by any maximal non-degenerate principal minor.
• Finite orbits are characterized by the property that the braid group action preserves the group structure of the reflection system, and no continuous parameters can be added without breaking finiteness.
• The classification is completed via induction and graph-theoretic analysis, showing that extensions of universal graphs of $ H_3 $, $ H_4 $, and Weyl groups only yield finite orbits when the new reflection lies in the group generated by the others.