![]() |
#include <polys/monomials/ring.h>
#include <polys/monomials/p_polys.h>
#include <polys/simpleideals.h>
#include <kernel/structs.h>
Go to the source code of this file.
Macros | |
#define | idDelete(H) id_Delete((H),currRing) |
delete an ideal More... | |
#define | idMaxIdeal(D) id_MaxIdeal(D,currRing) |
initialise the maximal ideal (at 0) More... | |
#define | idPosConstant(I) id_PosConstant(I,currRing) |
index of generator with leading term in ground ring (if any); otherwise -1 More... | |
#define | idIsConstant(I) id_IsConstant(I,currRing) |
#define | idSimpleAdd(A, B) id_SimpleAdd(A,B,currRing) |
#define | idPrint(id) id_Print(id, currRing, currRing) |
#define | idTest(id) id_Test(id, currRing) |
Typedefs | |
typedef ideal * | resolvente |
Functions | |
static ideal | idCopyFirstK (const ideal ide, const int k) |
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.) More... | |
void | idDelEquals (ideal id) |
ideal | id_Copy (ideal h1, const ring r) |
copy an ideal More... | |
ideal | idCopy (ideal A) |
ideal | idAdd (ideal h1, ideal h2) |
h1 + h2 More... | |
BOOLEAN | idInsertPoly (ideal h1, poly h2) |
insert h2 into h1 (if h2 is not the zero polynomial) return TRUE iff h2 was indeed inserted More... | |
BOOLEAN | idInsertPolyOnPos (ideal I, poly p, int pos) |
insert p into I on position pos More... | |
BOOLEAN | idInsertPolyWithTests (ideal h1, const int validEntries, const poly h2, const bool zeroOk, const bool duplicateOk) |
ideal | idMult (ideal h1, ideal h2) |
hh := h1 * h2 More... | |
BOOLEAN | idIs0 (ideal h) |
returns true if h is the zero ideal More... | |
BOOLEAN | idHomIdeal (ideal id, ideal Q=NULL) |
BOOLEAN | idHomModule (ideal m, ideal Q, intvec **w) |
BOOLEAN | idTestHomModule (ideal m, ideal Q, intvec *w) |
ideal | idMinBase (ideal h1) |
void | idInitChoise (int r, int beg, int end, BOOLEAN *endch, int *choise) |
void | idGetNextChoise (int r, int end, BOOLEAN *endch, int *choise) |
int | idGetNumberOfChoise (int t, int d, int begin, int end, int *choise) |
int | binom (int n, int r) |
ideal | idFreeModule (int i) |
ideal | idSect (ideal h1, ideal h2) |
ideal | idMultSect (resolvente arg, int length) |
ideal | idSyzygies (ideal h1, tHomog h, intvec **w, BOOLEAN setSyzComp=TRUE, BOOLEAN setRegularity=FALSE, int *deg=NULL) |
ideal | idLiftStd (ideal h1, matrix *m, tHomog h=testHomog, ideal *syz=NULL) |
ideal | idLift (ideal mod, ideal sumod, ideal *rest=NULL, BOOLEAN goodShape=FALSE, BOOLEAN isSB=TRUE, BOOLEAN divide=FALSE, matrix *unit=NULL) |
void | idLiftW (ideal P, ideal Q, int n, matrix &T, ideal &R, short *w=NULL) |
intvec * | idMWLift (ideal mod, intvec *weights) |
ideal | idQuot (ideal h1, ideal h2, BOOLEAN h1IsStb=FALSE, BOOLEAN resultIsIdeal=FALSE) |
ideal | idElimination (ideal h1, poly delVar, intvec *hilb=NULL) |
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 (if R!=NULL) More... | |
ideal | idMinEmbedding (ideal arg, BOOLEAN inPlace=FALSE, intvec **w=NULL) |
ideal | idHead (ideal h) |
BOOLEAN | idIsSubModule (ideal id1, ideal id2) |
static ideal | idVec2Ideal (poly vec) |
ideal | idSeries (int n, ideal M, matrix U=NULL, intvec *w=NULL) |
static BOOLEAN | idIsZeroDim (ideal i) |
matrix | idDiff (matrix i, int k) |
matrix | idDiffOp (ideal I, ideal J, BOOLEAN multiply=TRUE) |
static intvec * | idSort (ideal id, BOOLEAN nolex=TRUE) |
ideal | idModulo (ideal h1, ideal h2, tHomog h=testHomog, intvec **w=NULL) |
matrix | idCoeffOfKBase (ideal arg, ideal kbase, poly how) |
ideal | idXXX (ideal h1, int k) |
poly | id_GCD (poly f, poly g, const ring r) |
ideal | id_Farey (ideal x, number N, const ring r) |
ideal | id_TensorModuleMult (const int m, const ideal M, const ring rRing) |
#define idIsConstant | ( | I | ) | id_IsConstant(I,currRing) |
#define idMaxIdeal | ( | D | ) | id_MaxIdeal(D,currRing) |
#define idPosConstant | ( | I | ) | id_PosConstant(I,currRing) |
typedef ideal* resolvente |
int binom | ( | int | n, |
int | r | ||
) |
Definition at line 911 of file simpleideals.cc.
ideal id_Copy | ( | ideal | h1, |
const ring | r | ||
) |
Definition at line 2356 of file ideals.cc.
Definition at line 1661 of file simpleideals.cc.
|
inline |
h1 + h2
Definition at line 68 of file ideals.h.
Definition at line 2232 of file ideals.cc.
|
inline |
Definition at line 60 of file ideals.h.
Definition at line 20 of file ideals.h.
void idDelEquals | ( | ideal | id | ) |
Definition at line 2564 of file ideals.cc.
Definition at line 1904 of file ideals.cc.
Definition at line 1917 of file ideals.cc.
Definition at line 1353 of file ideals.cc.
|
inline |
Definition at line 111 of file ideals.h.
void idGetNextChoise | ( | int | r, |
int | end, | ||
BOOLEAN * | endch, | ||
int * | choise | ||
) |
Definition at line 853 of file simpleideals.cc.
int idGetNumberOfChoise | ( | int | t, |
int | d, | ||
int | begin, | ||
int | end, | ||
int * | choise | ||
) |
Definition at line 879 of file simpleideals.cc.
ideal idHead | ( | ideal | h | ) |
Definition at line 91 of file ideals.h.
Definition at line 96 of file ideals.h.
void idInitChoise | ( | int | r, |
int | beg, | ||
int | end, | ||
BOOLEAN * | endch, | ||
int * | choise | ||
) |
Definition at line 831 of file simpleideals.cc.
insert h2 into h1 (if h2 is not the zero polynomial) return TRUE iff h2 was indeed inserted
Definition at line 638 of file simpleideals.cc.
|
inline |
Definition at line 75 of file ideals.h.
BOOLEAN idIs0 | ( | ideal | h | ) |
BOOLEAN idIsSubModule | ( | ideal | id1, |
ideal | id2 | ||
) |
Definition at line 1814 of file ideals.cc.
|
inlinestatic |
Definition at line 161 of file ideals.h.
void idKeepFirstK | ( | ideal | ide, |
const int | k | ||
) |
ideal idLift | ( | ideal | mod, |
ideal | sumod, | ||
ideal * | rest = NULL , |
||
BOOLEAN | goodShape = FALSE , |
||
BOOLEAN | isSB = TRUE , |
||
BOOLEAN | divide = FALSE , |
||
matrix * | unit = NULL |
||
) |
Definition at line 891 of file ideals.cc.
Definition at line 704 of file ideals.cc.
Definition at line 1086 of file ideals.cc.
ideal idMinBase | ( | ideal | h1 | ) |
Definition at line 45 of file ideals.cc.
Definition at line 2298 of file ideals.cc.
compute all ar-minors of the matrix a the caller of mpRecMin the elements of the result are not in R (if R!=NULL)
Definition at line 1745 of file ideals.cc.
Definition at line 1989 of file ideals.cc.
|
inline |
hh := h1 * h2
Definition at line 84 of file ideals.h.
ideal idMultSect | ( | resolvente | arg, |
int | length | ||
) |
Definition at line 340 of file ideals.cc.
Definition at line 2129 of file ideals.cc.
Definition at line 1260 of file ideals.cc.
ideal idSect | ( | ideal | h1, |
ideal | h2 | ||
) |
Definition at line 201 of file ideals.cc.
Definition at line 169 of file ideals.h.
ideal idSyzygies | ( | ideal | h1, |
tHomog | h, | ||
intvec ** | w, | ||
BOOLEAN | setSyzComp = TRUE , |
||
BOOLEAN | setRegularity = FALSE , |
||
int * | deg = NULL |
||
) |
Definition at line 515 of file ideals.cc.
Definition at line 1835 of file ideals.cc.
|
inlinestatic |
Definition at line 154 of file ideals.h.
ideal idXXX | ( | ideal | h1, |
int | k | ||
) |
Definition at line 657 of file ideals.cc.