Annotation of OpenXM/src/kan96xx/Kan/gradedset.h, Revision 1.4
1.4 ! takayama 1: /* $OpenXM: OpenXM/src/kan96xx/Kan/gradedset.h,v 1.3 2000/02/24 00:27:12 takayama Exp $ */
1.1 maekawa 2: /* gradedset.h */
3: #define max(a,b) (a>b?a:b)
4:
5: /* You may use only ppAdd() and cpMult() for the elements of SyzRingp. */
6: #define srGrade(s) ((s)->m->e[0].x) /* s is in the SyzRingp */
7: #define srIndex(s) ((s)->m->e[0].D)
8: #define srSyzCoeffToPOLY(s) ((s)->val.f)
9:
10:
11: /* gradedset.c */
12: void errorGradedSet(char *s);
13: void warningGradedSet(char *s);
14: struct polySet *newPolySet(int n);
15: struct pair *newPair(struct pair *prev);
16: struct pair *pairCopy(struct pair *node);
17: struct gradedPolySet *newGradedPolySet(int n);
18: struct gradedPairs *newGradedPairs(int n);
19: struct gradedPairs *enlargeGradedPairs(int size,struct gradedPairs *grD);
20: void insertPair(struct pair *inode,struct pair *before);
21: /* insert inode after before */
22: struct pair *deletePair(struct pair *p); /* delete p->next and returns
23: p->next */
24: struct pair *getPair(struct gradedPairs *grD);
25: void whereInG(struct gradedPolySet *g, POLY fi, int *gradep, int *indexp,int sugar);
26: struct gradedPolySet *putPolyInG(struct gradedPolySet *g, POLY fi, int grade,
27: int index,struct syz0 *syz,int mark,int serial);
28: void markRedundant(struct gradedPolySet *g,POLY gt,int grade,int index,int sugar);
29: void markRedundant0(struct gradedPolySet *g,int grade,int index);
30: struct syz0 *newSyz0(void);
31: struct gradedPairs *putPairInGradedPairs(struct gradedPairs *grP,
32: struct pair *top);
33: void outputGradedPolySet(struct gradedPolySet *grG,int needSyz);
34: void outputGradedPairs(struct gradedPairs *grP);
35: void outputNode(struct pair *p);
36: int countPairs(struct gradedPairs *grD);
37: int countGradedPolySet(struct gradedPolySet *grD);
38: struct gradedPolySet *gradedPolySetCopy(struct gradedPolySet *grG);
39: int deletePairByCriterion2B(struct gradedPairs *grD,POLY gt,struct gradedPolySet *grG);
40:
41: /* red.c */
42: struct spValue (*sp)(POLY f,POLY g);
43: int (*isReducible)(POLY f,POLY g);
44: POLY (*reduction1)(POLY f,POLY g,int needSyz,POLY *cc,POLY *cg);
45: /* if needSyz, then result = *cc f + *cg g. */
46: /* syzp->cf is in the CurrentRignp and syzp->syz is in the SyzRingp. */
47: POLY (*reduction)(POLY f,struct gradedPolySet *gset,int needSyz,
48: struct syz0 *syzp);
49: POLY (*isCdrReducible)(POLY f,POLY g);
50: POLY (*reduction1Cdr)(POLY f,POLY fs,POLY g,int needSyz,POLY *cc,POLY *cg);
51: /* if needSyz, then result = *cc f + *cg g. */
52: POLY (*reductionCdr)(POLY f,struct gradedPolySet *gset,int needSyz,
53: struct syz0 *syzp);
54: POLY (*lcm)(POLY f,POLY g);
55: POLY reduction1_gen(POLY f,POLY g,int needSyz,POLY *cc,POLY *cg);
56: POLY reduction1_gen_debug(POLY f,POLY g,int needSyz,POLY *cc,POLY *cg);
57: POLY reduction1_sugar(POLY f,POLY g,int needSyz,POLY *c,POLY *h,int sugarGrade);
58: int isReducible_gen(POLY f,POLY g);
59: POLY reduction_gen(POLY f,struct gradedPolySet *gset,int needSyz,
60: struct syz0 *syzp);
61: POLY reduction_gen_rev(POLY f,struct gradedPolySet *gset,int needSyz,
62: struct syz0 *syzp);
63: POLY reduction_sugar(POLY f,struct gradedPolySet *gset,int needSyz,
64: struct syz0 *syzp,int sugarGrade);
65: POLY reduction1Cdr_gen(POLY f,POLY fs,POLY g,int needSyz,POLY *cc,POLY *cg);
66: POLY isCdrReducible_gen(POLY f,POLY g);
67: POLY reductionCdr_gen(POLY f,struct gradedPolySet *gset,int needSyz,
68: struct syz0 *syzp);
69: POLY lcm_gen(POLY f,POLY g);
70: struct spValue sp_gen(POLY f,POLY g);
71: struct spValue sp_q(POLY f,POLY g);
72: int grade_gen(POLY f);
1.3 takayama 73: POLY reductionCdr_except_grd_i(POLY f,struct gradedPolySet *gset,
74: int needSyz,struct syz0 *syzp,
75: int grd,int i, int *reduced);
76: /* Polynomial at (grd,i) is not used for reduction.
77: if del[j] == 1, then the attached polynomial is not used for reduction.*/
1.4 ! takayama 78:
! 79: /* ecart.c */
! 80: POLY reduction_ecart(POLY f,struct gradedPolySet *gset,
! 81: int needSyz,struct syz0 *syzp);
1.1 maekawa 82:
83: /* constructor */
84: POLY toSyzPoly(POLY cg,int grade,int index);
85: struct coeff *toSyzCoeff(POLY f);
86: void initSyzRingp(void);
87:
88: /* gb.c */
89: struct gradedPolySet *(*groebner)(struct arrayOfPOLY *f,
90: int needBack,
91: int needSyz, struct pair **grP,
92: int countDown,int forceReduction);
93: struct gradedPolySet *groebner_gen(struct arrayOfPOLY *f,
94: int needBack,
95: int needSyz, struct pair **grP,
96: int countDown,int forceReduction);
97: struct gradedPairs *updatePairs(struct gradedPairs *grD, POLY gt,
98: int gtGrade, int t,
99: struct gradedPolySet *grG);
100: /* add gt to grD. gt is indexed by (gtGrade,t) */
1.3 takayama 101: void toReducedBasis(struct gradedPolySet *grP,int needBack, int needSyz);
102:
1.1 maekawa 103:
104: /* gbGM.c */
105: struct gradedPolySet *groebner_gm(struct arrayOfPOLY *f,
106: int needBack,
107: int needSyz, struct pair **grP,
108: int countDown,int forceReduction);
109:
110: /* syz0 */
111: void simplifyBT(int grd,int index, struct gradedPolySet *grG);
112: /* grG->polys[i]->syz[j],mark[j] is modified. */
113:
114: void getBackwardTransformation(struct gradedPolySet *grG);
115: /* grG->polys[i]->syz[j],mark[j] is modified. */
116:
117: struct arrayOfPOLY *getSyzygy0(struct gradedPolySet *grG,
118: struct pair *zeroPairs);
119: /* grG->polys[i]->mark[j] are modified.
120: grG->polys[i]->del[j] and syz[j] must be set.
121: syz[j] is the result of the reduction by grBases. cf. getSyzygy(). */
122:
123: struct matrixOfPOLY *getSyzygy(struct gradedPolySet *grG,struct pair *zp,
124: struct gradedPolySet **grBasesp,
125: struct matrixOfPOLY **backwardMatp);
126: /* grBasesp is also returned. */
127:
128: POLY getSyzPolyFromSp(struct pair *spij,struct gradedPolySet *grG);
129: /* del and syz of grG and grBases must be properly set. mark of grG
130: will be modified. */
131:
132: struct matrixOfPOLY *getBackwardMatrixOfPOLY(struct gradedPolySet *grG);
133: /* get B */
134:
135: struct matrixOfPOLY *getSyzygy1(struct matrixOfPOLY *b,struct matrixOfPOLY *nc,
136: struct arrayOfPOLY *dc);
137:
138: struct matrixOfPOLY *getNC(struct gradedPolySet *newG,int n,
139: struct gradedPolySet *grBases);
140: /* get the numerator of C */
141:
142: struct arrayOfPOLY *getDC(struct gradedPolySet *newG);
143: /* diag(DC) f + C G = 0. */
144:
145: void errorSyz0(char *s);
146:
147: /* conversion */
148: struct arrayOfPOLY *syzPolyToArrayOfPOLY(int size,POLY f,
149: struct gradedPolySet *grG);
150: /* f is in SyzRingp. */
151:
152:
153: #define checkRingSp(f,g,r) {\
154: if ((f)->m->ringp != (g)->m->ringp) {\
155: warningPoly("f and g must be in a same ring. Returns 0.\n");\
156: fprintf(stderr,"f=%s\n",POLYToString(f,'*',0));\
157: fprintf(stderr,"g=%s\n",POLYToString(g,'*',0));\
158: r.a = ZERO; r.b = ZERO;\
159: return(r);\
160: }\
161: }
162:
163: #define checkRingIsR(f,g) {\
164: if ((f)->m->ringp != (g)->m->ringp) {\
165: warningPoly("f and g must be in a same ring. Returns 0.\n");\
166: fprintf(stderr,"f=%s\n",POLYToString(f,'*',0));\
167: fprintf(stderr,"g=%s\n",POLYToString(g,'*',0));\
168: return(0);\
169: }\
170: }
171:
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>