A New Approach to the Conjugacy Problem in Garside Groups

Abstract

The cycling operation endows the super summit set Sx of any element x of a Garside group G with the structure of a directed graph Γx. We establish that the subset Ux of Sx consisting of the circuits of Γx can be used instead of Sx for deciding conjugacy to x in G, yielding a faster and more practical solution to the conjugacy problem for Garside groups… (More)

Topics

3 Figures and Tables

Statistics

051015'06'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

76 Citations

Semantic Scholar estimates that this publication has 76 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Gebhardt2008ANA, title={A New Approach to the Conjugacy Problem in Garside Groups}, author={Volker Gebhardt}, year={2008} }