We prove that all diagram groups (in the sense of Guba and Sapir) are left-orderable. The proof is in two steps: firstly, it is proved that all diagram groups inject in a certain braid group on infinitely many strings, and secondly, this group is then shown to be left-orderable.
机构:
Univ Littoral Cote dOpale, UR 2597, LMPA, Lab Math Pures & Appl Joseph Liouville, F-62100 Calais, FranceUniv Littoral Cote dOpale, UR 2597, LMPA, Lab Math Pures & Appl Joseph Liouville, F-62100 Calais, France
机构:
Univ Littoral Cote dOpale, Lab Math Pures & Appl Joseph Liouville, LMPA, UR 2597, F-62100 Calais, FranceUniv Littoral Cote dOpale, Lab Math Pures & Appl Joseph Liouville, LMPA, UR 2597, F-62100 Calais, France