Coxeter group
A group with a distinguished system of generators admitting a system of defining relations
where (so that for any ) and (for ) is an integer or equal to (in the latter case there is no relation between and ). Under these conditions is the same as the order of the element . If , then and commute. The matrix is called the Coxeter matrix of the given Coxeter group. The matrix (and therefore the group) can be given by means of the Coxeter graph, which is the graph with vertices () in which and are joined by an fold edge if (in particular, they are not joined if ), and are joined by a thick edge if . In an alternative notation, the vertices and of the Coxeter graph are joined by a simple edge with label .
Examples.
1) Every group generated by two elements of order is a Coxeter group with graph
Figure: c026980a
where is the half the order of the group.
2) The symmetric group is a Coxeter group with respect to the generators , ; its Coxeter graph has the form
Figure: c026980b
3) The group is a Coxeter group with respect to the generators
its graph has the form
Figure: c026980c
The group contains the subgroup of index , isomorphic to the modular Kleinian group.
The notion of a Coxeter group arose in the theory of discrete groups generated by hyperplane reflections (see Reflection group).
Every reflection group is a Coxeter group, if one takes as generators the reflections in the hyperplanes that bound its fundamental polyhedron. Included among the reflection groups are the Weyl groups (ordinary and affine) of semisimple Lie groups (cf. Weyl group).
In 1934 H.S.M. Coxeter [1] enumerated all the reflection groups in an dimensional Euclidean space and proved that they are all Coxeter groups, as they are now called. In his next paper [2], he proved that every finite Coxeter group is isomorphic to some reflection group in whose elements have a common fixed point, and so obtained a classification of the finite Coxeter groups (see Table 1).' <tbody> </tbody>

<tbody> </tbody>

The affine Coxeter groups have been enumerated by Coxeter (see Table. 2); they arise in the theory of semisimple Lie groups as affine Weyl groups.
A Coxeter group with generators is a twodimensional hyperbolic Coxeter group if and only if, under a suitable numbering of the generators,
and when . With regard to dimensional hyperbolic Coxeter groups with , a complete enumeration of them is not considered possible, although definite success has been achieved in the study of the more important classes of such groups (see Reflection group).
The finite, affine and hyperbolic Coxeter groups and the direct products of these constitute only a small fraction of the Coxeter groups. An arbitrary Coxeter group with a finite number of generators admits a finitedimensional real linear representation, as was shown explicitly by Coxeter [2], under which the generators are mapped onto linear reflections. It has been proved [4] that this representation is faithful, which implies, in particular, the solution of the word problem in Coxeter groups [5].
Parabolic subgroups of a Coxeter group.
Let be a Coxeter group with system of generators . For any subset , the subgroup generated by the set is a Coxeter group, where when . A subgroup of this form is called parabolic.
A Coxeter group is called indecomposable if it is not a direct product of two nontrivial standard subgroups; this is equivalent to the connectedness of its Coxeter graph. All finite (or affine) Coxeter groups are direct products of indecomposable Coxeter groups of the same type; all hyperbolic Coxeter groups are indecomposable. An indecomposable Coxeter group is finite (respectively, affine, hyperbolic) if and only if the symmetric matrix is positive definite (respectively, positive semidefinite, has rank at least and has negative index ).
In the theory of finite Coxeter groups, an important role is played by their socalled exponents (see Table 1); these are one less than the degrees of the generating invariants of the corresponding reflection group. One can express in terms of exponents the order of the group, the number of reflections (elements conjugate to the generators), etc., see Reflection group.
The product of all the generators of a finite Coxeter group, up to conjugacy, does not depend on the order of multiplication and is called the Killing–Coxeter element or Coxeter element [3].
References
[1]  H.S.M. Coxeter, "Discrete groups generated by reflections" Ann. of Math. , 35 (1934) pp. 588–621 
[2]  H.S.M. Coxeter, "The complete enumeration of finite groups of the form " J. London Math. Soc. , 10 (1935) pp. 21–25 
[3]  H.S.M. Coxeter, "The product of generators of a finite group generated by reflections" Duke Math. J. , 18 (1951) pp. 765–782 
[4]  N. Bourbaki, "Elements of mathematics. Lie groups and Lie algebras" , AddisonWesley (1975) (Translated from French) 
[5]  J. Tits, "Le problème des mots dans les groupes de Coxeter" , Symp. Math. , 1 , Acad. Press (1969) pp. 175–185 
Comments
The diagrams occurring in Tables 1 and 2 in the Western literature are usually called Dynkin diagrams, particularly in the context of the corresponding simple finitedimensional Lie algebras and the corresponding affine Kac–Moody algebras (Kac–Moody Lie algebras), cf., e.g., [4].
Coxeter group. E.B. Vinberg (originator), Encyclopedia of Mathematics. URL: http://www.encyclopediaofmath.org/index.php?title=Coxeter_group&oldid=15082