FAST NIELSEN-THURSTON CLASSIFICATION OF BRAIDS

Matthieu Calvez (1)

1 IRMAR - Institut de Recherche Mathématique de Rennes

We prove the existence of an algorithm which solves the reducibility problem in braid groups and runs in cubic time with respect to the braid length for any fixed braid index.

Domaines: Théorie des groupes [math.GR]

Matthieu Calvez. FAST NIELSEN-THURSTON CLASSIFICATION OF BRAIDS. 2011. ⟨hal-00647035v2⟩