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