30 TEST(PrimaryDecom, Typical) {
39 TEST(PrimaryDecom, ZeroIdeal) {
40 for (
size_t varCount = 0; varCount <= 3; ++varCount) {
46 vector<BigIdeal> ideals;
52 TEST(PrimaryDecom, WholeRing) {
53 for (
size_t varCount = 0; varCount <= 3; ++varCount) {
TEST(PrimaryDecom, Typical)
Frobby::Ideal toLibIdeal(const BigIdeal &ideal)
Returns a library interface ideal that corresponds to the parameter ideal.
static BigIdeal xx_yy_xz_yz()
Returns .
static VarNames ring_xyzt()
Returns the ring in the four variables , , and .
static vector< BigIdeal > irrdecom_xx_yy_xz_yz()
Returns the irreducible decomposition of .
static BigIdeal zeroIdeal(size_t varCount)
Returns the ideal in the ring VarNames(varCount).
static BigIdeal wholeRing(size_t varCount)
Returns in the ring VarNames(varCount).
Records library interface output into a vector of BigIdeals.
const vector< BigIdeal > & getIdeals() const
Returns the recorded ideals in a canonical form.
Defines the variables of a polynomial ring and facilities IO involving them.
#define TEST_SUITE2(PARENT, SUITE)
void primaryDecomposition(const Ideal &ideal, IdealConsumer &consumer)
Compute the canonical primary decomposition of a monomial ideal.