Reducible braids and Garside theory.
DOI10.2140/agt.2011.11.2971zbMath1252.20035arXiv1008.0238OpenAlexW2049890755WikidataQ59275299 ScholiaQ59275299MaRDI QIDQ658401
Bert Wiest, Juan González-Meneses
Publication date: 12 January 2012
Published in: Algebraic \& Geometric Topology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1008.0238
conjugacy classesbraid groupspolynomial time algorithmsGarside groupspolynomial time complexitycyclic sliding operationNielsen-Thurston classificationreducible braids
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)
Related Items (8)
Cites Work
- How to read the length of a braid from its curve diagram.
- Abelian and solvable subgroups of the mapping class group
- A Garside-theoretic approach to the reducibility problem in braid groups.
- The cyclic sliding operation in Garside groups.
- Solving the conjugacy problem in Garside groups by cyclic sliding.
- Train-tracks for surface homeomorphisms
- Conjugacy problem for braid groups and Garside groups.
- 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.
- On reduction curves and Garside properties of braids
- FAST ALGORITHMIC NIELSEN–THURSTON CLASSIFICATION OF FOUR-STRAND BRAIDS
- Some power of an element in a Garside group is conjugate to a periodically geodesic element
- ALGORITHMS FOR POSITIVE BRAIDS
- Gaussian Groups and Garside Groups, Two Generalisations of Artin Groups
- On the structure of the centralizer of a braid
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Reducible braids and Garside theory.