CoxeterElementsLength( W, l )
returns as a list of permutations the list of all elements of W of length l.
gap> W := CoxeterGroup( "G", 2 );; gap> e := CoxeterElementsLength( W, 6 ); [ ( 1, 7)( 2, 8)( 3, 9)( 4,10)( 5,11)( 6,12) ] gap> e = LongestCoxeterElement( W ); true
The result of the computation of elements of a given length is stored in
elts of the record of W. Thus
the list of all elements of length lw in W. There are a number of
Kazhdan-Lusztig polynomials and bases) which refer to the ordering of the elements in these lists in
This function requires the package "chevie" (see RequirePackage).
Previous Up Top Next