1 (( Leiden University (c) 2002
3 < i1 i2 i3 i4 i5 i6 i7 i8 i9 i10><>< C>< j1 j2 BigPar>
9 ---- lexicoGraphicalOrdering ----
13 #[ 0 1 2 4 8 16 32 64 128 256 574 0 3 -511]
14 #[ 0 -1 -2 -4 -8 -16 -32 -64 -128 -256 -574 0 -3 511]
15 #[ 1 0 0 0 0 0 0 0 0 0 0 1 0 -1]
16 #[ -1 0 0 0 0 0 0 0 0 0 0 -1 0 1]
17 #[ 1 0 0 0 0 0 0 0 0 0 8 0 0 -1]
18 #[ -1 0 0 0 0 0 0 0 0 0 -1 0 0 1]
19 #[ 0 1 0 0 0 0 0 0 0 0 2 0 0 -1]
20 #[ 0 -1 0 0 0 0 0 0 0 0 -1 0 0 1]
21 #[ 0 0 1 0 0 0 0 0 0 0 2 0 0 -1]
22 #[ 0 0 -1 0 0 0 0 0 0 0 -1 0 0 1]
23 #[ 0 0 0 1 0 0 0 0 0 0 2 0 0 -1]
24 #[ 0 0 0 -1 0 0 0 0 0 0 -1 0 0 1]
25 #[ 0 0 0 0 1 0 0 0 0 0 2 0 0 -1]
26 #[ 0 0 0 0 -1 0 0 0 0 0 -1 0 0 1]
27 #[ 0 0 0 0 0 1 0 0 0 0 2 0 0 -1]
28 #[ 0 0 0 0 0 -1 0 0 0 0 -1 0 0 1]
29 #[ 0 0 0 0 0 0 1 0 0 0 2 0 0 -1]
30 #[ 0 0 0 0 0 0 -1 0 0 0 -1 0 0 1]
31 #[ 0 0 0 0 0 0 0 1 0 0 2 0 0 -1]
32 #[ 0 0 0 0 0 0 0 -1 0 0 -1 0 0 1]
33 #[ 0 0 0 0 0 0 0 0 1 0 2 0 0 -1]
34 #[ 0 0 0 0 0 0 0 0 -1 0 -1 0 0 1]
35 #[ 0 0 0 0 0 0 0 0 0 1 2 0 0 -1]
36 #[ 0 0 0 0 0 0 0 0 0 -1 -1 0 0 1]