1#
2# It contains the order relation on the left cells, inherited from the
3# preorder relation <=_L on the group. What we output is the hasse diagram
4# of this ordering (or rather of the dual ordering) : for each cell, we
5# print the list of cells that lie immediately above it (recall that {e} is
6# the *largest* element in the left cell ordering.) As always, cells are
7# represented by their index number in the list which is output by lcells;
8# in this file, we produce the abstract ordering on the integers {0, ..., N-1},
9# where N is the number of left cells.
10#
11# Note that the enumeration ordering we use on cells is not compatible with
12# the (reversed) left cell ordering, in the sense that edges in our hasse
13# diagram do not always go to elements with a smaller index. It would be
14# possible to re-sort the cells so that this would be true, but we have
15# refrained from doing that for the sake of consistency.
16#
17# We output one edge-list per line, as a comma-separated list; the first line
18# is an empty list, as it should be!
19#
20