Gröbner basis project
Codebase for research into Gröbner basis computation
|
This illustrates how to compute a Göbner basis of an arbitrary polynomial ideal (within the bounds this system can handle). The program is suitable for running stand-alone, as it prompts the user for all information, but it is probably better to pipe as input a file formatted similarly to the directory example_systems_for_user_interface. The basic format is:
y
or n
) y
, follow this with the list of names d
) or static (s
) algorithm; if dynamic, add in this order: skel
, ppl
, glpk
) h
for hilbert, c
for minimal critical pairs, b
for graded Betti) y
or n
)