\[ 31838 B + 45 P + 35 S + 31967 ,\\ 35 P + 31976 S + 25 T + 40 Z ,\\ 31838 B^2 + 25 P S + 31985 T + 15 W + 30 Z ,\\ 15 P T + 20 S Z + 31994 W ,\\ 31992 B^3 + P W + 2 T Z ,\\ 3 B^2 + 31992 B S + 99 W \]
#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 [6] = {"B", "P", "S", "T", "W", "Z"} ;
DEG_TYPE e0 [] { 0, 0, 0, 0, 0, 0 };
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";
}