Article
Licensed
Unlicensed
Requires Authentication
Subgroup conjugacy problem for Garside subgroups of Garside groups
-
Arkadius Kalka
,
Eran Liberman
Published/Copyright:
September 9, 2010
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
© de Gruyter 2010
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- On asymptotic densities and generic properties in finitely generated groups
- On finite Thurston-type orderings of braid groups
- Subgroup conjugacy problem for Garside subgroups of Garside groups
- The Latin squares and the secret sharing schemes
- A note on the homology of hyperbolic groups
- Cutting up graphs revisited – a short proof of Stallings' structure theorem
- Some geodesic problems in groups
- Search and witness problems in group theory
- Algebraic attacks using SAT-solvers
Keywords for this article
Braid group;
Garside group;
parabolic subgroup;
Garside subgroup;
subgroup conjugacy problem;
minimal simple elements
Articles in the same Issue
- On asymptotic densities and generic properties in finitely generated groups
- On finite Thurston-type orderings of braid groups
- Subgroup conjugacy problem for Garside subgroups of Garside groups
- The Latin squares and the secret sharing schemes
- A note on the homology of hyperbolic groups
- Cutting up graphs revisited – a short proof of Stallings' structure theorem
- Some geodesic problems in groups
- Search and witness problems in group theory
- Algebraic attacks using SAT-solvers
