22 using std::cout;
using std::endl;
24 #include "algorithm_buchberger_basic.hpp" 26 #include "monomial.hpp" 27 #include "polynomial.hpp" 29 int main(
int argc,
char *argv[]) {
37 unsigned e1 [] {2,0};
Monomial t1(2, e1);
38 unsigned e2 [] {0,2};
Monomial t2(2, e2);
39 unsigned e3 [] {0,0};
Monomial t3(2, e3);
44 unsigned e4 [] {1,1};
Monomial t4(2, e4);
45 unsigned e5 [] {0,0};
Monomial t5(2, e5);
50 cout <<
"Computing a Groebner basis for " << f1 <<
", " << f2 << endl;
52 set<Abstract_Polynomial *> F;
53 F.insert(&f1); F.insert(&f2);
56 for (
auto g = G.begin(); g != G.end(); ++g)
57 cout <<
'\t' << *(*g) << endl;
A Constant_Polynomial is a polynomial that should not change.
list< Constant_Polynomial * > buchberger(const list< Abstract_Polynomial *> &F, SPolyCreationFlags method, StrategyFlags strategy, WT_TYPE *strategy_weights)
Implementation of Buchberger’s algorithm.
Information necessary for a field modulo a prime.
Prime_Field_Element unity()
“unity” is the multiplicative identity.
Implementation of monomials.
Element of a field of prime characteristic.