Dehornoy's ordering of the braid groups extends the subword ordering

Pacific Journal of Mathematics

Volumn 191, Issue 1, 1999, Pages 183-188

  Wiest, Bert ^a  

^a AIX MARSEILLE UNIVERSITY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002393595     PISSN: 00308730     EISSN: None     Source Type: Journal    
DOI: 10.2140/pjm.1999.191.183     Document Type: Article

References (8)

1. J. Birman, Braids, links, and mapping class groups, Annals of Math. Studies, 82, Princeton University Press, Princeton, 1975.
2. S. Burckel, The wellordering on positive braids, J. Pure Appl. Algebra, 120(1) (1997), 1-18.
3. P. Dehornoy, Braid groups and left distributive operations, Trans. A.M.S., 343 (1994), 115-150.
4. _, A fast method of comparing braids, Adv. in Math., 125 (1997), 200-235.
5. E. Elrifai and H. Morton, Algorithms for positive braids, Quart. J. Math. Oxford, 45 (1994), 479-497.
6. R. Fenn, M.T. Greene, D. Rolfsen, C. Rourke and B. Wiest, Ordering the braid groups, Pac. J. Math., 191(1) (1999), 49-74.
7. G. Higman, Ordering and divisibility in abstract algebras, Proc. London Math. Soc., 2 (1952), 326-336.
8. R. Laver, Braid group actions on left distributive structures and well-orderings in the braid group, J. Pure Appl. Algebra, 108(1) (1996), 81-98.