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