Subgroup conjugacy problem for Garside subgroups of Garside groups

Arkadius Kalka; Eran Liberman; Mina Teicher

doi:10.1515/gcc.2010.010

Published by De Gruyter September 9, 2010

Subgroup conjugacy problem for Garside subgroups of Garside groups

Arkadius Kalka , Eran Liberman and Mina Teicher

From the journal Groups Complexity Cryptology

https://doi.org/10.1515/gcc.2010.010

Showing a limited preview of this publication:

Abstract

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.

Keywords.: Braid group; Garside group; parabolic subgroup; Garside subgroup; subgroup conjugacy problem; minimal simple elements

Received: 2009-07-31

Revised: 2010-03-10

Published Online: 2010-09-09

Published in Print: 2010-December

Subgroup conjugacy problem for Garside subgroups of Garside groups

Abstract

Journal and Issue

Articles in the same Issue