[0e1846] | 1 | #ifndef IDEALS_H |
---|
| 2 | #define IDEALS_H |
---|
| 3 | /**************************************** |
---|
| 4 | * Computer Algebra System SINGULAR * |
---|
| 5 | ****************************************/ |
---|
[b982ef] | 6 | /* $Id: ideals.h,v 1.11 1998-11-12 14:44:36 siebert Exp $ */ |
---|
[0e1846] | 7 | /* |
---|
[6ae4f5] | 8 | * ABSTRACT - all basic methods to manipulate ideals |
---|
[0e1846] | 9 | */ |
---|
| 10 | #include "structs.h" |
---|
| 11 | |
---|
[d3e295a] | 12 | #ifdef PDEBUG |
---|
[0e1846] | 13 | ideal idDBInit (int size, int rank, char *f, int l); |
---|
| 14 | #define idInit(A,B) idDBInit(A,B,__FILE__,__LINE__) |
---|
[25f470] | 15 | void idDBDelete (ideal* h, char *f, int l); |
---|
| 16 | #define idDelete(A) idDBDelete(A,__FILE__,__LINE__) |
---|
[0e1846] | 17 | #else |
---|
| 18 | ideal idInit (int size, int rank=1); |
---|
[25f470] | 19 | /*- creates an ideal -*/ |
---|
| 20 | void idDelete (ideal* h); |
---|
| 21 | /*- deletes an ideal -*/ |
---|
[0e1846] | 22 | #endif |
---|
| 23 | /*- initialise an ideal -*/ |
---|
| 24 | ideal idMaxIdeal (int deg); |
---|
| 25 | /*- initialise the maximal ideal (at 0) -*/ |
---|
| 26 | void idSkipZeroes (ideal ide); |
---|
| 27 | /*gives an ideal the minimal possible size*/ |
---|
| 28 | void idNorm(ideal id); |
---|
| 29 | void idDelMultiples(ideal id); |
---|
| 30 | void idDelEquals(ideal id); |
---|
[26ae12] | 31 | void idDelLmEquals(ideal id); |
---|
| 32 | void idDelDiv(ideal id); |
---|
[0e1846] | 33 | |
---|
| 34 | #ifdef PDEBUG |
---|
| 35 | void idDBTest(ideal h1,char *f,int l); |
---|
| 36 | #define idTest(A) idDBTest(A,__FILE__,__LINE__) |
---|
| 37 | #else |
---|
| 38 | #define idTest(A) |
---|
| 39 | #endif |
---|
| 40 | |
---|
[d3e295a] | 41 | #ifdef PDEBUG |
---|
[0e1846] | 42 | ideal idDBCopy(ideal h1,char *f,int l); |
---|
| 43 | #define idCopy(A) idDBCopy(A,__FILE__,__LINE__) |
---|
| 44 | #else |
---|
| 45 | ideal idCopy (ideal h1); |
---|
| 46 | #endif |
---|
| 47 | /*adds two ideals without simplifying the result*/ |
---|
| 48 | ideal idSimpleAdd (ideal h1,ideal h2); |
---|
| 49 | /*adds the quotient ideal*/ |
---|
| 50 | ideal idAdd (ideal h1,ideal h2); |
---|
| 51 | /* h1 + h2 */ |
---|
| 52 | ideal idMult (ideal h1,ideal h2); |
---|
| 53 | /*hh := h1 * h2*/ |
---|
| 54 | |
---|
| 55 | BOOLEAN idIs0 (ideal h); |
---|
| 56 | |
---|
| 57 | int idRankFreeModule(ideal m); |
---|
| 58 | |
---|
| 59 | BOOLEAN idHomIdeal (ideal id, ideal Q=NULL); |
---|
| 60 | BOOLEAN idHomModule(ideal m, ideal Q,intvec **w); |
---|
| 61 | |
---|
| 62 | ideal idMinBase (ideal h1); |
---|
| 63 | /*returns a minimized set of generators of h1*/ |
---|
| 64 | int pLowVar (poly p); |
---|
| 65 | /*-the minimal index of used variables - 1-*/ |
---|
| 66 | ideal idDehomogen (ideal id1,poly p,number n); |
---|
| 67 | /*dehomogenized the generators of the ideal id1 with the leading |
---|
| 68 | monomial of p replaced by n*/ |
---|
| 69 | void pShift (poly * p,int i); |
---|
| 70 | /*- verschiebt die Indizes der Modulerzeugenden um i -*/ |
---|
| 71 | void idInitChoise (int r,int beg,int end,BOOLEAN *endch,int * choise); |
---|
| 72 | void idGetNextChoise (int r,int end,BOOLEAN *endch,int * choise); |
---|
| 73 | int idGetNumberOfChoise(int t, int d, int begin, int end, int * choise); |
---|
| 74 | |
---|
| 75 | int binom (int n,int r); |
---|
| 76 | |
---|
| 77 | ideal idFreeModule (int i); |
---|
| 78 | |
---|
| 79 | ideal idSect (ideal h1,ideal h2); |
---|
| 80 | ideal idMultSect(resolvente arg, int length); |
---|
| 81 | |
---|
| 82 | ideal idSyzygies (ideal h1,ideal quot, tHomog h,intvec **w); |
---|
| 83 | ideal idSyzygies (ideal h1,ideal quot, tHomog h,intvec **w, |
---|
| 84 | BOOLEAN setRegularity, int °); |
---|
| 85 | ideal idSyzMin (ideal h1,ideal quot, tHomog h,intvec **w, |
---|
| 86 | BOOLEAN setRegularity, int °); |
---|
| 87 | ideal idLiftStd (ideal h1, ideal quot, matrix *m, tHomog h=testHomog); |
---|
| 88 | |
---|
| 89 | ideal idLift (ideal mod, ideal sumod); |
---|
[b982ef] | 90 | ideal idLiftNonStB (ideal mod, ideal submod,BOOLEAN goodShape=FALSE); |
---|
[0e1846] | 91 | |
---|
| 92 | intvec * idMWLift(ideal mod,intvec * weights); |
---|
| 93 | |
---|
[761e9a5] | 94 | ideal idQuot (ideal h1,ideal h2, |
---|
| 95 | BOOLEAN h1IsStb=FALSE, BOOLEAN resultIsIdeal=FALSE); |
---|
[0e1846] | 96 | |
---|
| 97 | ideal idPower(ideal gid,int deg); |
---|
| 98 | |
---|
| 99 | //ideal idElimination (ideal h1,poly delVar); |
---|
| 100 | ideal idElimination (ideal h1,poly delVar, intvec *hilb=NULL); |
---|
| 101 | |
---|
| 102 | ideal idMinors(matrix a, int ar); |
---|
| 103 | |
---|
| 104 | ideal idCompactify(ideal id); |
---|
| 105 | |
---|
| 106 | ideal idMinEmbedding(ideal arg); |
---|
| 107 | |
---|
| 108 | ideal idHead(ideal h); |
---|
| 109 | |
---|
| 110 | ideal idHomogen(ideal h, int varnum); |
---|
| 111 | |
---|
| 112 | BOOLEAN idIsSubModule(ideal id1,ideal id2); |
---|
| 113 | |
---|
| 114 | ideal idVec2Ideal(poly vec); |
---|
| 115 | |
---|
| 116 | ideal idMatrix2Module(matrix mat); |
---|
| 117 | |
---|
| 118 | matrix idModule2Matrix(ideal mod); |
---|
| 119 | |
---|
| 120 | matrix idModule2formatedMatrix(ideal mod,int rows, int cols); |
---|
| 121 | |
---|
| 122 | ideal idSubst(ideal i, int n, poly e); |
---|
| 123 | |
---|
| 124 | ideal idJet(ideal i,int d); |
---|
| 125 | ideal idJetW(ideal i,int d, intvec * iv); |
---|
| 126 | |
---|
| 127 | matrix idDiff(matrix i, int k); |
---|
| 128 | matrix idDiffOp(ideal I, ideal J,BOOLEAN multiply=TRUE); |
---|
| 129 | |
---|
| 130 | intvec *idSort(ideal id,BOOLEAN nolex=TRUE); |
---|
| 131 | ideal idModulo (ideal h1,ideal h2); |
---|
| 132 | int idElem(ideal F); |
---|
| 133 | matrix idCoeffOfKBase(ideal arg, ideal kbase, poly how); |
---|
| 134 | intvec *idQHomWeights(ideal id); |
---|
[dfc64d9] | 135 | ideal idTransp(ideal a); |
---|
[0e1846] | 136 | #endif |
---|