ideals.h
Go to the documentation of this file.
1 #ifndef IDEALS_H
2 #define IDEALS_H
3 /****************************************
4 * Computer Algebra System SINGULAR *
5 ****************************************/
6 /*
7 * ABSTRACT - all basic methods to manipulate ideals
8 */
9 
10 #include <polys/monomials/ring.h>
12 #include <polys/simpleideals.h>
13 
14 extern ring currRing;
15 
16 #include <kernel/structs.h> // for tHomog
17 
18 //typedef struct sip_sideal * ideal;
19 //typedef struct sip_smap * map;
20 typedef ideal * resolvente;
21 
22 static inline ideal idCopyFirstK (const ideal ide, const int k)
23 {
24  return id_CopyFirstK(ide, k, currRing);
25 }
26 
27 void idKeepFirstK(ideal ide, const int k);
28 void idDelEquals(ideal id);
29 
30 /// delete an ideal
31 #define idDelete(H) id_Delete((H),currRing)
32 
33 /// initialise the maximal ideal (at 0)
34 //ideal id_MaxIdeal(int deg, const ring r);
35 #define idMaxIdeal(D) id_MaxIdeal(D,currRing)
36 
37 /// index of generator with leading term in ground ring (if any); otherwise -1
38 //int id_PosConstant(ideal id, const ring r)
39 #define idPosConstant(I) id_PosConstant(I,currRing)
40 
41 //BOOLEAN id_IsConstant(ideal id, const ring r);
42 #define idIsConstant(I) id_IsConstant(I,currRing)
43 
44 #define idSimpleAdd(A,B) id_SimpleAdd(A,B,currRing)
45 
46 ideal id_Copy (ideal h1, const ring r);
47 
48 #define idPrint(id) id_Print(id, currRing, currRing)
49 #define idTest(id) id_Test(id, currRing)
50 
51 #if 0
52 
53 // ifdef PDEBUG // Sorry: the following was lost........ :((((((((
54 ideal idDBCopy(ideal h1,const char *f,int l,const ring r);
55 #define id_DBCopy(A,r) idDBCopy(A,__FILE__,__LINE__,r)
56 
57 inline ideal idCopy(ideal A)
58 {
59  return id_DBCopy(A,currRing); // well, just for now... ok? Macros can't have default args values :(
60 }
61 #else
62 inline ideal idCopy(ideal A)
63 {
64  return id_Copy(A, currRing);
65 }
66 #endif
67 
68 
69 /// h1 + h2
70 inline ideal idAdd (ideal h1, ideal h2)
71 {
72  return id_Add(h1, h2, currRing);
73 }
74 
75 BOOLEAN idInsertPoly (ideal h1,poly h2); /* h1 + h2 */
76 BOOLEAN idInsertPolyOnPos (ideal I,poly p,int pos); /* inserts p in I on pos */
77 inline BOOLEAN idInsertPolyWithTests (ideal h1, const int validEntries, const poly h2, const bool zeroOk, const bool duplicateOk)
78 {
79  return id_InsertPolyWithTests (h1, validEntries, h2, zeroOk, duplicateOk, currRing);
80 }
81 
82 
83 /* h1 + h2 */
84 
85 /// hh := h1 * h2
86 inline ideal idMult (ideal h1, ideal h2)
87 {
88  return id_Mult(h1, h2, currRing);
89 }
90 
91 BOOLEAN idIs0 (ideal h);
92 
93 inline BOOLEAN idHomIdeal (ideal id, ideal Q=NULL)
94 {
95  return id_HomIdeal(id, Q, currRing);
96 }
97 
98 inline BOOLEAN idHomModule(ideal m, ideal Q,intvec **w)
99 {
100  return id_HomModule(m, Q, w, currRing);
101 }
102 
103 BOOLEAN idTestHomModule(ideal m, ideal Q, intvec *w);
104 
105 ideal idMinBase (ideal h1);
106  /*returns a minimized set of generators of h1*/
107 void idInitChoise (int r,int beg,int end,BOOLEAN *endch,int * choise);
108 void idGetNextChoise (int r,int end,BOOLEAN *endch,int * choise);
109 int idGetNumberOfChoise(int t, int d, int begin, int end, int * choise);
110 
111 int binom (int n,int r);
112 
113 inline ideal idFreeModule (int i)
114 {
115  return id_FreeModule (i, currRing);
116 }
117 
118 
119 ideal idSect (ideal h1,ideal h2);
120 ideal idMultSect(resolvente arg, int length);
121 
122 //ideal idSyzygies (ideal h1, tHomog h,intvec **w);
123 ideal idSyzygies (ideal h1, tHomog h,intvec **w, BOOLEAN setSyzComp=TRUE,
124  BOOLEAN setRegularity=FALSE, int *deg = NULL);
125 ideal idLiftStd (ideal h1, matrix *m, tHomog h=testHomog, ideal *syz=NULL);
126 
127 ideal idLift (ideal mod, ideal sumod,ideal * rest=NULL,
128  BOOLEAN goodShape=FALSE, BOOLEAN isSB=TRUE,BOOLEAN divide=FALSE,
129  matrix *unit=NULL);
130 
131 void idLiftW(ideal P,ideal Q,int n,matrix &T, ideal &R, short *w= NULL );
132 
133 intvec * idMWLift(ideal mod,intvec * weights);
134 
135 ideal idQuot (ideal h1,ideal h2,
136  BOOLEAN h1IsStb=FALSE, BOOLEAN resultIsIdeal=FALSE);
137 
138 // ideal idPower(ideal gid,int deg);
139 
140 //ideal idElimination (ideal h1,poly delVar);
141 ideal idElimination (ideal h1,poly delVar, intvec *hilb=NULL);
142 
143 #ifdef WITH_OLD_MINOR
144 poly idMinor(matrix a, int ar, unsigned long which, ideal R = NULL);
145 #endif
146 ideal idMinors(matrix a, int ar, ideal R = NULL);
147 
148 ideal idMinEmbedding(ideal arg,BOOLEAN inPlace=FALSE, intvec **w=NULL);
149 
150 ideal idHead(ideal h);
151 
152 // ideal idHomogen(ideal h, int varnum);
153 
154 BOOLEAN idIsSubModule(ideal id1,ideal id2);
155 
156 static inline ideal idVec2Ideal(poly vec)
157 {
158  return id_Vec2Ideal(vec, currRing);
159 }
160 
161 ideal idSeries(int n,ideal M,matrix U=NULL,intvec *w=NULL);
162 
163 static inline BOOLEAN idIsZeroDim(ideal i)
164 {
165  return id_IsZeroDim(i, currRing);
166 }
167 
168 matrix idDiff(matrix i, int k);
169 matrix idDiffOp(ideal I, ideal J,BOOLEAN multiply=TRUE);
170 
171 static inline intvec *idSort(ideal id,BOOLEAN nolex=TRUE)
172 {
173  return id_Sort(id, nolex, currRing);
174 }
175 
176 ideal idModulo (ideal h1,ideal h2, tHomog h=testHomog, intvec ** w=NULL);
177 matrix idCoeffOfKBase(ideal arg, ideal kbase, poly how);
178 
179 // intvec *idQHomWeight(ideal id);
180 
181 ideal idXXX (ideal h1, int k);
182 
183 poly id_GCD(poly f, poly g, const ring r);
184 
185 ideal id_Farey(ideal x, number N, const ring r);
186 
187 ideal id_TensorModuleMult(const int m, const ideal M, const ring rRing); // image of certain map for BGG
188 
189 
190 #endif
ideal id_FreeModule(int i, const ring r)
the free module of rank i
const poly a
Definition: syzextra.cc:212
CF_NO_INLINE CanonicalForm mod(const CanonicalForm &, const CanonicalForm &)
Definition: cf_inline.cc:564
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)
Definition: ideals.cc:1086
#define FALSE
Definition: auxiliary.h:97
ideal idXXX(ideal h1, int k)
Definition: ideals.cc:657
return P p
Definition: myNF.cc:203
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)
Definition: ideals.cc:1988
#define TRUE
Definition: auxiliary.h:101
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)
Definition: ideals.cc:2128
g
Definition: cfModGcd.cc:4031
int k
Definition: cfEzgcd.cc:93
static intvec * idSort(ideal id, BOOLEAN nolex=TRUE)
Definition: ideals.h:171
ideal idLift(ideal mod, ideal sumod, ideal *rest=NULL, BOOLEAN goodShape=FALSE, BOOLEAN isSB=TRUE, BOOLEAN divide=FALSE, matrix *unit=NULL)
Definition: ideals.cc:891
void idDelEquals(ideal id)
Definition: ideals.cc:2600
#define Q
Definition: sirandom.c:25
ideal idLiftStd(ideal h1, matrix *m, tHomog h=testHomog, ideal *syz=NULL)
Definition: ideals.cc:704
static BOOLEAN idIsZeroDim(ideal i)
Definition: ideals.h:163
ideal idMinBase(ideal h1)
Definition: ideals.cc:45
ideal idHead(ideal h)
ideal idSeries(int n, ideal M, matrix U=NULL, intvec *w=NULL)
Definition: ideals.cc:1886
#define M
Definition: sirandom.c:24
fq_nmod_poly_t * vec
Definition: facHensel.cc:103
const ring r
Definition: syzextra.cc:208
ideal idElimination(ideal h1, poly delVar, intvec *hilb=NULL)
Definition: ideals.cc:1353
ideal idMinEmbedding(ideal arg, BOOLEAN inPlace=FALSE, intvec **w=NULL)
Definition: ideals.cc:2297
Definition: intvec.h:14
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...
Definition: ideals.cc:2531
const CanonicalForm CFMap CFMap & N
Definition: cfEzgcd.cc:49
tHomog
Definition: structs.h:37
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 ...
Definition: ideals.cc:1744
matrix idCoeffOfKBase(ideal arg, ideal kbase, poly how)
Definition: ideals.cc:2231
ideal idFreeModule(int i)
Definition: ideals.h:113
#define A
Definition: sirandom.c:23
poly id_GCD(poly f, poly g, const ring r)
Definition: ideals.cc:2355
const ring R
Definition: DebugPrint.cc:36
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 ...
ideal idMultSect(resolvente arg, int length)
Definition: ideals.cc:340
BOOLEAN idInsertPoly(ideal h1, poly h2)
insert h2 into h1 (if h2 is not the zero polynomial) return TRUE iff h2 was indeed inserted ...
int m
Definition: cfEzgcd.cc:119
void idGetNextChoise(int r, int end, BOOLEAN *endch, int *choise)
FILE * f
Definition: checklibs.c:7
int i
Definition: cfEzgcd.cc:123
ideal idSect(ideal h1, ideal h2)
Definition: ideals.cc:201
ideal idCopy(ideal A)
Definition: ideals.h:62
ideal idMult(ideal h1, ideal h2)
hh := h1 * h2
Definition: ideals.h:86
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)
Definition: ideals.h:77
static ideal idCopyFirstK(const ideal ide, const int k)
Definition: ideals.h:22
#define NULL
Definition: omList.c:10
BOOLEAN idHomIdeal(ideal id, ideal Q=NULL)
Definition: ideals.h:93
ideal idSyzygies(ideal h1, tHomog h, intvec **w, BOOLEAN setSyzComp=TRUE, BOOLEAN setRegularity=FALSE, int *deg=NULL)
Definition: ideals.cc:515
ideal id_Add(ideal h1, ideal h2, const ring r)
h1 + h2
void idInitChoise(int r, int beg, int end, BOOLEAN *endch, int *choise)
const CanonicalForm & w
Definition: facAbsFact.cc:55
Variable x
Definition: cfModGcd.cc:4023
ideal id_Farey(ideal x, number N, const ring r)
Definition: ideals.cc:2455
BOOLEAN idIsSubModule(ideal id1, ideal id2)
Definition: ideals.cc:1813
ideal * resolvente
Definition: ideals.h:20
ideal idQuot(ideal h1, ideal h2, BOOLEAN h1IsStb=FALSE, BOOLEAN resultIsIdeal=FALSE)
Definition: ideals.cc:1260
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)
Definition: ideals.cc:1916
int idGetNumberOfChoise(int t, int d, int begin, int end, int *choise)
ideal idAdd(ideal h1, ideal h2)
h1 + h2
Definition: ideals.h:70
ideal id_Vec2Ideal(poly vec, const ring R)
kBucketDestroy & P
Definition: myNF.cc:191
static ideal idVec2Ideal(poly vec)
Definition: ideals.h:156
static jList * T
Definition: janet.cc:37
polyrec * poly
Definition: hilb.h:10
static Poly * h
Definition: janet.cc:978
int BOOLEAN
Definition: auxiliary.h:88
BOOLEAN idIs0(ideal h)
returns true if h is the zero ideal
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
Definition: polys.cc:10
BOOLEAN idTestHomModule(ideal m, ideal Q, intvec *w)
Definition: ideals.cc:1834
BOOLEAN idHomModule(ideal m, ideal Q, intvec **w)
Definition: ideals.h:98
int binom(int n, int r)
matrix idDiff(matrix i, int k)
Definition: ideals.cc:1903
int l
Definition: cfEzgcd.cc:94