The word problem for Artin groups of FC type

Journal of Pure and Applied Algebra

Volumn 129, Issue 1, 1998, Pages 1-22

  Altobelli, Joseph A ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032551490     PISSN: 00224049     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-4049(97)00047-9     Document Type: Article

References (17)

1. [1] E. Artin, Theorie der Zöpfe, Abhandlungen aus dem Mathematischen Seminar der Hamburggischen Universität 4 (1926) 47-72.
2. [2] G. Baumslag, S.M. Gersten, M. Shapiro, H. Short, Automatic groups and amalgams, J. Pure Appl. Algebra 76 (1991) 229-316.
3. [3] K.S. Brown, Buildings, Springer, New York, 1989.
4. [4] R. Charney, Artin groups of finite type are biautomatic, Math. Ann. 292 (1992) 671-683.
5. [5] R. Charney, Geodesic automation and growth functions for Artin groups of finite type, Math. Ann. 301 (1995) 307-324.
6. [6] R. Charney, M.W. Davis, The K(π, 1)-problem for hyperplane complements associated to infinite reflection groups, J. Amer. Math. Soc. 8(3) (1995) 597-627.
7. [7] A. Chermak, Locally non-spherical Artin groups, preprint.
8. [8] P. Deligne, Les immeubles des groupes de tresses généralises, Invent. Math. 17 (1972) 273-302.
9. [9] 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, Boston, 1992.
10. [10] F.A. Garside, The braid group and other groups, Oxford Q. J. Math. 20 (1969) 235-254.
11. [11] S. Hermiller, J. Meier, Algorithms and geometry for graph products of groups, J. Algebra 171 (1995) 230-257.
12. [12] M. Paterson, A. Razborov, The set of minimal braids is Co-NP-complete, J. Algorithms 12 (1991) 393-408.
13. [13] D. Peifer, Artin groups of large type are automatic, preprint.
14. [14] D. Peifer, Artin groups of extra-large type are biautomatic, J. Pure Appl. Algebra 110 (1996) 15-56.
15. [15] J.P.. Serre, Trees, Springer, Berlin, 1980.
16. [16] H. van der Lek, The homotopy type of complex hyperplane complements, Ph.D. Thesis, University of Nijmegen, Nijmegen, 1983.
17. [17] L. Van Wyk, Graph groups are biautomatic, J. Pure Appl. Algebra 94 (1994) 341-352.