On the complexity of braids

Journal of the European Mathematical Society

Volumn 9, Issue 4, 2007, Pages 801-840

  Dynnikov, Ivan ^a,b   Wiest, Bert ^c  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

^b LIFR MIIP   (Russian Federation)

^c CNRS   (France)

Author keywords

Braid; Complexity; Curve diagram; Lamination; Train track

Indexed keywords

EID: 36348996499     PISSN: 14359855     EISSN: None     Source Type: Journal    
DOI: 10.4171/JEMS/98     Document Type: Article

References (26)

1. Artin, E.: Theorie der Zöpfe. Abh. Math. Sem. Hamburg Univ. 4, 47-72 (1925) JFM 51.0450.01
2. Artin, E.: Theory of braids. Ann. of Math. 48, 101-126 (1947) Zbl 0030.17703 MR 0019087
3. Agol, I., Hass, J., Thurston, W.: The computational complexity of knot genus and spanning area. Trans. Amer. Math. Soc. 358, 3821-3850 (2006) Zbl 1098.57003 MR 2219001
4. Birman, J.: Braids, Links, and Mapping Class Groups. Ann. of Math. Stud. 82, Princeton Univ. Press, Princeton (1975) Zbl 0305.57013 MR 0375281
5. Birman, J., Ko, K. H., Lee, S. J.: A new approach to the word and conjugacy problems in the braid groups. Adv. Math. 139, 322-353 (1998) Zbl 0937.20016 MR 1654165
6. Bonnefont, M., Hillion, E.: computer program (maple worksheet), http://perso.univ-rennes1.fr/bertold.wiest
7. Choi, Y.-E., Rafi, K.: Comparison between Teichmüller and Lipschitz metrics. arXiv:math.GT/0510136
8. Dehornoy, P.: Braid groups and left distributive operations. Trans. Amer. Math. Soc. 345, 115-151 (1994) Zbl 0837.20048 MR 1214782
9. Dehornoy, P.: A fast method for comparing braids. Adv. Math. 125, 200-235 (1997) Zbl 0882.20021 MR 1434111
10. Dehornoy, P., Dynnikov, I., Rolfsen, D., Wiest, B.: Why are Braids Orderable?. Panoramas et Synthèses 14, Soc. Math. France (2002) Zbl 1048.20021 MR 1988550
11. Dynnikov, I. A.: On a Yang-Baxter mapping and the Dehornoy ordering. Russian Math. Surveys 57, 592-594 (2002) Zbl 1067.20501 MR 1918864
12. Epstein, D. B. A., Cannon, J. W., Holt, D. F., Levy, S. V. F., Patterson, M. S., Thurston, W.: Word Processing in Groups. Jones and Bartlett, Boston and London (1992) Zbl 0764.20017 MR 1161694
13. Fathi, A., Laudenbach, F., Poenaru, V.: Travaux de Thurston sur les surfaces. Séminaire Orsay, Astérisque 66-67 (1979), reprinted 1991
14. Fenn, R., Greene, M. T., Rolfsen, D., Rourke, C., Wiest, B.: Ordering the braid groups. Pacific J. Math. 191, 49-74 (1999) Zbl 1009.20042 MR 1725462
15. Garside, F. A.: The braid group and other groups. Quart. J. Math. Oxford (2) 20, 235-254 (1969) Zbl 0194.03303 MR 0248801
16. Hamenstädt, U.: Geometry of the mapping class group II: subsurfaces. arXiv:math.GR/0511349v3
17. Kerckhoff, S. P.: The asymptotic geometry of Teichmüller space. Topology 19, 23-41 (1980) Zbl 0439.30012 MR 0559474
18. Malyutin, A. V.: Fast algorithms for the recognition and comparison of braids. Zap. Nauchn. Sem. POMI 279, 197-217 (2001) Zbl 1070.20044 MR 1846081
19. Masur, H. A., Minsky, Y. N.: Geometry of the complex of curves I: hyperbolicity. Invent. Math. 138, 103-149 (1999) Zbl 0941.32012 MR 1714338
20. Masur, H. A., Minsky, Y. N.: Geometry of the complex of curves II: hierarchical structure. Geom. Funct. Anal. 10, 902-974 (2000) Zbl 0972.32011 MR 1791145
21. Minsky, Y. N.: Extremal length estimates and product regions in Teichmüller space. Duke Math. J. 83, 249-286 (1996) Zbl 0861.32015 MR 1390649
22. Mosher, L.: Mapping class groups are automatic. Ann. of Math. 142, 303-384 (1995) Zbl 0867.57004 MR 1343324
23. Penner, R. C., Harer, J. L.: Combinatorics of Train Tracks. Princeton Univ. Press (1992) Zbl 0765.57001 MR 1144770
24. Rafi, K.: A combinatorial model for the Teichmüller metric. arXiv:math.GT/0509584
25. Thurston, W. P.: Minimal stretch maps between hyperbolic surfaces. arXiv:math.GT/9801039
26. Wiest, B.: An algorithm for the word problem in braid groups. arXiv:math.GT/0211169