Gröbner basis project
Codebase for research into Gröbner basis computation
Utilities

Useful functions and classes that don't fit in easily elsewhere. More...

Functions

void divide_by_common_term (COEF_TYPE &, UCOEF_TYPE &)
 divides out the common term of the two given numbers More...
 
void user_interface ()
 reads ideal definition from cin, then reads options for computation, writes Gröbner basis to cout More...
 

Detailed Description

Useful functions and classes that don't fit in easily elsewhere.

Function Documentation

◆ divide_by_common_term()

void divide_by_common_term ( COEF_TYPE &  ,
UCOEF_TYPE &   
)

divides out the common term of the two given numbers

Author
John Perry
Date
2016

Useful for simplifying terms of Dense_Univariate_Rational_Polynomial. Uses the (simple) Euclidean Algorithm to determine the gcd.

◆ user_interface()

void user_interface ( )

reads ideal definition from cin, then reads options for computation, writes Gröbner basis to cout

Author
John Perry
Date
2017
Returns
0 if success, nonzero otherwise

The definition of the ideal should take place as follows, in this order. Bad Things Will HappenTM if you do not heed. The good news is that the program prompts the user.

  1. a prime number, which defines the base field
  2. the number of indeterminates
  3. whether to specify the indeterminates’ names
  4. if so, the indeterminates’ names
  5. the number of polynomials
  6. the definition of the polynomials (each terminated by a new line)
  7. static or dynamic computation
  8. if dynamic,
    1. which solver (LP_Solver)
    2. which heuristic (DynamicHeuristic)
    3. whether to perform a global analysis of the input The code has some other options, but they are mere curiosities for the time being.
Examples:
user_interface.cpp.

Definition at line 58 of file user_interface.cpp.