Solving the conjugacy problem in Garside groups by cyclic sliding

Details Solving the conjugacy problem in Garside groups by cyclic sliding Solving the conjugacy problem in Garside groups by cyclic sliding

2008-09-05

arxiv.org/abs/0809.0948v1

Mathematics

Group Theory

30 pages

Scientific paper

We present a solution to the conjugacy decision problem and the conjugacy search problem in Garside groups, which is theoretically simpler than the usual one, with no loss of efficiency. This is done by replacing the well known cycling and decycling operations by a new one, called cyclic sliding, which appears to be a more natural choice. We give an analysis of the complexity of our algorithm in terms of fundamental operations with simple elements, so our analysis is valid for every Garside group. This paper intends to be self-contained, not requiring any previous knowledge of prior algorithms, and includes all the details for the algorithm to be implemented on a computer.

Affiliated with

Also associated with

No associations

Rating

Solving the conjugacy problem in Garside groups by cyclic sliding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Solving the conjugacy problem in Garside groups by cyclic sliding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solving the conjugacy problem in Garside groups by cyclic sliding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-658585