Reducible braids and Garside theory.

DOI10.2140/AGT.2011.11.2971zbMATH Open1252.20035arXiv1008.0238OpenAlexW2049890755WikidataQ59275299 ScholiaQ59275299MaRDI QIDQ658401FDOQ658401

Authors: Juan González-Meneses, Bert Wiest Edit this on Wikidata

Publication date: 12 January 2012

Published in: Algebraic \& Geometric Topology (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1008.0238

Recommendations

• Dual Garside structure and reducibility of braids.
• A Garside-theoretic approach to the reducibility problem in braid groups.
• On reduction curves and Garside properties of braids.
• Fast Nielsen-Thurston classification of braids.
• Fast algorithmic Nielsen-Thurston classification of four-strand braids.

zbMATH Keywords

conjugacy classesGarside groupsbraid groupspolynomial time algorithmspolynomial time complexitycyclic sliding operationNielsen-Thurston classificationreducible braids

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Braid groups; Artin groups (20F36) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cites Work

• A primer on mapping class groups
• Title not available (Why is that?)
• Conjugacy problem for braid groups and Garside groups.
• Gaussian Groups and Garside Groups, Two Generalisations of Artin Groups
• Title not available (Why is that?)
• Train-tracks for surface homeomorphisms
• Title not available (Why is that?)
• Abelian and solvable subgroups of the mapping class group
• ALGORITHMS FOR POSITIVE BRAIDS
• How to read the length of a braid from its curve diagram.
• Conjugacy in Garside groups. I: Cyclings, powers and rigidity.
• Conjugacy in Garside groups. II: Structure of the ultra summit set.
• A new approach to the conjugacy problem in Garside groups.
• The cyclic sliding operation in Garside groups.
• On reduction curves and Garside properties of braids.
• On the structure of the centralizer of a braid
• A Garside-theoretic approach to the reducibility problem in braid groups.
• 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
• Fast algorithmic Nielsen-Thurston classification of four-strand braids.

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
• Title not available (Why is that?)
• 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)