Conjugacy in Garside groups. I: Cyclings, powers and rigidity.
DOI10.4171/GGD/12zbMath1160.20026arXivmath/0605230OpenAlexW1979857659MaRDI QIDQ2472583
Joan S. Birman, Volker Gebhardt, Juan González-Meneses
Publication date: 22 February 2008
Published in: Groups, Geometry, and Dynamics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0605230
braid groupsrigidityGarside groupsnormal form theoremsconjugacy search problemconjugacy decision problemiterated cyclingsiterated powersstable ultra summit sets
Conjugacy classes for groups (20E45) Generators, relations, and presentations of groups (20F05) Braid groups; Artin groups (20F36) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items (25)
Cites Work
- Unnamed Item
- Fragments of the word \(\Delta\) in a braid group
- A new approach to the word and conjugacy problems in the braid groups
- Train-tracks for surface homeomorphisms
- An algebraic method for public-key cryptography
- Springer theory in braid groups and the Birman-Ko-Lee monoid.
- The dual braid monoid
- BRAIDS AND THE NIELSEN-THURSTON CLASSIFICATION
This page was built for publication: Conjugacy in Garside groups. I: Cyclings, powers and rigidity.