|
Frobby 0.10.0
|
Represents a saturated binomial ideal. More...
#include <SatBinomIdeal.h>
Public Member Functions | |
| SatBinomIdeal (const VarNames &names) | |
| void | insert (const vector< mpz_class > &binom) |
| const vector< mpz_class > & | getGenerator (size_t index) const |
| size_t | getGeneratorCount () const |
| void | print (FILE *file) const |
| void | print (ostream &out) const |
| void | clearAndSetNames (const VarNames &names) |
| void | removeGeneratorsWithLeadingZero () |
| void | removeGeneratorsWithoutLeadingZero () |
| void | getInitialIdeal (BigIdeal &ideal) const |
| void | renameVars (const VarNames &names) |
| Requires that names.getVarCount() equals getVarCount(). | |
| size_t | getVarCount () const |
| void | clear () |
| void | reserve (size_t size) |
| vector< mpz_class > & | getLastBinomRef () |
| void | newLastTerm () |
| const VarNames & | getNames () const |
| bool | hasZeroEntry () const |
| bool | initialIdealIsWeaklyGeneric () const |
| Returns true if the initial ideal is weakly generic. | |
| bool | isGeneric () const |
| void | getDoubleTriangleCount (mpz_class &count) const |
| bool | isPointFreeBody (const vector< mpz_class > &a, const vector< mpz_class > &b) const |
| bool | isPointFreeBody (const vector< mpz_class > &a, const vector< mpz_class > &b, const vector< mpz_class > &c) const |
| bool | isInterior (const vector< mpz_class > &a, const vector< mpz_class > &b) const |
| bool | isInteriorEdge (size_t from, size_t to) const |
| bool | isTerminatingEdge (size_t from, size_t to) const |
| bool | validate () const |
| bool | isDominating (const vector< mpz_class > &v) const |
| bool | isGenerator (const vector< mpz_class > &v) const |
| Returns true if v is a generator. | |
| void | projectVar (size_t var) |
| SatBinomIdeal & | operator= (const SatBinomIdeal &ideal) |
| void | getMatrix (Matrix &matrix) const |
Represents a saturated binomial ideal.
| void SatBinomIdeal::getDoubleTriangleCount | ( | mpz_class & | count | ) | const |
Returns the number of pairs of generators a and b such that {0,a,a+b} and {0,b,a+b} are both interior point-free bodies.
| bool SatBinomIdeal::hasZeroEntry | ( | ) | const |
Returns true if any generator does not involve every variable, i.e. the vector representing the generator has a zero entry.
| bool SatBinomIdeal::isDominating | ( | const vector< mpz_class > & | v | ) | const |
Returns true if any generator, considered as an integer vector, is dominated by v.
| bool SatBinomIdeal::isGeneric | ( | ) | const |
Returns true if the generating set is generic, i.e. no generator has a zero entry.
This concept of genericity comes from Scarf's theory of maximal lattice-free bodies, and this link is preserved if the generating set is a graded reverse-lex toric Grobner basis of a primitive vector.
| bool SatBinomIdeal::isInterior | ( | const vector< mpz_class > & | a, |
| const vector< mpz_class > & | b ) const |
Returns true if max(0,a,b) is strictly positive in every element.
| bool SatBinomIdeal::isInteriorEdge | ( | size_t | from, |
| size_t | to ) const |
Returns whether {to,to+from} is an interior edge of Top.
| bool SatBinomIdeal::isPointFreeBody | ( | const vector< mpz_class > & | a, |
| const vector< mpz_class > & | b ) const |
Returns true if the smallest body containing zero, a and b has no generator in its interior.
| bool SatBinomIdeal::isPointFreeBody | ( | const vector< mpz_class > & | a, |
| const vector< mpz_class > & | b, | ||
| const vector< mpz_class > & | c ) const |
Returns true if the smallest body containing zero, a, b and c has no generator in its interior.
| bool SatBinomIdeal::isTerminatingEdge | ( | size_t | from, |
| size_t | to ) const |
Returns wehther {from,to+from} is an interior edge of Top and also {to,to+from} is an edge of Top (not necessarily interior).
| bool SatBinomIdeal::validate | ( | ) | const |
Temporary. Returns whether the graph satisfies some conditions that it should if some hypotheses are correct.