atlas Library · Script File
elliptic.at
The purpose of this file is listing conjugacy classes of elliptic elements of the Weyl group for arbitrary root data (the main application will be to standard Levi subsystems, which can have any type). We shall proceed by reduction to the simple case, whence we start by handling simple root data. Elliptic Weyl group elements are those whose reflection action does not have any eigenvalue 1; what actually matters here is "relatively elliptic" elements, which have no eigenvalue 1 for the restriction to the span of the roots (so any nontrivial central torus, which prevents any elements from being elliptic, is ignored). Every Weyl group element is relatively elliptic for a Levi subgroup (not necessarily standard) and hence conjugate to an element relatively elliptic for a standard Levi subgroup; this serves in conjugacy_classes.at as basis for the generation of representatives of all conjugacy classes of Weyl group elements. Our generation is based on a reduction to the simple case (and reconstruction from elements for the simple factors); then case by case according to type. Elliptic conjugacy classes in classical groups. This is based on an explicit construction, for each type (B and C are equal). Implementation will be done below inside the function |elliptic_simple|, so there is no code here. In type $A_n$ there is just the Coxeter element, with word |#n=[0,1,...,n-1]| (in the symmetric group, the conjugacy class of maximal length cycles). In type $B_n$, $C_n$, using realisation of $W$ as signed permutations of $n$, elliptic elements are products of cycles with on each cycle an odd number of sign changes. To generate the classes, we find the partitions of $n$ (from combinatorics.at), for each partition make a corresponding product of cycles (one for each part), each composed with a sign flip on the final element (which flip is obtained by conjugation from the final simple reflection). For type $D_n$ we follow the same idea, but it is complicated by the fact that sign flips come in pairs, so we can only use partitions with an even number of parts, and double sign flips must be conjugated from the product of the two final simple reflections (those on the teeth of the forked $D_n$ diagram). Elliptic conjugacy classes in exceptional types. We simply tabulate here.
Definitions in source order
G2_elliptic_words
L46
! G2_elliptic_words = [[int]]F4_elliptic_words
L47
! F4_elliptic_words = [[int]]E6_elliptic_words
L58
! E6_elliptic_words = [[int]]E7_elliptic_words
L65
! E7_elliptic_words = [[int]]E8_elliptic_words
L80
! E8_elliptic_words = [[int]]exceptional_elliptic_char_polys
L128
!exceptional_elliptic_char_polys = [[vec]]exceptional_elliptic_conjugacy_class_orders
L137
!exceptional_elliptic_conjugacy_class_orders = [[int]]elliptic_simple
L149
elliptic_simple = (string,int->[[int]])Weyl words (since we have no root datum here) for elliptic classes in Weyl group of a simple Lie type, using usual (Bourbaki) numbering of generators
combine_W_lists
L203
combine_W_lists ([[WeylElt]] lists) = [WeylElt]Form "Cartesian product" of non-empty sequence of lists of elements of W: multiply together one element chosen from each list, in all possible ways The sequence must be non-empty, since we cannot take identity in unknown |W|.
elliptic_conjugacy_class_reps
L210
elliptic_conjugacy_class_reps (RootDatum rd) = [WeylElt]elliptics_for_standard_Levi
L229
elliptics_for_standard_Levi (RootDatum rd, [int] subset) = [WeylElt]Our main application is enumerating elliptic elements for standard Levi subsystems. We make an adapted version of the previous function which on the fly also ensures embedding into the full (non Levi) Weyl group
order_of_centralizer_elliptic_BCD
L258
order_of_centralizer_elliptic_BCD (WeylElt w) = intOrder of an elliptic element of a Weyl group of type B, C, or D. We determine the signed cycle type of the signed permutation given by |w|; as |w| is assumed to be elliptic, all cycles must carry a minus sign (|true|). Then the centraliser in the full signed permutation group is the semidirect product of the product of cyclic groups generated by individual (negative) cycles (of order twice the cycle length) by the group permuting any cycles of the same lengths among each other (the normal factor, a product of symmetric groups). In type D this centraliser contains in particular any one (negative signed) cycle which is in the complement of the type D Weyl group, so for the centraliser in W this case requires one less factor 2. This argument also shows that in the $D_n$ case any conjugacy class in the full group of an elliptic element of $W$ remains a conjugacy class for $W$ (does not split).
exceptional_elliptic_class_order
L266
exceptional_elliptic_class_order (string type, int rank, vec chi) = intexceptional_elliptic_centr_order
L276
exceptional_elliptic_centr_order (string type, int rank, vec chi) = intGenerated from atlas-scripts at commit 648506c (2026-10-13).