Gröbner basis project
Codebase for research into Gröbner basis computation
|
#include <dynamic_engine.hpp>
Public Member Functions | |
Construction | |
PPWithIdeal (Monomial u, const list< Monomial > &F, ::ray &w, const list< Critical_Pair_Dynamic *> &P, const Dense_Univariate_Integer_Polynomial *h=nullptr) | |
Construct a monomial/ideal pair. More... | |
PPWithIdeal (const PPWithIdeal &PI) | |
copy constructor | |
Destruction | |
~PPWithIdeal () | |
does nothing the default wouldn't do | |
Basic properties | |
const Monomial & | getPP () const |
the leading monomial being added to the ideal | |
const Monomial_Ideal & | getIdeal () const |
the old ideal of leading monomials | |
inline ::ray | getOrdering () |
the current monomial ordering | |
Dense_Univariate_Integer_Polynomial * | getHilbertNumerator (bool graded=false) |
the Hilbert numerator obtained by adding the monomial to the ideal (numerator is not reduced) | |
Dense_Univariate_Integer_Polynomial * | getHilbertReducedNumerator (bool graded=false) |
the Hilbert numerator obtained by adding the monomial to the ideal (numerator is reduced) | |
Dense_Univariate_Rational_Polynomial * | getHilbertPolynomial () |
the Hilbert polynomial obtained by adding the monomial to the ideal | |
int | howManyNewPairs () const |
estimate of the number of new critical pairs generated by adding the monomial to the ideal | |
int | degOfNewPairs () const |
the degree of the new critical pairs generated by adding the monomial to the ideal | |
int | getDifferenceInDegree () |
computes the difference in degree between the first and last monomials of the ideal | |
Modification | |
void | computeNumberNewPairs () |
Computes the number of critical pairs the monomial would add. | |
Protected Attributes | |
Monomial_Ideal | I |
the ideal of leading terms | |
int | max_deg |
minimum weighted degree of monomials in ideal | |
int | min_deg |
minimum weighted degree of monomials in ideal | |
int | num_new_pairs |
estimate of number of new pairs | |
::ray | ordering |
the current ordering of the Gröbner basis computation | |
const list< Critical_Pair_Dynamic * > & | pairs |
the list of critical pairs of \(I\) at this point in the algorithm | |
Monomial | t |
a monomial that may be added to the ideal \(I\) | |
Definition at line 70 of file dynamic_engine.hpp.
|
inline |
Construct a monomial/ideal pair.
u | proposed new Monomial for ideal |
F | current ideal |
w | current monomial ordering |
P | current list of critical pairs |
h | unreduced Hilbert numerator of F (does not verify correctness) |
Definition at line 82 of file dynamic_engine.hpp.