Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Subgroup conjugacy problem for Garside subgroups of Garside groups

Subgroup conjugacy problem for Garside subgroups of Garside groups 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups - Complexity - Cryptology de Gruyter

Subgroup conjugacy problem for Garside subgroups of Garside groups

Loading next page...
 
/lp/de-gruyter/subgroup-conjugacy-problem-for-garside-subgroups-of-garside-groups-AtaDcUtRNR
Publisher
de Gruyter
Copyright
© de Gruyter 2010
ISSN
1867-1144
eISSN
1869-6104
DOI
10.1515/GCC.2010.010
Publisher site
See Article on Publisher Site

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.

Journal

Groups - Complexity - Cryptologyde Gruyter

Published: Dec 1, 2010

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

There are no references for this article.