Brady, Thomas; McCammond, Jonathan P. Three-generator Artin groups of large type are biautomatic. (English) Zbl 1004.20023 J. Pure Appl. Algebra 151, No. 1, 1-9 (2000). Summary: We construct a piecewise Euclidean, non-positively curved 2-complex for the 3-generator Artin groups of large type. As a consequence we show that these groups are biautomatic. A slight modification of the proof shows that many other Artin groups are also biautomatic. The general question (whether all Artin groups are biautomatic) remains open. Cited in 14 Documents MSC: 20F36 Braid groups; Artin groups 20F67 Hyperbolic groups and nonpositively curved groups 57M07 Topological methods in group theory 57M20 Two-dimensional complexes (manifolds) (MSC2010) Keywords:Artin groups; biautomatic groups PDF BibTeX XML Cite \textit{T. Brady} and \textit{J. P. McCammond}, J. Pure Appl. Algebra 151, No. 1, 1--9 (2000; Zbl 1004.20023) Full Text: DOI References: [1] W. Ballmann, Singular spaces of non-positive curvature, Sur les groupes hyperboliques d’apres Mikhael Gromov, in: E. Ghys, P. de la Harpe (Eds.), Progress in Mathematics, Vol. 83, Birkhauser, Boston, 1990. [2] Charney, R., Artin groups of finite type are biautomatic, Math. ann., 292, 671-683, (1992) · Zbl 0736.57001 [3] Gersten, S.M.; Short, H., Small cancellation theory and automatic groups, Invent. math., 102, 305-334, (1990) · Zbl 0714.20016 [4] Gersten, S.M.; Short, H., Small cancellation theory and automatic groups: part II, Invent. math., 105, 641-662, (1991) · Zbl 0734.20014 [5] Peifer, D., Artin groups of extra large type are biautomatic, J. pure appl. algebra, 110, 15-56, (1996) · Zbl 0872.20036 [6] Pride, S., On Tit’s conjecture and other questions concerning Artin and generalized Artin groups, Invent. math., 86, 347-356, (1986) · Zbl 0633.20021 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.