71.52 ETopLadder

ETopLadder(H|e, mu)

The ladders in the diagram of a partition are the lines connecting nodes of constant e--residue, having slope <e>-1 (see [JK]). A new partition can be obtained from mu by sliding all nodes up to the highest possible rungs on their ladders. ETopLadder(e, mu) returns the partition obtained in this way; it is automatically e--regular (this partition is denoted mu^R in [JK]).

gap> H:=Specht(4);;
gap> ETopLadder(H,1,1,1,1,1,1,1,1,1,1);
[ 4, 3, 3 ]
gap> ETopLadder(6,1,1,1,1,1,1,1,1,1,1); 
[ 2, 2, 2, 2, 2 ]

This function requires the package ``specht'' (see RequirePackage).

Previous Up Top Next
Index