Abstract: We show that reducible braids which are, in a Garside-theoretical sense, as simple as possible within their conjugacy class, are also as simple as possible in a geometric sense. More precisely, if a braid belongs to a certain subset of its conjugacy class which we call the stabilized set of sliding circuits, and if it is reducible, then its reducibility is geometrically obvious: it has a round or almost round reducing curve. Moreover, for any given braid, an element of its stabilized set of sliding circuits can be found using the well-known cyclic sliding operation. This leads to a polynomial time algorithm for deciding the Nielsen-Thurston type of any braid, modulo one well-known conjecture on the speed of convergence of the cyclic sliding operation.
Recommendations
Cites work
- scientific article; zbMATH DE number 53661 (Why is no real title available?)
- scientific article; zbMATH DE number 193437 (Why is no real title available?)
- scientific article; zbMATH DE number 475334 (Why is no real title available?)
- A Garside-theoretic approach to the reducibility problem in braid groups.
- A new approach to the conjugacy problem in Garside groups.
- A primer on mapping class groups
- ALGORITHMS FOR POSITIVE BRAIDS
- Abelian and solvable subgroups of the mapping class group
- Conjugacy in Garside groups. I: Cyclings, powers and rigidity.
- Conjugacy in Garside groups. II: Structure of the ultra summit set.
- Conjugacy problem for braid groups and Garside groups.
- Fast algorithmic Nielsen-Thurston classification of four-strand braids.
- Gaussian Groups and Garside Groups, Two Generalisations of Artin Groups
- How to read the length of a braid from its curve diagram.
- On reduction curves and Garside properties of braids.
- On the structure of the centralizer of a braid
- Solving the conjugacy problem in Garside groups by cyclic sliding.
- Some power of an element in a Garside group is conjugate to a periodically geodesic element
- The cyclic sliding operation in Garside groups.
- Train-tracks for surface homeomorphisms
Cited in
(12)- Dual Garside structure and reducibility of braids.
- On dilatation factors of braids on three strands.
- Fast algorithmic Nielsen-Thurston classification of four-strand braids.
- A Garside-theoretic approach to the reducibility problem in braid groups.
- Efficient algorithm for recognizing the Nielsen-Thurston type of a three-strand braid.
- On the genericity of loxodromic actions
- scientific article; zbMATH DE number 475334 (Why is no real title available?)
- Garside theory and subsurfaces: some examples in braid groups
- A family of pseudo-Anosov braids whose super-summit sets grow exponentially.
- How to read the length of a braid from its curve diagram.
- Fast Nielsen-Thurston classification of braids.
- On reduction curves and Garside properties of braids.
This page was built for publication: Reducible braids and Garside theory.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658401)
