Gröbner basis project
Codebase for research into Gröbner basis computation
|
contains information on critical pairs by their index in the basis, in addition to the usual information More...
Public Member Functions | |
Construction | |
Critical_Pair_XPlor (int i, unsigned strategy, Abstract_Polynomial *f) | |
create critical pair (f,0) where f is at index i | |
Critical_Pair_XPlor (int i, int j, unsigned strategy, vector< Abstract_Polynomial *>G) | |
create critical pair (f,g) where f, g are at indices i , j | |
Critical_Pair_XPlor (int i, Abstract_Polynomial *g, unsigned strategy, vector< Abstract_Polynomial *>G) | |
create critical pair (f,g) where f is at index i | |
Critical_Pair_XPlor (int i, unsigned strategy, Abstract_Polynomial *f) | |
create critical pair (f,0) where f is at index i | |
Critical_Pair_XPlor (int i, int j, unsigned strategy, vector< Abstract_Polynomial *>G) | |
create critical pair (f,g) where f, g are at indices i , j | |
Critical_Pair_XPlor (int i, Abstract_Polynomial *g, unsigned strategy, vector< Abstract_Polynomial *>G) | |
create critical pair (f,g) where f is at index i | |
Critical_Pair_XPlor (int i, unsigned strategy, Abstract_Polynomial *f) | |
create critical pair (f,0) where f is at index i | |
Critical_Pair_XPlor (int i, int j, unsigned strategy, vector< Abstract_Polynomial *>G) | |
create critical pair (f,g) where f, g are at indices i , j | |
Critical_Pair_XPlor (int i, Abstract_Polynomial *g, unsigned strategy, vector< Abstract_Polynomial *>G) | |
create critical pair (f,g) where f is at index i | |
Critical_Pair_XPlor (int i, unsigned strategy, Abstract_Polynomial *f) | |
create critical pair (f,0) where f is at index i | |
Critical_Pair_XPlor (int i, int j, unsigned strategy, vector< Abstract_Polynomial *>G) | |
create critical pair (f,g) where f, g are at indices i , j | |
Critical_Pair_XPlor (int i, Abstract_Polynomial *g, unsigned strategy, vector< Abstract_Polynomial *>G) | |
create critical pair (f,g) where f is at index i | |
Basic properties | |
int | first_index () |
returns index of first polynomial in pair | |
int | second_index () |
returns index of second polynomial in pair | |
DEG_TYPE | sugar () |
returns sugar of this pair; use ONLY if with sugar strategy | |
int | first_index () |
returns index of first polynomial in pair | |
int | second_index () |
returns index of second polynomial in pair | |
DEG_TYPE | sugar () |
returns sugar of this pair; use ONLY if with sugar strategy | |
int | first_index () |
returns index of first polynomial in pair | |
int | second_index () |
returns index of second polynomial in pair | |
DEG_TYPE | sugar () |
returns sugar of this pair; use ONLY if with sugar strategy | |
int | first_index () |
returns index of first polynomial in pair | |
int | second_index () |
returns index of second polynomial in pair | |
DEG_TYPE | sugar () |
returns sugar of this pair; use ONLY if with sugar strategy | |
Multiprocessing data | |
void | set_processor (int i) |
record that this pair is assigned to processor i | |
int | get_processor () |
query whether this pair is assigned to a processor, and which (nonnegative value indicates assignment, and to which) | |
void | set_processor (int i) |
record that this pair is assigned to processor i | |
int | get_processor () |
query whether this pair is assigned to a processor, and which (nonnegative value indicates assignment, and to which) | |
void | set_processor (int i) |
record that this pair is assigned to processor i | |
int | get_processor () |
query whether this pair is assigned to a processor, and which (nonnegative value indicates assignment, and to which) | |
void | set_processor (int i) |
record that this pair is assigned to processor i | |
int | get_processor () |
query whether this pair is assigned to a processor, and which (nonnegative value indicates assignment, and to which) | |
![]() | |
Critical_Pair_Basic (Abstract_Polynomial *f, unsigned strategy) | |
create critical pair (f,0) for initial polynomial | |
Critical_Pair_Basic (Abstract_Polynomial *f, Abstract_Polynomial *g, unsigned strategy) | |
create critical pair (f,g) for two polynomials | |
virtual | ~Critical_Pair_Basic () |
bool | is_generator () const |
whether this pair is from a generator | |
const Abstract_Polynomial * | first () const |
first polynomial in pair | |
const Abstract_Polynomial * | second () const |
second polynomial in pair | |
const Monomial & | lcm () const |
lcm of leading monomials of polynomials | |
unsigned | lcm_degree (unsigned i) const |
degree of ith variable in lcm | |
const Monomial & | first_multiplier () const |
monomial needed to multiply first polynomial to lcm() | |
const Monomial & | second_multiplier () const |
monomial needed to multiply second polynomial to lcm() | |
const Pair_Strategy_Data * | pair_key () const |
strategy used for comparison of pairs | |
virtual Mutable_Polynomial * | s_polynomial () |
to use only if s-polynomial is already computed by another method More... | |
virtual Mutable_Polynomial * | s_polynomial (SPolyCreationFlags method, int strategy) |
creates the s-polynomial for first() and second() | |
virtual void | set_spoly (Mutable_Polynomial *p) |
sets the s-polynomial to p , for explorer methods | |
Protected Attributes | |
int | pi |
first polynomial in the critical pair | |
int | proc |
processor to which this pair has been assigned | |
int | qi |
second polynomial in the critical pair | |
![]() | |
Pair_Strategy_Data * | key = nullptr |
strategy used to sort critical pairs | |
Abstract_Polynomial * | p |
first polynomial in the critical pair | |
Abstract_Polynomial * | q |
second polynomial in the critical pair | |
Mutable_Polynomial * | s |
S-polynomial. | |
Monomial | tp |
monomial multiple of \(p\) that produces \(S\)-polynomial | |
Monomial | tpq |
lcm of leading monomials of \(p\) and \(q\) | |
Monomial | tq |
monomial multiple of \(q\) that produces \(S\)-polynomial | |
contains information on critical pairs by their index in the basis, in addition to the usual information
Definition at line 29 of file algorithm_buchberger_explorer.cpp.