Subgroup conjugacy problem for Garside subgroups of Garside groups

Arkadius Kalka; Eran Liberman; Mina Teicher

doi:10.1515/GCC.2010.010

Subgroup conjugacy problem for Garside subgroups of Garside groups

Arkadius Kalka, Eran Liberman, Mina Teicher

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

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.

Original language	English
Pages (from-to)	157-174
Number of pages	18
Journal	Groups, Complexity, Cryptology
Volume	2
Issue number	2
DOIs	https://doi.org/10.1515/GCC.2010.010
State	Published - Dec 2010

Bibliographical note

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

Keywords

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

Access to Document

10.1515/GCC.2010.010

Cite this

@article{e4386919f0b5482aa98935e1e6d301f4,

title = "Subgroup conjugacy problem for Garside subgroups of Garside groups",

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, Garside subgroup, Minimal simple elements, Parabolic subgroup, Subgroup conjugacy problem",

author = "Arkadius Kalka and Eran Liberman and Mina Teicher",

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

year = "2010",

month = dec,

doi = "10.1515/GCC.2010.010",

language = "אנגלית",

volume = "2",

pages = "157--174",

journal = "Groups, Complexity, Cryptology",

issn = "1867-1144",

publisher = "Walter de Gruyter GmbH",

number = "2",

}

TY - JOUR

T1 - Subgroup conjugacy problem for Garside subgroups of Garside groups

AU - Kalka, Arkadius

AU - Liberman, Eran

AU - Teicher, Mina

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

PY - 2010/12

Y1 - 2010/12

N2 - 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.

AB - 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.

KW - Braid group

KW - Garside group

KW - Garside subgroup

KW - Minimal simple elements

KW - Parabolic subgroup

KW - Subgroup conjugacy problem

UR - http://www.scopus.com/inward/record.url?scp=84858420679&partnerID=8YFLogxK

U2 - 10.1515/GCC.2010.010

DO - 10.1515/GCC.2010.010

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84858420679

SN - 1867-1144

VL - 2

SP - 157

EP - 174

JO - Groups, Complexity, Cryptology

JF - Groups, Complexity, Cryptology

IS - 2

ER -

Subgroup conjugacy problem for Garside subgroups of Garside groups

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this