Our first example is a problem of Trinks'. We compute a total degree Groebner basis without specifying an order. Groebner[Basis] calls SuggestVariableOrder automatically.
>
|
|
>
|
|
| (1) |
Next we compare lexicographic bases for the order suggested, its reverse, and a random permutation of .
>
|
|
>
|
|
>
|
|
| (4) |
>
|
|
>
|
|
>
|
|
| (7) |
>
|
|
>
|
|
>
|
|
| (10) |