Solving the conjugacy problem in Garside groups by cyclic sliding.
DOI10.1016/j.jsc.2010.01.013zbMath1235.20032DBLPjournals/jsc/GebhardtG10arXiv0809.0948OpenAlexW1512261170WikidataQ59275301 ScholiaQ59275301MaRDI QIDQ972844
Volker Gebhardt, Juan González-Meneses
Publication date: 21 May 2010
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0809.0948
algorithmscomplexity analysisconjugacy problemcyclingGarside groupsnormal form theoremsconjugacy search problemultra summit setscyclic sliding
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 (14)
Cites Work
- Unnamed Item
- Unnamed Item
- Artin groups of finite type are biautomatic
- The cyclic sliding operation in Garside groups.
- A new approach to the word and conjugacy problems in the braid groups
- Conjugacy problem for braid groups and Garside groups.
- Conjugacy in Garside groups. III: Periodic braids.
- Conjugacy in Garside groups. I: Cyclings, powers and rigidity.
- A new approach to the conjugacy problem in Garside groups.
- Groupes de Garside
- Abelian Subgroups of Garside Groups
- ALGORITHMS FOR POSITIVE BRAIDS
- Gaussian Groups and Garside Groups, Two Generalisations of Artin Groups
This page was built for publication: Solving the conjugacy problem in Garside groups by cyclic sliding.