![]() |
#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) |
static int | idSize (const ideal id) |
Count the effective size of an ideal (without the trailing allocated zero-elements) More... | |
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 | 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) |
Variables | |
ring | currRing |
Widely used global variable which specifies the current polynomial ring for Singular interpreter and legacy implementatins. : one should avoid using it in newer designs, for example due to possible problems in parallelization with threads. More... | |
#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 894 of file simpleideals.cc.
ideal id_Copy | ( | ideal | h1, |
const ring | r | ||
) |
Definition at line 2402 of file ideals.cc.
Definition at line 1649 of file simpleideals.cc.
|
inline |
h1 + h2
Definition at line 81 of file ideals.h.
Definition at line 2278 of file ideals.cc.
|
inline |
Definition at line 73 of file ideals.h.
Definition at line 22 of file ideals.h.
void idDelEquals | ( | ideal | id | ) |
Definition at line 2647 of file ideals.cc.
Definition at line 1950 of file ideals.cc.
Definition at line 1963 of file ideals.cc.
Definition at line 1400 of file ideals.cc.
|
inline |
Definition at line 123 of file ideals.h.
void idGetNextChoise | ( | int | r, |
int | end, | ||
BOOLEAN * | endch, | ||
int * | choise | ||
) |
Definition at line 836 of file simpleideals.cc.
int idGetNumberOfChoise | ( | int | t, |
int | d, | ||
int | begin, | ||
int | end, | ||
int * | choise | ||
) |
Definition at line 862 of file simpleideals.cc.
ideal idHead | ( | ideal | h | ) |
Definition at line 103 of file ideals.h.
Definition at line 108 of file ideals.h.
void idInitChoise | ( | int | r, |
int | beg, | ||
int | end, | ||
BOOLEAN * | endch, | ||
int * | choise | ||
) |
Definition at line 814 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 642 of file simpleideals.cc.
|
inline |
Definition at line 87 of file ideals.h.
BOOLEAN idIs0 | ( | ideal | h | ) |
BOOLEAN idIsSubModule | ( | ideal | id1, |
ideal | id2 | ||
) |
Definition at line 1860 of file ideals.cc.
|
inlinestatic |
Definition at line 173 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 935 of file ideals.cc.
Definition at line 748 of file ideals.cc.
Definition at line 1130 of file ideals.cc.
ideal idMinBase | ( | ideal | h1 | ) |
Definition at line 53 of file ideals.cc.
Definition at line 2344 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 1791 of file ideals.cc.
Definition at line 2035 of file ideals.cc.
|
inline |
hh := h1 * h2
Definition at line 96 of file ideals.h.
ideal idMultSect | ( | resolvente | arg, |
int | length | ||
) |
Definition at line 350 of file ideals.cc.
Definition at line 2175 of file ideals.cc.
Definition at line 1307 of file ideals.cc.
ideal idSect | ( | ideal | h1, |
ideal | h2 | ||
) |
Definition at line 211 of file ideals.cc.
|
inlinestatic |
Definition at line 181 of file ideals.h.
ideal idSyzygies | ( | ideal | h1, |
tHomog | h, | ||
intvec ** | w, | ||
BOOLEAN | setSyzComp = TRUE , |
||
BOOLEAN | setRegularity = FALSE , |
||
int * | deg = NULL |
||
) |
Definition at line 557 of file ideals.cc.
Definition at line 1881 of file ideals.cc.
|
inlinestatic |
Definition at line 166 of file ideals.h.
ideal idXXX | ( | ideal | h1, |
int | k | ||
) |
Definition at line 701 of file ideals.cc.