PolynomialFactory.cpp
Go to the documentation of this file.
/* Frobby: Software for monomial ideal computations.
Copyright (C) 2007 Bjarke Hammersholt Roune (www.broune.com)
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see http://www.gnu.org/licenses/.
*/
#include "stdinc.h"
#include "PolynomialFactory.h"
#include "IdealFactory.h"
BigPolynomial PolynomialFactory::hilbert_xx_yy_xz_yz() {
BigPolynomial poly(IdealFactory::ring_xyzt());
poly.add(-1, IdealFactory::makeTerm(2, 2, 1, 0));
poly.add(-1, IdealFactory::makeTerm(0, 1, 1, 0));
poly.add(-1, IdealFactory::makeTerm(0, 2, 0, 0));
poly.add(+1, IdealFactory::makeTerm(0, 2, 1, 0));
poly.add(-1, IdealFactory::makeTerm(2, 0, 0, 0));
poly.add(+1, IdealFactory::makeTerm(2, 0, 1, 0));
poly.add(-1, IdealFactory::makeTerm(1, 0, 1, 0));
poly.add(+1, IdealFactory::makeTerm(1, 1, 1, 0));
poly.add(+1, IdealFactory::makeTerm(0, 0, 0, 0));
poly.add(+1, IdealFactory::makeTerm(2, 2, 0, 0));
poly.sortTermsReverseLex();
return poly;
}
BigPolynomial PolynomialFactory::one_minus4tt_3ttt_tttt_minusttttt() {
VarNames names;
names.addVar("t");
BigPolynomial poly(names);
poly.add(+1, IdealFactory::makeTerm(0));
poly.add(-4, IdealFactory::makeTerm(2));
poly.add(+3, IdealFactory::makeTerm(3));
poly.add(+1, IdealFactory::makeTerm(4));
poly.add(-1, IdealFactory::makeTerm(5));
poly.sortTermsReverseLex();
return poly;
}
BigPolynomial PolynomialFactory::one(size_t varCount) {
BigPolynomial poly((VarNames(varCount)));
poly.add(1, vector<mpz_class>(varCount));
return poly;
}
BigPolynomial PolynomialFactory::one(const VarNames& names) {
BigPolynomial poly(names);
poly.add(1, vector<mpz_class>(names.getVarCount()));
return poly;
}
BigPolynomial PolynomialFactory::zero(size_t varCount) {
return BigPolynomial((VarNames(varCount)));
}
IdealFactory.h
PolynomialFactory.h
BigPolynomial
Definition BigPolynomial.h:27
BigPolynomial::add
void add(const mpz_class &coef, const vector< mpz_class > term)
Definition BigPolynomial.cpp:100
BigPolynomial::sortTermsReverseLex
void sortTermsReverseLex()
Definition BigPolynomial.cpp:46
IdealFactory::ring_xyzt
static VarNames ring_xyzt()
Returns the ring in the four variables , , and .
Definition IdealFactory.cpp:22
IdealFactory::makeTerm
static vector< mpz_class > makeTerm(int a, int b, int c, int d)
Returns a vector representing .
Definition IdealFactory.cpp:159
PolynomialFactory::one
static BigPolynomial one(size_t varCount)
Returns the polynomial 1 in the ring VarNames(varCount).
Definition PolynomialFactory.cpp:51
PolynomialFactory::one_minus4tt_3ttt_tttt_minusttttt
static BigPolynomial one_minus4tt_3ttt_tttt_minusttttt()
Returns the polynomial 1 - 4t^2 + 3t^3 + t^4 - t^5.
Definition PolynomialFactory.cpp:38
PolynomialFactory::zero
static BigPolynomial zero(size_t varCount)
Return the zero polynomial in the ring VarNames(varCount).
Definition PolynomialFactory.cpp:63
PolynomialFactory::hilbert_xx_yy_xz_yz
static BigPolynomial hilbert_xx_yy_xz_yz()
Returns the multigraded Hilbert-Poincare series numerator of the ideal <x^2, y^2, xz,...
Definition PolynomialFactory.cpp:22
VarNames
Defines the variables of a polynomial ring and facilities IO involving them.
Definition VarNames.h:40
VarNames::addVar
bool addVar(const string &name)
Adds the variable and returns true if name is not already a variable.
Definition VarNames.cpp:44
VarNames::getVarCount
size_t getVarCount() const
Returns the current number of variables.
Definition VarNames.h:113
stdinc.h
This header file includes common definitions and is included as the first line of code in every imple...