12 #define MORA_USE_BUCKETS
14 #define PRE_INTEGER_CHECK 0
146 if (ret < 0)
return ret;
176 d =
h->GetpFDeg()+
h->ecart;
178 h->SetShortExpVector();
188 ei = strat->
T[
j].ecart;
191 if (ei >
h->ecart && ii < strat->tl)
193 li = strat->
T[
j].length;
194 if (li<=0) li=strat->
T[
j].GetpLength();
204 if (
i > strat->
tl)
break;
205 if (strat->
T[
i].length<=0) strat->
T[
i].GetpLength();
206 if ((strat->
T[
i].ecart < ei || (strat->
T[
i].ecart == ei &&
207 strat->
T[
i].length < li))
214 if (strat->
T[
i].ecart < ei || (strat->
T[
i].ecart == ei &&
215 strat->
T[
i].length < li))
220 ei = strat->
T[
i].ecart;
221 if (ei <= h->ecart)
break;
222 li = strat->
T[
i].length;
240 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
277 else if (
h->t_p!=
NULL)
296 else if (
h->t_p!=
NULL)
307 h->SetShortExpVector();
312 h->ecart = d-
h->GetpFDeg();
314 h->ecart = d-
h->GetpFDeg()+ei-
h->ecart;
318 h->ecart =
h->pLDeg(strat->
LDegLast) -
h->GetpFDeg();
325 if (strat->
honey)
h->SetLength();
335 d =
h->GetpFDeg()+
h->ecart;
342 && ((d >= reddeg) || (pass > strat->
LazyPass)))
348 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
370 if (
h->pTotalDeg()+
h->ecart >= (
int)strat->
tailRing->bitmask)
375 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
392 d =
h->GetpFDeg()+
h->ecart;
394 h->SetShortExpVector();
413 if (
h->GetLmTailRing() ==
NULL)
422 ei = strat->
T[
j].ecart;
424 if (ei >
h->ecart && ii < strat->tl)
426 li = strat->
T[
j].length;
436 if (
i > strat->
tl)
break;
437 if ((strat->
T[
i].ecart < ei || (strat->
T[
i].ecart == ei &&
438 strat->
T[
i].length < li))
447 if (strat->
T[
i].ecart < ei || (strat->
T[
i].ecart == ei &&
448 strat->
T[
i].length < li))
453 ei = strat->
T[
i].ecart;
454 if (ei <= h->ecart)
break;
455 li = strat->
T[
i].length;
473 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
474 if (at <= strat->Ll &&
pLmCmp(
h->p, strat->
L[strat->
Ll].p) != 0 && !
nEqual(
h->p->coef, strat->
L[strat->
Ll].p->coef))
503 h->SetShortExpVector();
508 h->ecart = d-
h->GetpFDeg();
510 h->ecart = d-
h->GetpFDeg()+ei-
h->ecart;
514 h->ecart =
h->pLDeg(strat->
LDegLast) -
h->GetpFDeg();
517 d =
h->GetpFDeg()+
h->ecart;
524 && ((d >= reddeg) || (pass > strat->
LazyPass)))
530 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
552 if (
h->pTotalDeg()+
h->ecart >= (
int)strat->
tailRing->bitmask)
557 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
573 poly T0p = strat->
T[0].p;
574 int T0ecart = strat->
T[0].ecart;
577 d =
h->GetpFDeg()+
h->ecart;
579 h->SetShortExpVector();
580 if (strat->
T[0].GetpFDeg() == 0 && strat->
T[0].length <= 2) {
591 && T0ecart <= h->ecart) {
626 if (
h->GetLmTailRing() ==
NULL)
635 ei = strat->
T[
j].ecart;
638 if (ei >
h->ecart && ii < strat->tl)
640 li = strat->
T[
j].length;
650 if (
i > strat->
tl)
break;
651 if ((strat->
T[
i].ecart < ei || (strat->
T[
i].ecart == ei &&
652 strat->
T[
i].length < li))
661 if (strat->
T[
i].ecart < ei || (strat->
T[
i].ecart == ei &&
662 strat->
T[
i].length < li))
667 ei = strat->
T[
i].ecart;
668 if (ei <= h->ecart)
break;
669 li = strat->
T[
i].length;
688 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
689 if (at <= strat->Ll &&
pLmCmp(
h->p, strat->
L[strat->
Ll].p) != 0 && !
nEqual(
h->p->coef, strat->
L[strat->
Ll].p->coef))
718 h->SetShortExpVector();
723 h->ecart = d-
h->GetpFDeg();
725 h->ecart = d-
h->GetpFDeg()+ei-
h->ecart;
729 h->ecart =
h->pLDeg(strat->
LDegLast) -
h->GetpFDeg();
732 d =
h->GetpFDeg()+
h->ecart;
739 && ((d >= reddeg) || (pass > strat->
LazyPass)))
745 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
767 if (
h->pTotalDeg()+
h->ecart >= (
int)strat->
tailRing->bitmask)
772 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
788 if (strat->
tl<0)
return 1;
789 if (
h->IsNull())
return 0;
799 d =
h->GetpFDeg() +
h->ecart;
802 h->SetShortExpVector();
808 h->SetDegStuffReturnLDeg(strat->
LDegLast);
849 else if (
h->t_p!=
NULL)
868 else if (
h->t_p!=
NULL)
877 h->SetShortExpVector();
890 h->SetDegStuffReturnLDeg(strat->
LDegLast);
900 if (strat->
T[
j].ecart <=
h->ecart)
901 h->ecart = d -
h->GetpFDeg();
903 h->ecart = d -
h->GetpFDeg() + strat->
T[
j].ecart -
h->ecart;
905 d =
h->GetpFDeg() +
h->ecart;
908 d =
h->SetDegStuffReturnLDeg(strat->
LDegLast);
918 && ((d >= reddeg) || (pass > strat->
LazyPass)))
923 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
947 if (
h->pTotalDeg()+
h->ecart >= (
int)strat->
tailRing->bitmask)
952 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
973 int o =
H.SetpFDeg();
977 unsigned long not_sev = ~
H.sev;
994 int ei = strat->
T[
j].ecart;
995 int li = strat->
T[
j].length;
1006 if (
j > strat->
tl)
break;
1007 if (ei <=
H.ecart)
break;
1008 if (((strat->
T[
j].ecart < ei)
1009 || ((strat->
T[
j].ecart == ei)
1010 && (strat->
T[
j].length < li)))
1018 ei = strat->
T[
j].ecart;
1019 li = strat->
T[
j].length;
1074 poly T0p = strat->
T[0].p;
1075 int T0ecart = strat->
T[0].ecart;
1076 int o =
H.SetpFDeg();
1080 unsigned long not_sev = ~
H.sev;
1081 if (strat->
T[0].GetpFDeg() == 0 && strat->
T[0].length <= 2) {
1092 && T0ecart <=
H.ecart) {
1126 int ei = strat->
T[
j].ecart;
1127 int li = strat->
T[
j].length;
1138 if (
j > strat->
tl)
break;
1139 if (ei <=
H.ecart)
break;
1140 if (((strat->
T[
j].ecart < ei)
1141 || ((strat->
T[
j].ecart == ei)
1142 && (strat->
T[
j].length < li)))
1151 ei = strat->
T[
j].ecart;
1152 li = strat->
T[
j].length;
1208 for (
i=1;
i<=strat->
Ll;
i++)
1210 at = strat->
posInL(strat->
L,
i-1,&(strat->
L[
i]),strat);
1214 for (
j=
i-1;
j>=at;
j--) strat->
L[
j+1] = strat->
L[
j];
1230 for (
i=1;
i<=strat->
tl;
i++)
1232 if (strat->
T[
i-1].length > strat->
T[
i].length)
1235 sev = strat->
sevT[
i];
1241 if (strat->
T[
i].length > strat->
T[at].length)
break;
1243 for (
j =
i-1;
j>at;
j--)
1245 strat->
T[
j+1]=strat->
T[
j];
1247 strat->
R[strat->
T[
j+1].i_r] = &(strat->
T[
j+1]);
1250 strat->
sevT[at+1] = sev;
1251 strat->
R[
p.i_r] = &(strat->
T[at+1]);
1327 if (L->bucket !=
NULL)
1349 int op=
p->GetpFDeg() +
p->ecart;
1357 && (set[
j].GetpFDeg()+set[
j].ecart >= op))
1385 p=strat->
L[strat->
Ll];
1386 strat->
L[strat->
Ll]=strat->
L[
j];
1419 strat->
L[
j].SetLmCurrRing();
1431 p=strat->
L[strat->
Ll];
1432 strat->
L[strat->
Ll]=strat->
L[
j];
1451 while (i <= strat->Ll)
1484 if (! strat->
L[
i].IsNull())
1486 strat->
L[
i].SetLmCurrRing();
1487 strat->
L[
i].SetpFDeg();
1489 = strat->
L[
i].pLDeg(strat->
LDegLast) - strat->
L[
i].GetpFDeg();
1496 if (strat->
L[
i].IsNull())
1518 while (i <= strat->tl)
1526 if (
p.p != strat->
T[
i].p)
1554 for (
i=strat->
Ll;
i>=0;
i--)
1556 strat->
L[
i].SetpFDeg();
1558 for (
i=strat->
tl;
i>=0;
i--)
1560 strat->
T[
i].SetpFDeg();
1612 Print(
"new s%d:",atS);
1823 strat->
HCord = 32000;
1864 int hilbeledeg=1,hilbcount=0;
1907 #ifdef HAVE_TAIL_RING
1921 while (strat->
Ll >= 0)
1928 while (strat->
Ll >= 0)
1933 && (strat->
L[strat->
Ll].ecart+strat->
L[strat->
Ll].GetpFDeg()>
Kstd1_deg))
1940 while ((strat->
Ll >= 0)
1941 && (strat->
L[strat->
Ll].p1!=
NULL) && (strat->
L[strat->
Ll].p2!=
NULL)
1942 && (strat->
L[strat->
Ll].ecart+strat->
L[strat->
Ll].GetpFDeg()>
Kstd1_deg)
1951 if (strat->
Ll<0)
break;
1954 strat->
P = strat->
L[strat->
Ll];
1981 else if (strat->
P.p1 ==
NULL)
1989 if (!strat->
P.IsNull())
1993 message(strat->
P.ecart+strat->
P.GetpFDeg(),&olddeg,&reduc,strat, red_result);
1995 red_result = strat->
red(&strat->
P,strat);
1999 if (! strat->
P.IsNull())
2006 strat->
P.pCleardenom();
2010 strat->
P.p =
redtail(&(strat->
P),strat->
sl,strat);
2011 if (strat->
P.p==
NULL)
2013 WerrorS(
"expoent overflow - wrong ordering");
2022 if ((strat->
P.p->next==
NULL)
2024 strat->
P.pCleardenom();
2034 posInS(strat,strat->
sl,strat->
P.p, strat->
P.ecart),
2040 khCheck(
Q,
w,hilb,hilbeledeg,hilbcount,strat);
2105 return (strat->
Shdl);
2180 for (
i=strat->
sl;
i>=0;
i--)
2184 for (
i=0;
i<=strat->
sl;
i++)
2324 for (
i=strat->
sl;
i>=0;
i--)
2338 for (
j=0;
j<=strat->
sl;
j++)
2414 return o+(*kModW)[
i-1];
2422 for (
i=r->N;
i>0;
i--)
2427 return j+(*kModW)[
i-1];
2434 return idInit(1,F->rank);
2436 #ifdef HAVE_SHIFTBBA
2519 #if PRE_INTEGER_CHECK
2574 r=
mora(FCopy,
Q,*
w,hilb,strat);
2576 r=
bba(FCopy,
Q,*
w,hilb,strat);
2593 r=
mora(F,
Q,*
w,hilb,strat);
2595 r=
bba(F,
Q,*
w,hilb,strat);
2616 int newIdeal,
intvec *vw)
2619 return idInit(1,F->rank);
2719 r=
mora(F,
Q,*
w,hilb,strat);
2727 r=
sba(F,
Q,*
w,hilb,strat);
2755 bool sigdrop =
TRUE;
2757 int totalsbaruns = 1,blockedreductions = 20,blockred = 0,loops = 0;
2758 while(sigdrop && (loops < totalsbaruns || totalsbaruns == -1)
2759 && (blockred <= blockedreductions))
2870 r=
mora(F,
Q,*
w,hilb,strat);
2877 r=
sba(r,
Q,*
w,hilb,strat);
2902 if(sigdrop || blockred > blockedreductions)
2904 r =
kStd(r,
Q,
h,
w, hilb, syzComp, newIdeal, vw);
2910 #ifdef HAVE_SHIFTBBA
2985 WerrorS(
"No local ordering possible for shift algebra");
3021 int syzComp,
int reduced)
3026 return idInit(1,F->rank);
3061 strat->
minim=(reduced % 2)+1;
3110 r=
mora(F,
Q,*
w,hilb,strat);
3117 r=
bba(F,
Q,*
w,hilb,strat);
3135 if ((delete_w)&&(temp_w!=
NULL))
delete temp_w;
3143 else if (strat->
M==
NULL)
3146 WarnS(
"no minimal generating set computed");
3169 poly
kNF(ideal F, ideal
Q, poly
p,
int syzComp,
int lazyReduce)
3204 #ifdef HAVE_SHIFTBBA
3207 WerrorS(
"No local ordering possible for shift algebra");
3266 ideal
kNF(ideal F, ideal
Q, ideal
p,
int syzComp,
int lazyReduce)
3308 #ifdef HAVE_SHIFTBBA
3311 WerrorS(
"No local ordering possible for shift algebra");
3380 poly
k_NF (ideal F, ideal
Q, poly
p,
int syzComp,
int lazyReduce,
const ring _currRing)
3384 poly ret =
kNF(F,
Q,
p, syzComp, lazyReduce);
3438 initS(tempF, tempQ, strat);
3468 ideal shdl=strat->
Shdl;
3542 withT = ! strat->
homog;
3547 #ifdef HAVE_TAIL_RING
3552 while (strat->
Ll >= 0)
3559 strat->
P = strat->
L[strat->
Ll];
3562 if (strat->
P.p1 ==
NULL)
3568 if (strat->
P.p ==
NULL && strat->
P.t_p ==
NULL)
3576 &olddeg,&reduc,strat, red_result);
3579 red_result = strat->
red(&strat->
P,strat);
3583 if (red_result == 1)
3589 strat->
P.GetP(strat->
lmBin);
3591 int pos=
posInS(strat,strat->
sl,strat->
P.p,strat->
P.ecart);
3598 strat->
P.pCleardenom();
3602 strat->
P.p =
redtailBba(&(strat->
P),pos-1,strat, withT);
3603 strat->
P.pCleardenom();
3611 strat->
P.p =
redtailBba(&(strat->
P),pos-1,strat, withT);
3623 strat->
enterS(strat->
P, pos, strat, strat->
tl);
3631 for(;ii<=strat->
sl;ii++)
3636 h.p=strat->
S[ii]; strat->
S[ii]=
NULL;
3638 h.sev=strat->
sevS[ii];
3642 if (strat->
T[jj].p==
h.p)
3644 strat->
T[jj].p=
NULL;
3647 memmove(&(strat->
T[jj]),&(strat->
T[jj+1]),
3648 (strat->
tl-jj)*
sizeof(strat->
T[jj]));
3649 memmove(&(strat->
sevT[jj]),&(strat->
sevT[jj+1]),
3650 (strat->
tl-jj)*
sizeof(strat->
sevT[jj]));
3657 int lpos=strat->
posInL(strat->
L,strat->
Ll,&
h,strat);
3662 Print(
"move S[%d] -> L[%d]: ",ii,pos);
3670 for(ii=pos+1;ii<=strat->
sl;ii++) strat->
fromQ[ii]=0;
3708 #ifdef HAVE_TAIL_RING
3791 while (need_retry && (counter>0))
3797 int new_elems=
idElem(res1);
3798 counter -= (new_elems >= elems);
3801 if (
idElem(res1)<=1) need_retry=0;
3823 #ifdef MORA_USE_BUCKETS
static int si_max(const int a, const int b)
static CanonicalForm bound(const CFMatrix &M)
KINLINE poly kNoetherTail()
void(* chainCrit)(poly p, int ecart, kStrategy strat)
pFDegProc pOrigFDeg_TailRing
BOOLEAN(* rewCrit1)(poly sig, unsigned long not_sevSig, poly lm, kStrategy strat, int start)
BOOLEAN(* rewCrit3)(poly sig, unsigned long not_sevSig, poly lm, kStrategy strat, int start)
int(* red2)(LObject *L, kStrategy strat)
int(* posInL)(const LSet set, const int length, LObject *L, const kStrategy strat)
int(* posInLOld)(const LSet Ls, const int Ll, LObject *Lo, const kStrategy strat)
void(* initEcartPair)(LObject *h, poly f, poly g, int ecartF, int ecartG)
void(* enterS)(LObject &h, int pos, kStrategy strat, int atR)
char completeReduce_retry
void(* initEcart)(TObject *L)
void(* enterOnePair)(int i, poly p, int ecart, int isFromQ, kStrategy strat, int atR)
int(* posInT)(const TSet T, const int tl, LObject &h)
int(* red)(LObject *L, kStrategy strat)
BOOLEAN(* rewCrit2)(poly sig, unsigned long not_sevSig, poly lm, kStrategy strat, int start)
char posInLDependsOnLength
pLDegProc pOrigLDeg_TailRing
static FORCE_INLINE BOOLEAN nCoeff_is_Z(const coeffs r)
static FORCE_INLINE BOOLEAN n_IsUnit(number n, const coeffs r)
TRUE iff n has a multiplicative inverse in the given coeff field/ring r.
static FORCE_INLINE number n_QuotRem(number a, number b, number *q, const coeffs r)
static FORCE_INLINE BOOLEAN n_DivBy(number a, number b, const coeffs r)
test whether 'a' is divisible 'b'; for r encoding a field: TRUE iff 'b' does not represent zero in Z:...
void WerrorS(const char *s)
int scMult0Int(ideal S, ideal Q, const ring tailRing)
#define idDelete(H)
delete an ideal
#define idSimpleAdd(A, B)
BOOLEAN idInsertPoly(ideal h1, poly h2)
insert h2 into h1 (if h2 is not the zero polynomial) return TRUE iff h2 was indeed inserted
BOOLEAN idIs0(ideal h)
returns true if h is the zero ideal
static BOOLEAN idHomModule(ideal m, ideal Q, intvec **w)
static BOOLEAN idHomIdeal(ideal id, ideal Q=NULL)
static BOOLEAN length(leftv result, leftv arg)
KINLINE unsigned long * initsevT()
KINLINE poly redtailBba(poly p, int pos, kStrategy strat, BOOLEAN normalize)
KINLINE BOOLEAN arriRewDummy(poly, unsigned long, poly, kStrategy, int)
KINLINE TObject ** initR()
int redLiftstd(LObject *h, kStrategy strat)
static ideal nc_GB(const ideal F, const ideal Q, const intvec *w, const intvec *hilb, kStrategy strat, const ring r)
void khCheckLocInhom(ideal Q, intvec *w, intvec *hilb, int &count, kStrategy strat)
void khCheck(ideal Q, intvec *w, intvec *hilb, int &eledeg, int &count, kStrategy strat)
int ksReducePolyLC(LObject *PR, TObject *PW, poly spNoether, number *coef, kStrategy strat)
void ksCreateSpoly(LObject *Pair, poly spNoether, int use_buckets, ring tailRing, poly m1, poly m2, TObject **R)
int ksReducePoly(LObject *PR, TObject *PW, poly spNoether, number *coef, poly *mon, kStrategy strat)
ideal kInterRedOld(ideal F, ideal Q)
void reorderT(kStrategy strat)
poly kNFBound(ideal F, ideal Q, poly p, int bound, int syzComp, int lazyReduce)
ideal mora(ideal F, ideal Q, intvec *w, intvec *hilb, kStrategy strat)
void initMora(ideal F, kStrategy strat)
int redFirst(LObject *h, kStrategy strat)
void firstUpdate(kStrategy strat)
poly k_NF(ideal F, ideal Q, poly p, int syzComp, int lazyReduce, const ring _currRing)
NOTE: this is just a wrapper which sets currRing for the actual kNF call.
int redEcart(LObject *h, kStrategy strat)
void enterSMoraNF(LObject &p, int atS, kStrategy strat, int atR=-1)
long kModDeg(poly p, ring r)
static int doRed(LObject *h, TObject *with, BOOLEAN intoT, kStrategy strat, bool redMoraNF)
ideal kMin_std(ideal F, ideal Q, tHomog h, intvec **w, ideal &M, intvec *hilb, int syzComp, int reduced)
void updateLHC(kStrategy strat)
ideal kStdShift(ideal F, ideal Q, tHomog h, intvec **w, intvec *hilb, int syzComp, int newIdeal, intvec *vw, BOOLEAN rightGB)
ideal kInterRed(ideal F, ideal Q)
void missingAxis(int *last, kStrategy strat)
void reorderL(kStrategy strat)
int posInL10(const LSet set, const int length, LObject *p, const kStrategy strat)
ideal kInterRedBba(ideal F, ideal Q, int &need_retry)
static BOOLEAN kMoraUseBucket(kStrategy strat)
poly kNF1(ideal F, ideal Q, poly q, kStrategy strat, int lazyReduce)
static void kOptimizeLDeg(pLDegProc ldeg, kStrategy strat)
void initBba(kStrategy strat)
int redRiloc(LObject *h, kStrategy strat)
void initSba(ideal F, kStrategy strat)
long kHomModDeg(poly p, ring r)
static poly redMoraNFRing(poly h, kStrategy strat, int flag)
void kDebugPrint(kStrategy strat)
void enterSMora(LObject &p, int atS, kStrategy strat, int atR=-1)
void updateL(kStrategy strat)
void updateT(kStrategy strat)
BOOLEAN hasPurePower(const poly p, int last, int *length, kStrategy strat)
poly kNF(ideal F, ideal Q, poly p, int syzComp, int lazyReduce)
static poly redMoraNF(poly h, kStrategy strat, int flag)
int redRiloc_Z(LObject *h, kStrategy strat)
ideal kSba(ideal F, ideal Q, tHomog h, intvec **w, int sbaOrder, int arri, intvec *hilb, int syzComp, int newIdeal, intvec *vw)
ideal kStd(ideal F, ideal Q, tHomog h, intvec **w, intvec *hilb, int syzComp, int newIdeal, intvec *vw, s_poly_proc_t sp)
BOOLEAN(* s_poly_proc_t)(kStrategy strat)
int redRing_Z(LObject *h, kStrategy strat)
int kFindDivisibleByInS(const kStrategy strat, int *max_ind, LObject *L)
return -1 if no divisor is found number of first divisor in S, otherwise
int kTestDivisibleByT0_Z(const kStrategy strat, const LObject *L)
tests if T[0] divides the leading monomial of L, returns -1 if not
poly kNF2(ideal F, ideal Q, poly q, kStrategy strat, int lazyReduce)
int redHoney(LObject *h, kStrategy strat)
int redHomog(LObject *h, kStrategy strat)
ideal sba(ideal F0, ideal Q, intvec *w, intvec *hilb, kStrategy strat)
ideal bba(ideal F, ideal Q, intvec *w, intvec *hilb, kStrategy strat)
int redLazy(LObject *h, kStrategy strat)
int redSigRing(LObject *h, kStrategy strat)
int redSig(LObject *h, kStrategy strat)
poly kNF2Bound(ideal F, ideal Q, poly q, int bound, kStrategy strat, int lazyReduce)
int redRing(LObject *h, kStrategy strat)
int kFindDivisibleByInT(const kStrategy strat, const LObject *L, const int start)
return -1 if no divisor is found number of first divisor in T, otherwise
ideal bbaShift(ideal F, ideal Q, intvec *w, intvec *hilb, kStrategy strat)
void message(int i, int *reduc, int *olddeg, kStrategy strat, int red_result)
poly redtail(LObject *L, int end_pos, kStrategy strat)
int posInT17(const TSet set, const int length, LObject &p)
void initBuchMora(ideal F, ideal Q, kStrategy strat)
BOOLEAN arriRewCriterionPre(poly sig, unsigned long not_sevSig, poly lm, kStrategy strat, int)
void enterT(LObject &p, kStrategy strat, int atT)
BOOLEAN arriRewCriterion(poly, unsigned long, poly, kStrategy strat, int start=0)
void enterSSba(LObject &p, int atS, kStrategy strat, int atR)
BOOLEAN kTest(kStrategy strat)
BOOLEAN kTest_TS(kStrategy strat)
void enterOnePairNormal(int i, poly p, int ecart, int isFromQ, kStrategy strat, int atR=-1)
void enterL(LSet *set, int *length, int *LSetmax, LObject p, int at)
BOOLEAN faugereRewCriterion(poly sig, unsigned long not_sevSig, poly, kStrategy strat, int start=0)
int posInT2(const TSet set, const int length, LObject &p)
BOOLEAN kTest_L(LObject *L, ring strat_tailRing, BOOLEAN testp, int lpos, TSet T, int tlength)
void enterpairs(poly h, int k, int ecart, int pos, kStrategy strat, int atR)
void initHilbCrit(ideal, ideal, intvec **hilb, kStrategy strat)
void initEcartPairMora(LObject *Lp, poly, poly, int ecartF, int ecartG)
void initBuchMoraPos(kStrategy strat)
void initS(ideal F, ideal Q, kStrategy strat)
BOOLEAN kStratChangeTailRing(kStrategy strat, LObject *L, TObject *T, unsigned long expbound)
int posInL0(const LSet set, const int length, LObject *p, const kStrategy)
void chainCritOpt_1(poly, int, kStrategy strat)
void enterT_strong(LObject &p, kStrategy strat, int atT)
void postReduceByMon(LObject *h, kStrategy strat)
used for GB over ZZ: intermediate reduction by monomial elements background: any known constant eleme...
void HEckeTest(poly pp, kStrategy strat)
void exitBuchMora(kStrategy strat)
void initEcartNormal(TObject *h)
int posInS(const kStrategy strat, const int length, const poly p, const int ecart_p)
void updateS(BOOLEAN toT, kStrategy strat)
BOOLEAN kCheckSpolyCreation(LObject *L, kStrategy strat, poly &m1, poly &m2)
void cleanT(kStrategy strat)
void deleteHC(LObject *L, kStrategy strat, BOOLEAN fromNext)
void updateResult(ideal r, ideal Q, kStrategy strat)
void superenterpairs(poly h, int k, int ecart, int pos, kStrategy strat, int atR)
void deleteInL(LSet set, int *length, int j, kStrategy strat)
void kStratInitChangeTailRing(kStrategy strat)
void initBuchMoraCrit(kStrategy strat)
void completeReduce(kStrategy strat, BOOLEAN withT)
void initBuchMoraPosRing(kStrategy strat)
BOOLEAN kTest_T(TObject *T, ring strat_tailRing, int i, char TN)
void messageSets(kStrategy strat)
poly preIntegerCheck(const ideal Forig, const ideal Q)
used for GB over ZZ: look for constant and monomial elements in the ideal background: any known const...
void chainCritNormal(poly p, int ecart, kStrategy strat)
void initEcartBBA(TObject *h)
void initEcartPairBba(LObject *Lp, poly, poly, int, int)
void messageStat(int hilbcount, kStrategy strat)
void finalReduceByMon(kStrategy strat)
used for GB over ZZ: final reduction by constant elements background: any known constant element of i...
void enterSBba(LObject &p, int atS, kStrategy strat, int atR)
BOOLEAN newHEdge(kStrategy strat)
void cancelunit(LObject *L, BOOLEAN inNF)
static void kDeleteLcm(LObject *P)
static bool rIsSCA(const ring r)
ideal id_KillSquares(const ideal id, const short iFirstAltVar, const short iLastAltVar, const ring r, const bool bSkipZeroes)
poly p_KillSquares(const poly p, const short iFirstAltVar, const short iLastAltVar, const ring r)
void mult(unsigned long *result, unsigned long *a, unsigned long *b, unsigned long p, int dega, int degb)
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
#define __p_GetComp(p, r)
#define omFreeSize(addr, size)
omError_t omTestMemory(int check_level)
#define TEST_OPT_INTSTRATEGY
#define SI_RESTORE_OPT1(A)
#define OPT_NOTREGULARITY
#define TEST_OPT_DEGBOUND
#define TEST_OPT_RETURN_SB
#define TEST_OPT_MULTBOUND
#define TEST_OPT_REDTHROUGH
#define TEST_OPT_REDTAIL_SYZ
#define TEST_OPT_STAIRCASEBOUND
#define TEST_OPT_NOT_BUCKETS
pShallowCopyDeleteProc pGetShallowCopyDeleteProc(ring, ring)
int p_IsPurePower(const poly p, const ring r)
return i, if head depends only on var(i)
void pRestoreDegProcs(ring r, pFDegProc old_FDeg, pLDegProc old_lDeg)
long pLDeg0c(poly p, int *l, const ring r)
long pLDeg0(poly p, int *l, const ring r)
void pSetDegProcs(ring r, pFDegProc new_FDeg, pLDegProc new_lDeg)
long p_WDegree(poly p, const ring r)
static void p_LmDelete(poly p, const ring r)
static long p_MinComp(poly p, ring lmRing, ring tailRing)
#define pp_Test(p, lmRing, tailRing)
static BOOLEAN p_LmShortDivisibleBy(poly a, unsigned long sev_a, poly b, unsigned long not_sev_b, const ring r)
static long p_GetExp(const poly p, const unsigned long iBitmask, const int VarOffset)
get a single variable exponent @Note: the integer VarOffset encodes:
static void p_Delete(poly *p, const ring r)
static unsigned pLength(poly a)
void p_wrp(poly p, ring lmRing, ring tailRing)
void rChangeCurrRing(ring r)
VAR ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
Compatiblity layer for legacy polynomial operations (over currRing)
#define pHead(p)
returns newly allocated copy of Lm(p), coef is copied, next=NULL, p might be NULL
#define pIsConstant(p)
like above, except that Comp must be 0
#define pGetComp(p)
Component.
#define pLmShortDivisibleBy(a, sev_a, b, not_sev_b)
Divisibility tests based on Short Exponent vectors sev_a == pGetShortExpVector(a) not_sev_b == ~ pGet...
#define pLmDelete(p)
assume p != NULL, deletes Lm(p)->coef and Lm(p)
#define pGetShortExpVector(a)
returns the "Short Exponent Vector" – used to speed up divisibility tests (see polys-impl....
static void pLmFree(poly p)
frees the space of the monomial m, assumes m != NULL coef is not freed, m is not advanced
#define pSetmComp(p)
TODO:
void pNorm(poly p, const ring R=currRing)
#define pLmCmp(p, q)
returns 0|1|-1 if p=q|p>q|p<q w.r.t monomial ordering
#define pCopy(p)
return a copy of the poly
void PrintS(const char *s)
void Werror(const char *fmt,...)
static BOOLEAN rField_is_Ring(const ring r)
static BOOLEAN rField_is_Z(const ring r)
static BOOLEAN rIsPluralRing(const ring r)
we must always have this test!
long(* pLDegProc)(poly p, int *length, ring r)
static BOOLEAN rIsLPRing(const ring r)
static BOOLEAN rField_is_numeric(const ring r)
BOOLEAN rHasMixedOrdering(const ring r)
static short rVar(const ring r)
#define rVar(r) (r->N)
BOOLEAN rHasGlobalOrdering(const ring r)
BOOLEAN rHasLocalOrMixedOrdering(const ring r)
static BOOLEAN rField_has_simple_inverse(const ring r)
ideal SCAQuotient(const ring r)
static short scaLastAltVar(ring r)
static short scaFirstAltVar(ring r)
ideal idInit(int idsize, int rank)
initialise an ideal / module
void id_Delete(ideal *h, ring r)
deletes an ideal/module/matrix
int idElem(const ideal F)
count non-zero elements
long id_RankFreeModule(ideal s, ring lmRing, ring tailRing)
return the maximal component number found in any polynomial in s
void idSkipZeroes(ideal ide)
gives an ideal/module the minimal possible size
long totaldegreeWecart(poly p, ring r)
long maxdegreeWecart(poly p, int *l, ring r)
void kEcartWeights(poly *s, int sl, short *eweight, const ring R)
EXTERN_VAR short * ecartWeights