Skip to main content
Log in

Artin groups of finite type are biautomatic

  • Published:
Mathematische Annalen Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. Alonso, J., Bridson, M.: Semihyperbolic groups. (Preprint 1990)

  2. Brieskorn, E.: Singular elements of semi-simple algebraic groups. In: Actes Congrès Intern. Math. Nice, 1970, pp. 279–284, Paris: Gauthier-Villars 1971

    Google Scholar 

  3. Cannon, J.W., Epstein, D.B.A., Holt, D.F., Paterson, M.S., Thurston, W.P.: Word processing in group theory. (Preprint 1991)

  4. Deligne, P.: Les imeubles des groupes de tresses généralisés. Invent. Math.17, 273–302 (1972)

    Google Scholar 

  5. Garside, F.A.: The braid groups and other groups. Q. J. Math., Oxf. II. Ser.20, 235–254 (1969)

    Google Scholar 

  6. Gromov, M.: Hyperbolic groups. In: Gersten, S.M. (ed.) Essays in group theory. (Publ., Math. Sci. Res. Inst., vol. 8) Berlin Heidelberg New York: Springer 1987

    Google Scholar 

  7. Ghys, E., delaHarpe, P. (eds.). Sur les group hyperboliques d'après Mikhael Gromov. (Prog. Math., vol. 83), Boston Basel Stuttgart Birkhäuser 1990

    Google Scholar 

  8. Gersten, S., Short, H.: Small cancellation theory and automatic groups: part II. Invent. Math. (to appear)

  9. Moussong, G.: Hyperbolic Coxeter groups. Thesis, Ohio State University, 1988

  10. Tatsuoka, K.: An isoperimetric inequality for Artin groups of finite type. (Preprint 1991)

  11. Vinberg, E.B.: Discrete linear groups generated by reflections. Math. USSR, Izv.5, 1083–1119 (1971)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Partially supported by NSF grant DMS-8905378

Rights and permissions

Reprints and permissions

About this article

Cite this article

Charney, R. Artin groups of finite type are biautomatic. Math. Ann. 292, 671–683 (1992). https://doi.org/10.1007/BF01444642

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01444642

Keywords

Navigation