Gröbner basis project
Codebase for research into Gröbner basis computation
test_user_interface.cpp

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:

  1. field characteristic (should be prime)
  2. number of indeterminates
  3. whether to specify the indeterminates’ names (y or n)
    1. If y, follow this with the list of names
  4. number of generators supplied
  5. the generators, one per line, specified in expanded format (no parentheses, grouping, etc.)
  6. dynamic (d) or static (s) algorithm; if dynamic, add in this order:
    1. which solver to use (skel, ppl, glpk)
    2. which heuristic to use (h for hilbert, c for minimal critical pairs, b for graded Betti)
    3. whether to perform a global analysis of the generators at the outset (y or n)