This method suggests a good variable ordering. The ordering is chosen by finding a good chordal completion of its constraint graph.
i1 : G = cartesianProduct(cycleGraph 3, pathGraph 3); |
i2 : I = edgeIdeal G
o2 = monomialIdeal (x x , x x , x x , x x , x x , x x , x x , x x , x x , x x , x x , x x , x x , x x , x x )
1 2 1 3 1 4 3 4 2 5 2 6 3 6 2 7 4 7 6 7 5 8 6 8 5 9 7 9 8 9
o2 : MonomialIdeal of QQ[x ..x ]
1 9
|
i3 : X = suggestVariableOrder I
o3 = {x , x , x , x , x , x , x , x , x }
1 3 4 2 6 5 7 8 9
o3 : List
|
The object suggestVariableOrder is a method function.