Fast Nielsen–Thurston classification of braids

Calvez, Matthieu

doi:10.2140/agt.2014.14.1745

¹Departamento de Matemática y Ciencia de la Computación, Universidad de Santiago de Chile, Avenida Libertador Bernardo O’Higgins 3363, Estación Central, 9160000 Santiago, Chile

Algebraic and Geometric Topology, Tome 14 (2014) no. 3, pp. 1745-1758

Cet article a éte moissonné depuis la source Mathematical Sciences Publishers

Voir la notice de l'article

Résumé

We prove the existence of an algorithm that solves the reducibility problem in braid groups and runs in quadratic time with respect to the braid length for any fixed braid index.

DOI : 10.2140/agt.2014.14.1745

Classification : 20F36, 20F10, 20F65
Keywords: braid groups, Nielsen–Thurston classification

Affiliations des auteurs :

Calvez, Matthieu ¹

¹ Departamento de Matemática y Ciencia de la Computación, Universidad de Santiago de Chile, Avenida Libertador Bernardo O’Higgins 3363, Estación Central, 9160000 Santiago, Chile

@article{10_2140_agt_2014_14_1745,
     author = {Calvez, Matthieu},
     title = {Fast {Nielsen{\textendash}Thurston} classification of braids},
     journal = {Algebraic and Geometric Topology},
     pages = {1745--1758},
     year = {2014},
     volume = {14},
     number = {3},
     doi = {10.2140/agt.2014.14.1745},
     url = {http://geodesic.mathdoc.fr/articles/10.2140/agt.2014.14.1745/}
}

TY  - JOUR
AU  - Calvez, Matthieu
TI  - Fast Nielsen–Thurston classification of braids
JO  - Algebraic and Geometric Topology
PY  - 2014
SP  - 1745
EP  - 1758
VL  - 14
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.2140/agt.2014.14.1745/
DO  - 10.2140/agt.2014.14.1745
ID  - 10_2140_agt_2014_14_1745
ER  -

%0 Journal Article
%A Calvez, Matthieu
%T Fast Nielsen–Thurston classification of braids
%J Algebraic and Geometric Topology
%D 2014
%P 1745-1758
%V 14
%N 3
%U http://geodesic.mathdoc.fr/articles/10.2140/agt.2014.14.1745/
%R 10.2140/agt.2014.14.1745
%F 10_2140_agt_2014_14_1745

Calvez, Matthieu. Fast Nielsen–Thurston classification of braids. Algebraic and Geometric Topology, Tome 14 (2014) no. 3, pp. 1745-1758. doi: 10.2140/agt.2014.14.1745

Bibliographie
Cité par

[1] D Benardete, M Gutiérrez, Z Nitecki, A combinatorial approach to reducibility of mapping classes, from: "Mapping class groups and moduli spaces of Riemann surfaces" (editors C F Bödigheimer, R M Hain), Contemp. Math. 150, Amer. Math. Soc. (1993) 1

[2] D Bernardete, Z Nitecki, M Gutiérrez, Braids and the Nielsen–Thurston classification, J. Knot Theory Ramifications 4 (1995) 549

[3] M Bestvina, M Handel, Train-tracks for surface homeomorphisms, Topology 34 (1995) 109

[4] J S Birman, Braids, links, and mapping class groups, Annals of Mathematics Studies 82, Princeton Univ. Press (1974)

[5] J S Birman, V Gebhardt, J González-Meneses, Conjugacy in Garside groups, I: Cyclings, powers and rigidity, Groups Geom. Dyn. 1 (2007) 221

[6] J S Birman, V Gebhardt, J González-Meneses, Conjugacy in Garside groups, III: Periodic braids, J. Algebra 316 (2007) 746

[7] J S Birman, V Gebhardt, J González-Meneses, Conjugacy in Garside groups, II: Structure of the ultra summit set, Groups Geom. Dyn. 2 (2008) 13

[8] J S Birman, K H Ko, S J Lee, A new approach to the word and conjugacy problems in the braid groups, Adv. Math. 139 (1998) 322

[9] J S Birman, K H Ko, S J Lee, The infimum, supremum, and geodesic length of a braid conjugacy class, Adv. Math. 164 (2001) 41

[10] M Calvez, Dual Garside structure and reducibility of braids, J. Algebra 356 (2012) 355

[11] M Calvez, B Wiest, A fast solution to the conjugacy problem in the $4$–strand braid group,

[12] M Calvez, B Wiest, Fast algorithmic Nielsen–Thurston classification of four-strand braids, J. Knot Theory Ramifications 21 (2012) 1250043, 25

[13] A J Casson, S A Bleiler, Automorphisms of surfaces after Nielsen and Thurston, London Math. Soc. Student Texts 9, Cambridge Univ. Press (1988)

[14] R Charney, Geodesic automation and growth functions for Artin groups of finite type, Math. Ann. 301 (1995) 307

[15] P Dehornoy, Groupes de Garside, Ann. Sci. École Norm. Sup. 35 (2002) 267

[16] P Dehornoy, F Digne, E Godelle, D Krammer, J Michel, Foundations of Garside theory, in progress

[17] P Dehornoy, L Paris, Gaussian groups and Garside groups, two generalisations of Artin groups, Proc. London Math. Soc. 79 (1999) 569

[18] E A El-Rifai, H R Morton, Algorithms for positive braids, Quart. J. Math. Oxford Ser. 45 (1994) 479

[19] D B A Epstein, J W Cannon, D F Holt, S V F Levy, M S Paterson, W P Thurston, Word processing in groups, Jones and Bartlett (1992)

[20] B Farb, D Margalit, A primer on mapping class groups, Princeton Math. Series 49, Princeton Univ. Press (2012)

[21] A Fathi, F Laudenbach, V Poenaru, Editors, Travaux de Thurston sur les surfaces, Astérisque 66–67, Soc. Math. France (1979) 284

[22] F A Garside, The braid group and other groups, Quart. J. Math. Oxford Ser. 20 (1969) 235

[23] V Gebhardt, A new approach to the conjugacy problem in Garside groups, J. Algebra 292 (2005) 282

[24] V Gebhardt, J González-Meneses, The cyclic sliding operation in Garside groups, Math. Z. 265 (2010) 85

[25] V Gebhardt, J González-Meneses, Solving the conjugacy problem in Garside groups by cyclic sliding, J. Symbolic Comput. 45 (2010) 629

[26] J González-Meneses, On reduction curves and Garside properties of braids, from: "Topology of algebraic varieties and singularities" (editors J I Cogolludo-Agustín, E Hironaka), Contemp. Math. 538, Amer. Math. Soc. (2011) 227

[27] J González-Meneses, B Wiest, Reducible braids and Garside theory, Algebr. Geom. Topol. 11 (2011) 2971

[28] E K Lee, S J Lee, A Garside-theoretic approach to the reducibility problem in braid groups, J. Algebra 320 (2008) 783

[29] H A Masur, Y N Minsky, Geometry of the complex of curves, II: Hierarchical structure, Geom. Funct. Anal. 10 (2000) 902

[30] M Prasolov, Small braids with large ultra summit set, Mat. Zametki 89 (2011) 577

[31] J Tao, Linearly bounded conjugator property for mapping class groups, Geom. Funct. Anal. 23 (2013) 415

Cité par Sources :

Parcourir par

Geodesic

Parcourir par