Conjugacy in Garside groups. I: Cyclings, powers and rigidity. (Q2472583): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 08:16, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Conjugacy in Garside groups. I: Cyclings, powers and rigidity. |
scientific article |
Statements
Conjugacy in Garside groups. I: Cyclings, powers and rigidity. (English)
0 references
22 February 2008
0 references
Summary: 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 \(\{B_n;\;n\in\mathbb{N}\}\), 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.
0 references
Garside groups
0 references
rigidity
0 references
stable ultra summit sets
0 references
iterated cyclings
0 references
iterated powers
0 references
normal form theorems
0 references
braid groups
0 references
conjugacy decision problem
0 references
conjugacy search problem
0 references