\[ t^4 z b + x^3 y a ,\\ t x^8 y z + 32002 a b^4 c d e ,\\ x y^2 z^2 d + z c^2 e^2 ,\\ t x^2 y^3 z^4 + a b^2 c^3 e^2 \]
#include <set>
#include <cstdlib>
#include <cstring>
#include <iostream>
using std::set;
using std::cout; using std::endl;
#include "system_constants.hpp"
#include "fields.hpp"
#include "monomial.hpp"
#include "polynomial.hpp"
#include "dynamic_engine.hpp"
#include "algorithm_buchberger_basic.hpp"
#include "algorithm_buchberger_dynamic.hpp"
int main(int argc, char *argv[]) {
if (argc != 3 or (strcmp(argv[2],"stat") and strcmp(argv[2],"dyn"))) {
cout << "need to know method (usually 2) and then if dynamic (stat or dyn)\n";
return 1;
}
bool static_algorithm = true;
if (!strcmp(argv[2],"dyn")) static_algorithm = false;
string X [9] = {"t", "x", "y", "z", "a", "b", "c", "d", "e"} ;
Monomial t11 { 4, 0, 0, 1, 0, 1, 0, 0, 0 };
Monomial t12 { 0, 3, 1, 0, 1, 0, 0, 0, 0 };
Monomial t21 { 1, 8, 1, 1, 0, 0, 0, 0, 0 };
Monomial t22 { 0, 0, 0, 0, 1, 4, 1, 1, 1 };
Monomial t31 { 0, 1, 2, 2, 0, 0, 0, 1, 0 };
Monomial t32 { 0, 0, 0, 1, 0, 0, 2, 0, 2 };
Monomial t41 { 1, 2, 3, 4, 0, 0, 0, 0, 0 };
Monomial t42 { 0, 0, 0, 0, 1, 2, 3, 0, 2 };
cout << "Computing a Groebner basis for\n\t" << f1
<< ",\n\t" << f2
<< ",\n\t" << f3
<< ",\n\t" << f4
<< endl;
list<Abstract_Polynomial *> F;
F.push_back(&f1); F.push_back(&f2); F.push_back(&f3); F.push_back(&f4);
list<Constant_Polynomial *> G;
if (static_algorithm) G =
buchberger(F, method, StrategyFlags::SUGAR_STRATEGY);
F, method, StrategyFlags::SUGAR_STRATEGY, nullptr,
DynamicHeuristic::ORD_HILBERT_THEN_DEG
);
cout << "Basis:\n";
cout << '\t';
g->leading_monomial().print(
true, cout, R.
name_list());
}
cout << "bye\n";
}