Conjugacy in Garside groups I: Cyclings, powers, and rigidity

Details Conjugacy in Garside groups I: Cyclings, powers, and rigidity Conjugacy in Garside groups I: Cyclings, powers, and rigidity

2006-05-09

arxiv.org/abs/math/0605230v1

Mathematics

Geometric Topology

41 pages

Scientific paper

In this paper a relation between iterated cyclings and iterated powers of elements in a Garside group is shown. This yields a characterization of elements in a Garside group having a rigid power, where 'rigid' means that the left normal form changes only in the obvious way under cycling and decycling. It is also shown that, given X in a Garside group, if some power X^m is conjugate to a rigid element, then m can be bounded above by ||\Delta||^3. In the particular case of braid groups, this implies that a pseudo-Anosov braid has a small power whose ultra summit set consists of rigid elements. This solves one of the problems in the way of a polynomial solution to the conjugacy decision problem (CDP) and the conjugacy search problem (CSP) in braid groups. In addition to proving the rigidity theorem, it will be shown how this paper fits into the authors' program for finding a polynomial algorithm to the CDP/CSP, and what remains to be done.

Affiliated with

Also associated with

No associations

Rating

Conjugacy in Garside groups I: Cyclings, powers, and rigidity 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 Conjugacy in Garside groups I: Cyclings, powers, and rigidity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Conjugacy in Garside groups I: Cyclings, powers, and rigidity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-675803