Sciweavers

JSC
2010

Solving the conjugacy problem in Garside groups by cyclic sliding

13 years 2 months ago
Solving the conjugacy problem in Garside groups by cyclic sliding
1 We present a solution to the conjugacy decision problem and the conjugacy search problem2 in Garside groups, which is theoretically simpler than the usual one, with no loss of efficiency.3 This is done by replacing the well known cycling and decycling operations by a new one,4 called cyclic sliding, which appears to be a more natural choice.5 We give an analysis of the complexity of our algorithm in terms of fundamental operations6 with simple elements, so our analysis is valid for every Garside group. This paper intends to7 be self-contained, not requiring any previous knowledge of prior algorithms, and includes all8 the details for the algorithm to be implemented on a computer.9
Volker Gebhardt, Juan González-Meneses
Added 29 Jan 2011
Updated 29 Jan 2011
Type Journal
Year 2010
Where JSC
Authors Volker Gebhardt, Juan González-Meneses
Comments (0)