Subgroup conjugacy problem for Garside subgroups of Garside groups

Arkadius Kalka, Eran Liberman, Mina Teicher

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


We solve the subgroup conjugacy problem for parabolic subgroups and Garside subgroups of a Garside group, and we present deterministic algorithms. This solution may be improved by using minimal simple elements. For standard parabolic subgroups of Garside groups we provide effective algorithms for computing minimal simple elements.

Original languageEnglish
Pages (from-to)157-174
Number of pages18
JournalGroups, Complexity, Cryptology
Issue number2
StatePublished - Dec 2010

Bibliographical note

Funding Information:
This research was partially supported by the Emmy Noether Research Institute for Mathematics and the Minerva Foundation.


  • Braid group
  • Garside group
  • Garside subgroup
  • Minimal simple elements
  • Parabolic subgroup
  • Subgroup conjugacy problem


Dive into the research topics of 'Subgroup conjugacy problem for Garside subgroups of Garside groups'. Together they form a unique fingerprint.

Cite this