On Coxeter diagrams of complex reflection groups.

From MaRDI portal




Abstract: We study Coxeter diagrams of some unitary reflection groups. Using solely the combinatorics of diagrams, we give a new proof of the classification of root lattices defined over : there are only four such lattices, namely, the cE-lattices whose real forms are A2, D4, E6 and E8. Next, we address the issue of characterizing the diagrams for unitary reflection groups, a question that was raised by Brou'{e}, Malle and Rouquier. To this end, we describe an algorithm which, given a unitary reflection group G, picks out a set of complex reflections. The algorithm is based on an analogy with Weyl groups. If G is a Weyl group, the algorithm immediately yields a set of simple roots. Experimentally we observe that if G is primitive and G has a set of roots whose --span is a discrete subset of the ambient vector space, then the algorithm selects a minimal generating set for G. The group G has a presentation on these generators such that if we forget that the generators have finite order then we get a (Coxeter-like) presentation of the corresponding braid group. For some groups, such as G33 and G34, new diagrams are obtained. For G34, our new diagram extends to an "affine diagram" with symmetry.









This page was built for publication: On Coxeter diagrams of complex reflection groups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2841375)