Subgroup conjugacy problem for Garside subgroups of Garside groups

DOI10.1515/GCC.2010.010zbMath1226.20028OpenAlexW1975223142MaRDI QIDQ3085991

Mina Teicher, Eran Liberman, Arkadius G. Kalka

Publication date: 1 April 2011

Published in: Groups – Complexity – Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/gcc.2010.010

zbMATH Keywords

parabolic subgroupsbraid groupsdeterministic algorithmsGarside groupsGarside subgroupsminimal simple elementssubgroup conjugacy problem

Mathematics Subject Classification ID

Braid groups; Artin groups (20F36) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cites Work

• A new approach to the word and conjugacy problems in the braid groups
• Parabolic subgroups of Garside groups.
• Les immeubles des groupes de tresses généralises
• Artin-Gruppen und Coxeter-Gruppen
• A new approach to the conjugacy problem in Garside groups.
• Theory of braids
• THE CONJUGACY PROBLEM IN SMALL GAUSSIAN GROUPS
• Cryptanalysis of the shifted conjugacy authentication protocol
• ALGORITHMS FOR POSITIVE BRAIDS
• Gaussian Groups and Garside Groups, Two Generalisations of Artin Groups
• THE BRAID GROUP AND OTHER GROUPS

This page was built for publication: Subgroup conjugacy problem for Garside subgroups of Garside groups