29 #define idDelete(H) id_Delete((H),currRing) 33 #define idMaxIdeal(D) id_MaxIdeal(D,currRing) 37 #define idPosConstant(I) id_PosConstant(I,currRing) 40 #define idIsConstant(I) id_IsConstant(I,currRing) 42 #define idSimpleAdd(A,B) id_SimpleAdd(A,B,currRing) 44 ideal
id_Copy (ideal h1,
const ring r);
46 #define idPrint(id) id_Print(id, currRing, currRing) 47 #define idTest(id) id_Test(id, currRing) 52 ideal idDBCopy(ideal h1,
const char *
f,
int l,
const ring r);
53 #define id_DBCopy(A,r) idDBCopy(A,__FILE__,__LINE__,r) 68 inline ideal
idAdd (ideal h1, ideal h2)
84 static inline ideal
idMult (ideal h1, ideal h2)
109 int binom (
int n,
int r);
150 ideal
idQuot (ideal h1,ideal h2,
158 #ifdef WITH_OLD_MINOR 159 poly idMinor(
matrix a,
int ar,
unsigned long which, ideal
R =
NULL);
196 ideal
idXXX (ideal h1,
int k);
198 poly
id_GCD(poly
f, poly
g,
const ring r);
200 ideal
id_Farey(ideal
x, number
N,
const ring r);
204 ideal
id_Satstd(
const ideal I, ideal J,
const ring r);
ideal idSect(ideal h1, ideal h2, GbVariant a=GbDefault)
ideal id_FreeModule(int i, const ring r)
the free module of rank i
ideal id_Satstd(const ideal I, ideal J, const ring r)
GbVariant syGetAlgorithm(char *n, const ring r, const ideal M)
static BOOLEAN idHomIdeal(ideal id, ideal Q=NULL)
BOOLEAN idInsertPolyOnPos(ideal I, poly p, int pos)
insert p into I on position pos
void idLiftW(ideal P, ideal Q, int n, matrix &T, ideal &R, short *w=NULL)
ideal idXXX(ideal h1, int k)
ideal id_Copy(ideal h1, const ring r)
copy an ideal
BOOLEAN id_HomModule(ideal m, ideal Q, intvec **w, const ring R)
BOOLEAN id_HomIdeal(ideal id, ideal Q, const ring r)
CanonicalForm divide(const CanonicalForm &ff, const CanonicalForm &f, const CFList &as)
ideal id_TensorModuleMult(const int m, const ideal M, const ring rRing)
ideal idModulo(ideal h1, ideal h2, tHomog h=testHomog, intvec **w=NULL)
BOOLEAN id_InsertPolyWithTests(ideal h1, const int validEntries, const poly h2, const bool zeroOk, const bool duplicateOk, const ring r)
insert h2 into h1 depending on the two boolean parameters:
intvec * idMWLift(ideal mod, intvec *weights)
static intvec * idSort(ideal id, BOOLEAN nolex=TRUE)
void idDelEquals(ideal id)
ideal idLiftStd(ideal h1, matrix *m, tHomog h=testHomog, ideal *syz=NULL, GbVariant a=GbDefault)
static BOOLEAN idIsZeroDim(ideal i)
ideal idMinBase(ideal h1)
static BOOLEAN idHomModule(ideal m, ideal Q, intvec **w)
ideal idSyzygies(ideal h1, tHomog h, intvec **w, BOOLEAN setSyzComp=TRUE, BOOLEAN setRegularity=FALSE, int *deg=NULL, GbVariant a=GbDefault)
ideal idSeries(int n, ideal M, matrix U=NULL, intvec *w=NULL)
ideal idMinEmbedding(ideal arg, BOOLEAN inPlace=FALSE, intvec **w=NULL)
void idKeepFirstK(ideal ide, const int k)
keeps the first k (>= 1) entries of the given ideal (Note that the kept polynomials may be zero....
const CanonicalForm CFMap CFMap & N
ideal idMinors(matrix a, int ar, ideal R=NULL)
compute all ar-minors of the matrix a the caller of mpRecMin the elements of the result are not in R ...
matrix idCoeffOfKBase(ideal arg, ideal kbase, poly how)
ideal idFreeModule(int i)
poly id_GCD(poly f, poly g, const ring r)
intvec * id_Sort(const ideal id, const BOOLEAN nolex, const ring r)
sorts the ideal w.r.t. the actual ringordering uses lex-ordering when nolex = FALSE
BOOLEAN idInsertPoly(ideal h1, poly h2)
insert h2 into h1 (if h2 is not the zero polynomial) return TRUE iff h2 was indeed inserted
void idGetNextChoise(int r, int end, BOOLEAN *endch, int *choise)
ideal idElimination(ideal h1, poly delVar, intvec *hilb=NULL, GbVariant a=GbDefault)
ideal id_Mult(ideal h1, ideal h2, const ring R)
h1 * h2 one h_i must be an ideal (with at least one column) the other h_i may be a module (with no co...
BOOLEAN idInsertPolyWithTests(ideal h1, const int validEntries, const poly h2, const bool zeroOk, const bool duplicateOk)
ideal idMultSect(resolvente arg, int length, GbVariant a=GbDefault)
static ideal idCopyFirstK(const ideal ide, const int k)
ideal id_Add(ideal h1, ideal h2, const ring r)
h1 + h2
void idInitChoise(int r, int beg, int end, BOOLEAN *endch, int *choise)
static BOOLEAN length(leftv result, leftv arg)
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
ideal id_Farey(ideal x, number N, const ring r)
BOOLEAN idIsSubModule(ideal id1, ideal id2)
ideal idLift(ideal mod, ideal sumod, ideal *rest=NULL, BOOLEAN goodShape=FALSE, BOOLEAN isSB=TRUE, BOOLEAN divide=FALSE, matrix *unit=NULL, GbVariant a=GbDefault)
ideal idQuot(ideal h1, ideal h2, BOOLEAN h1IsStb=FALSE, BOOLEAN resultIsIdeal=FALSE)
BOOLEAN id_IsZeroDim(ideal I, const ring r)
ideal id_CopyFirstK(const ideal ide, const int k, const ring r)
copies the first k (>= 1) entries of the given ideal/module and returns these as a new ideal/module (...
matrix idDiffOp(ideal I, ideal J, BOOLEAN multiply=TRUE)
int idGetNumberOfChoise(int t, int d, int begin, int end, int *choise)
ideal idAdd(ideal h1, ideal h2)
h1 + h2
ideal id_Vec2Ideal(poly vec, const ring R)
static ideal idVec2Ideal(poly vec)
BOOLEAN idIs0(ideal h)
returns true if h is the zero ideal
BOOLEAN idTestHomModule(ideal m, ideal Q, intvec *w)
static ideal idMult(ideal h1, ideal h2)
hh := h1 * h2
matrix idDiff(matrix i, int k)