Artin group

In mathematics, an Artin group (or generalized braid group) is a group with a presentation of the form

\Big\langle x_1,x_2,\ldots,x_n \Big| \langle x_1, x_2 \rangle^{m_{1,2}}=\langle x_2, x_1 \rangle^{m_{2,1}}, \ldots , \langle x_{n-1}, x_n \rangle^{m_{n-1,n}}=\langle x_{n}, x_{n-1} \rangle^{m_{n,n-1}} \Big\rangle

where

m_{i,j} = m_{j,i} \in \{2,3,\ldots, \infty\}

For $m < \infty$ , $\langle x_i, x_j \rangle^m$ denotes an alternating product of $x_i$ and $x_j$ of length $m$ , beginning with $x_i$ . For example,

\langle x_i, x_j \rangle^3 = x_ix_jx_i

and

\langle x_i, x_j \rangle^4 = x_ix_jx_ix_j

If $m=\infty$ , then there is (by convention) no relation for $x_i$ and $x_j$ .

The integers $m_{i,j}$ can be organized into a symmetric matrix, known as the Coxeter matrix of the group. Each Artin group has as a quotient the Coxeter group with the same set of generators and Coxeter matrix. The kernel of the homomorphism to the associated Coxeter group, known as the pure Artin group, is generated by relations of the form ${x_i}^2=1$ .

Classes of Artin groups

Braid groups are examples of Artin groups, with Coxeter matrix $m_{i,i+1} = 3$ and $m_{i,j}=2$ for $|i-j|>1.$ Several important classes of Artin groups can be defined in terms of the properties of the Coxeter matrix.

Artin groups of finite type

If M is a Coxeter matrix of finite type, so that the corresponding Coxeter group W = A(M) is finite, then the Artin group A = A(M) is called an Artin group of finite type. The 'irreducible types' are labeled as A_n , B_n = C_n , D_n , I₂(n) , F₄ , E₆ , E₇ , E₈ , H₃ , H₄ . A pure Artin group of finite type can be realized as the fundamental group of the complement of a finite hyperplane arrangement in Cⁿ. Pierre Deligne and Brieskorn-Saito have used this geometric description to compute the center of A, its cohomology, and to solve the word and conjugacy problems.

Right-angled Artin groups

If M is a matrix all of whose elements are equal to 2 or ∞, then the corresponding Artin group is called a right-angled Artin group, but also a (free) partially commutative group, graph group, trace group, semifree group or even locally free group. For this class of Artin groups, a different labeling scheme is commonly used. Any graph Γ on n vertices labeled 1, 2, …, n defines a matrix M, for which m_ij = 2 if i and j are connected by an edge in Γ, and m_ij = ∞ otherwise. The right-angled Artin group A(Γ) associated with the matrix M has n generators x₁, x₂, …, x_n and relations

x_i x_j = x_j x_i \quad

whenever i and j are connected by an edge in

\Gamma.

The class of right-angled Artin groups includes the free groups of finite rank, corresponding to a graph with no edges, and the finitely-generated free abelian groups, corresponding to a complete graph. In fact, every right-angled Artin group of rank r can be constructed as HNN extension of a right-angled Artin group of rank r-1, with the free product and direct product as the extreme cases. A generalization of this construction is called a graph product of groups. A right-angled Artin group is a special case of this product, with every vertex/operand of the graph-product being a free group of rank one (the infinite cyclic group).

Mladen Bestvina and Noel Brady constructed a nonpositively curved cubical complex K whose fundamental group is a given right-angled Artin group A(Γ). They applied Morse-theoretic arguments to their geometric description of Artin groups and exhibited first known examples of groups with the property (FP₂) that are not finitely presented.

Other Artin Groups

We define that an Artin group or a Coxeter group is of large type if m_{i j} ≥ 3 for all i ≠ j. We say that an Artin group or a Coxeter group is of extra-large type if m_{i j} ≥ 4 for all i ≠ j.

Kenneth Appel and P.E. Schupp looked further into Artin groups and the properties that hold true for them. They proved four theorems, which were known to be true for Coxeter groups, and showed that they also held for Artin groups. Appel and Schupp had discovered that they could study extra-large Artin and Coxeter groups through the techniques of small cancellation theory. They also discovered that they could use a "refinement" of these same techniques to work with these groups of large type.^[1]

Theorem 1 : Let G be an Artin or Coxeter group of extra-large type. If J ⊆ I then G_J has a presentation defined by the Coxeter matrix M_J and the generalized word problem for G_J in G is solvable. If J, K ⊆ I then G_J ∩ G_K = G_{(J ∩ K)}.

Theorem 2 : An Artin group of extra-large type is torsion-free.

Theorem 3 : Let G be an Artin group of extra-large type. Then the set {a_i² : i ∈ I} freely generates a free subgroup of G.

Theorem 4 : An Artin or Coxeter group of extra-large type has solvable conjugacy problem.

Notes

↑ Appel, Kenneth I.; Schupp, P. E. (1983), "Artin Groups and Infinite Coxeter Groups", Inventiones Mathematicae 72 (2): 201–220, doi:10.1007/BF01389320

References

Bestvina, Mladen; Brady, Noel (1997), "Morse theory and finiteness properties of groups", Invent. Math. 129 (3): 445–470, doi:10.1007/s002220050168
Deligne, Pierre (1972), "Les immeubles des groupes de tresses généralisés", Invent. Math. 17 (4): 273–302, doi:10.1007/BF01406235
Brieskorn, Egbert; Saito, Kyoji (1972), "Artin-Gruppen und Coxeter-Gruppen", Invent. Math. 17 (4): 245–271, doi:10.1007/bf01406235
Charney, Ruth (October 2006), An Introduction to Right-Angled Artin Groups (PDF), Department of Mathematics, Brandeis University
Casals-Ruiz, Montserrat; Kazachkov, Ilya (2009), On Systems of Equations over Free Partially Commutative Groups, arXiv:0810.4867
Esyp, E. S.; Kazachkov, I. V.; Remeslennikov, V. N. (2005), Divisibility Theory and Complexity of Algorithms in Free Partially Commutative Groups, arXiv:math/0512401
Hermiller, Susan; Meier, John, Algorithms and geometry for graph products of groups (PDF)

This article is issued from Wikipedia - version of the Sunday, January 31, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.