20 #include "system_constants.hpp" 22 #include "monomial.hpp" 23 #include "polynomial.hpp" 24 #include "algorithm_buchberger_basic.hpp" 25 #include "algorithm_buchberger_dynamic.hpp" 29 string X [9] = {
"t",
"x",
"y",
"z",
"a",
"b",
"c",
"d",
"e"} ;
34 Monomial t11 { 0, 32, 0, 32, 0, 0, 0, 0, 0 };
35 Monomial t12 { 0, 0, 82, 0, 1, 0, 0, 0, 0 };
41 Monomial t21 { 0, 45, 0, 0, 0, 0, 0, 0, 0 };
42 Monomial t22 { 0, 0, 13, 21, 0, 1, 0, 0, 0 };
48 Monomial t31 { 0, 41, 0, 0, 0, 0, 1, 0, 0 };
49 Monomial t32 { 0, 0, 33, 12, 0, 0, 0, 0, 0 };
55 Monomial t41 { 0, 22, 0, 0, 0, 0, 0, 0, 0 };
56 Monomial t42 { 0, 0, 33, 12, 0, 0, 0, 1, 0 };
62 Monomial t51 { 0, 5, 17, 22, 0, 0, 0, 0, 1 };
63 Monomial t52 { 0, 0, 0, 0, 0, 0, 0, 0, 0 };
69 Monomial t61 { 1, 1, 1, 1, 0, 0, 0, 0, 0 };
70 Monomial t62 { 0, 0, 0, 0, 0, 0, 0, 0, 0 };
76 cout <<
"Trying an initial analysis on" 85 list<Abstract_Polynomial *> F;
86 F.push_back(&f1); F.push_back(&f2); F.push_back(&f3);
87 F.push_back(&f4); F.push_back(&f5); F.push_back(&f6);
90 initial_analysis(F, mord, skel);
91 cout <<
"Chose leading monomials:\n";
93 f->set_monomial_ordering(mord);
94 cout << f->leading_monomial() <<
", ";
A Constant_Polynomial is a polynomial that should not change.
Information necessary for a field modulo a prime.
Prime_Field_Element unity()
“unity” is the multiplicative identity.
skeleton of a polyhedral cone, with methods allowing definition and refinement
Implementation of monomials.
Element of a field of prime characteristic.
interface to a monomial ordering
Encapsulates information about a polynomial ring for easy access: ground field, number of indetermina...