\[ u + v + y + 32002 ,\\ t + 2 u + z + -3 ,\\ t + 2 v + y + 32002 ,\\ 32002 t + 32002 u + 32002 v + x + 32002 y + 32002 z ,\\ t u x^2 + 26650 y z^3 ,\\ 28222 t y + v z \]
#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", "u", "v", "x", "y", "z" } ;
f2.sort_by_order();
Monomial M4 [] { t1, u1, v1, x1, y1, z1 };
f5.sort_by_order();
f6.sort_by_order();
cout << "Computing a Groebner basis for\n\t" << f1
<< ",\n\t" << f2
<< ",\n\t" << f3
<< ",\n\t" << f4
<< ",\n\t" << f5
<< ",\n\t" << f6
<< endl;
list<Abstract_Polynomial *> F;
F.push_back(&f1); F.push_back(&f2); F.push_back(&f3);
F.push_back(&f4); F.push_back(&f5); F.push_back(&f6);
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());
delete g;
}
cout << "bye\n";
}