The functions in this chapter handle basic descriptions of Coxeter systems. A Coxeter system is a group G with finite generating set S={s1, ..., sn}, defined by relations si2=1 for i=1, ..., n and
sisjsi ... = sjsisj ... for i, j=1, ..., n with i<j, where each side of this relation has length mij≥2. Traditionally, mij=∞ signifies that the corresponding relation is omitted but for technical reasons mij=0 is used in Magma instead. The group G is called a Coxeter group and S is called the set of Coxeter generators. Since every group in Magma has a preferred generating set, no distinction is made between a Coxeter system and its Coxeter group. See [Bou68] for more details on the theory of Coxeter groups.
The rank of the Coxeter system is n=|S|. A Coxeter system is said to be reducible if there is a proper subset I of {1, ..., n} such that mij=2 or mji=2 whenever i∈I and j∉I. In this case, G is an (internal) direct product of the Coxeter subgroups WI=< si | i ∈I > and WIc=< si | i ∉I >. Note that an irreducible Coxeter group may still be a nontrivial direct product of abstract subgroups (for example, W(G2) isomorphic to S2 x S3). Two Coxeter systems are Coxeter isomorphic (or graph isomorphic) if there is a group isomorphism between them which takes Coxeter generators to Coxeter generators. In other words, the two groups are the same modulo renumbering of the generators.
Coxeter groups and their representations as reflection groups have a number of useful descriptions. In this chapter, Coxeter matrices, Coxeter graphs, Cartan matrices, and Dynkin digraphs will be discussed. The classification of finite and affine Coxeter groups provides a naming system for these groups. In Chapters ROOT SYSTEMS and ROOT DATA, finite root systems and root data, which provide a more detailed description of finite Coxeter groups, are discussed. Coxeter groups themselves are discussed in Chapter COXETER GROUPS; reflection representations of Coxeter groups are discussed in Chapter REFLECTION GROUPS.