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;
203 if (
i > strat->
tl)
break;
204 if ((strat->
T[
i].ecart < ei || (strat->
T[
i].ecart == ei &&
205 strat->
T[
i].length < li))
212 if (strat->
T[
i].ecart < ei || (strat->
T[
i].ecart == ei &&
213 strat->
T[
i].length < li))
218 ei = strat->
T[
i].ecart;
219 if (ei <= h->ecart)
break;
220 li = strat->
T[
i].length;
238 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
275 else if (
h->t_p!=
NULL)
294 else if (
h->t_p!=
NULL)
305 h->SetShortExpVector();
310 h->ecart = d-
h->GetpFDeg();
312 h->ecart = d-
h->GetpFDeg()+ei-
h->ecart;
316 h->ecart =
h->pLDeg(strat->
LDegLast) -
h->GetpFDeg();
323 if (strat->
honey)
h->SetLength();
333 d =
h->GetpFDeg()+
h->ecart;
340 && ((d >= reddeg) || (pass > strat->
LazyPass)))
346 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
368 if (
h->pTotalDeg()+
h->ecart >= (
int)strat->
tailRing->bitmask)
373 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
390 d =
h->GetpFDeg()+
h->ecart;
392 h->SetShortExpVector();
411 if (
h->GetLmTailRing() ==
NULL)
420 ei = strat->
T[
j].ecart;
422 if (ei >
h->ecart && ii < strat->tl)
424 li = strat->
T[
j].length;
434 if (
i > strat->
tl)
break;
435 if ((strat->
T[
i].ecart < ei || (strat->
T[
i].ecart == ei &&
436 strat->
T[
i].length < li))
445 if (strat->
T[
i].ecart < ei || (strat->
T[
i].ecart == ei &&
446 strat->
T[
i].length < li))
451 ei = strat->
T[
i].ecart;
452 if (ei <= h->ecart)
break;
453 li = strat->
T[
i].length;
471 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
472 if (at <= strat->Ll &&
pLmCmp(
h->p, strat->
L[strat->
Ll].p) != 0 && !
nEqual(
h->p->coef, strat->
L[strat->
Ll].p->coef))
501 h->SetShortExpVector();
506 h->ecart = d-
h->GetpFDeg();
508 h->ecart = d-
h->GetpFDeg()+ei-
h->ecart;
512 h->ecart =
h->pLDeg(strat->
LDegLast) -
h->GetpFDeg();
515 d =
h->GetpFDeg()+
h->ecart;
522 && ((d >= reddeg) || (pass > strat->
LazyPass)))
528 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
550 if (
h->pTotalDeg()+
h->ecart >= (
int)strat->
tailRing->bitmask)
555 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
571 poly T0p = strat->
T[0].p;
572 int T0ecart = strat->
T[0].ecart;
575 d =
h->GetpFDeg()+
h->ecart;
577 h->SetShortExpVector();
578 if (strat->
T[0].GetpFDeg() == 0 && strat->
T[0].length <= 2) {
589 && T0ecart <= h->ecart) {
624 if (
h->GetLmTailRing() ==
NULL)
633 ei = strat->
T[
j].ecart;
636 if (ei >
h->ecart && ii < strat->tl)
638 li = strat->
T[
j].length;
648 if (
i > strat->
tl)
break;
649 if ((strat->
T[
i].ecart < ei || (strat->
T[
i].ecart == ei &&
650 strat->
T[
i].length < li))
659 if (strat->
T[
i].ecart < ei || (strat->
T[
i].ecart == ei &&
660 strat->
T[
i].length < li))
665 ei = strat->
T[
i].ecart;
666 if (ei <= h->ecart)
break;
667 li = strat->
T[
i].length;
686 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
687 if (at <= strat->Ll &&
pLmCmp(
h->p, strat->
L[strat->
Ll].p) != 0 && !
nEqual(
h->p->coef, strat->
L[strat->
Ll].p->coef))
716 h->SetShortExpVector();
721 h->ecart = d-
h->GetpFDeg();
723 h->ecart = d-
h->GetpFDeg()+ei-
h->ecart;
727 h->ecart =
h->pLDeg(strat->
LDegLast) -
h->GetpFDeg();
730 d =
h->GetpFDeg()+
h->ecart;
737 && ((d >= reddeg) || (pass > strat->
LazyPass)))
743 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
765 if (
h->pTotalDeg()+
h->ecart >= (
int)strat->
tailRing->bitmask)
770 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
786 if (
h->IsNull())
return 0;
795 d =
h->GetpFDeg() +
h->ecart;
798 h->SetShortExpVector();
804 h->SetDegStuffReturnLDeg(strat->
LDegLast);
845 else if (
h->t_p!=
NULL)
864 else if (
h->t_p!=
NULL)
873 h->SetShortExpVector();
886 h->SetDegStuffReturnLDeg(strat->
LDegLast);
896 if (strat->
T[
j].ecart <=
h->ecart)
897 h->ecart = d -
h->GetpFDeg();
899 h->ecart = d -
h->GetpFDeg() + strat->
T[
j].ecart -
h->ecart;
901 d =
h->GetpFDeg() +
h->ecart;
904 d =
h->SetDegStuffReturnLDeg(strat->
LDegLast);
913 && ((d >= reddeg) || (pass > strat->
LazyPass)))
918 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
936 if (
h->pTotalDeg()+
h->ecart >= (
int)strat->
tailRing->bitmask)
941 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
962 int o =
H.SetpFDeg();
966 unsigned long not_sev = ~
H.sev;
983 int ei = strat->
T[
j].ecart;
984 int li = strat->
T[
j].length;
995 if (
j > strat->
tl)
break;
996 if (ei <=
H.ecart)
break;
997 if (((strat->
T[
j].ecart < ei)
998 || ((strat->
T[
j].ecart == ei)
999 && (strat->
T[
j].length < li)))
1007 ei = strat->
T[
j].ecart;
1008 li = strat->
T[
j].length;
1063 poly T0p = strat->
T[0].p;
1064 int T0ecart = strat->
T[0].ecart;
1065 int o =
H.SetpFDeg();
1069 unsigned long not_sev = ~
H.sev;
1070 if (strat->
T[0].GetpFDeg() == 0 && strat->
T[0].length <= 2) {
1081 && T0ecart <=
H.ecart) {
1115 int ei = strat->
T[
j].ecart;
1116 int li = strat->
T[
j].length;
1127 if (
j > strat->
tl)
break;
1128 if (ei <=
H.ecart)
break;
1129 if (((strat->
T[
j].ecart < ei)
1130 || ((strat->
T[
j].ecart == ei)
1131 && (strat->
T[
j].length < li)))
1140 ei = strat->
T[
j].ecart;
1141 li = strat->
T[
j].length;
1197 for (
i=1;
i<=strat->
Ll;
i++)
1199 at = strat->
posInL(strat->
L,
i-1,&(strat->
L[
i]),strat);
1203 for (
j=
i-1;
j>=at;
j--) strat->
L[
j+1] = strat->
L[
j];
1219 for (
i=1;
i<=strat->
tl;
i++)
1221 if (strat->
T[
i-1].length > strat->
T[
i].length)
1224 sev = strat->
sevT[
i];
1230 if (strat->
T[
i].length > strat->
T[at].length)
break;
1232 for (
j =
i-1;
j>at;
j--)
1234 strat->
T[
j+1]=strat->
T[
j];
1236 strat->
R[strat->
T[
j+1].i_r] = &(strat->
T[
j+1]);
1239 strat->
sevT[at+1] = sev;
1240 strat->
R[
p.i_r] = &(strat->
T[at+1]);
1316 if (L->bucket !=
NULL)
1338 int op=
p->GetpFDeg() +
p->ecart;
1346 && (set[
j].GetpFDeg()+set[
j].ecart >= op))
1374 p=strat->
L[strat->
Ll];
1375 strat->
L[strat->
Ll]=strat->
L[
j];
1408 strat->
L[
j].SetLmCurrRing();
1420 p=strat->
L[strat->
Ll];
1421 strat->
L[strat->
Ll]=strat->
L[
j];
1440 while (i <= strat->Ll)
1473 if (! strat->
L[
i].IsNull())
1475 strat->
L[
i].SetLmCurrRing();
1476 strat->
L[
i].SetpFDeg();
1478 = strat->
L[
i].pLDeg(strat->
LDegLast) - strat->
L[
i].GetpFDeg();
1485 if (strat->
L[
i].IsNull())
1507 while (i <= strat->tl)
1515 if (
p.p != strat->
T[
i].p)
1543 for (
i=strat->
Ll;
i>=0;
i--)
1545 strat->
L[
i].SetpFDeg();
1547 for (
i=strat->
tl;
i>=0;
i--)
1549 strat->
T[
i].SetpFDeg();
1601 Print(
"new s%d:",atS);
1812 strat->
HCord = 32000;
1853 int hilbeledeg=1,hilbcount=0;
1896 #ifdef HAVE_TAIL_RING
1910 while (strat->
Ll >= 0)
1917 while (strat->
Ll >= 0)
1922 && (strat->
L[strat->
Ll].ecart+strat->
L[strat->
Ll].GetpFDeg()>
Kstd1_deg))
1929 while ((strat->
Ll >= 0)
1930 && (strat->
L[strat->
Ll].p1!=
NULL) && (strat->
L[strat->
Ll].p2!=
NULL)
1931 && (strat->
L[strat->
Ll].ecart+strat->
L[strat->
Ll].GetpFDeg()>
Kstd1_deg)
1940 if (strat->
Ll<0)
break;
1943 strat->
P = strat->
L[strat->
Ll];
1970 else if (strat->
P.p1 ==
NULL)
1978 if (!strat->
P.IsNull())
1982 message(strat->
P.ecart+strat->
P.GetpFDeg(),&olddeg,&reduc,strat, red_result);
1984 red_result = strat->
red(&strat->
P,strat);
1988 if (! strat->
P.IsNull())
1995 strat->
P.pCleardenom();
1999 strat->
P.p =
redtail(&(strat->
P),strat->
sl,strat);
2000 if (strat->
P.p==
NULL)
2002 WerrorS(
"expoent overflow - wrong ordering");
2011 if ((strat->
P.p->next==
NULL)
2013 strat->
P.pCleardenom();
2023 posInS(strat,strat->
sl,strat->
P.p, strat->
P.ecart),
2029 khCheck(
Q,
w,hilb,hilbeledeg,hilbcount,strat);
2094 return (strat->
Shdl);
2169 for (
i=strat->
sl;
i>=0;
i--)
2173 for (
i=0;
i<=strat->
sl;
i++)
2313 for (
i=strat->
sl;
i>=0;
i--)
2327 for (
j=0;
j<=strat->
sl;
j++)
2403 return o+(*kModW)[
i-1];
2411 for (
i=r->N;
i>0;
i--)
2416 return j+(*kModW)[
i-1];
2423 return idInit(1,F->rank);
2425 #ifdef HAVE_SHIFTBBA
2508 #if PRE_INTEGER_CHECK
2563 r=
mora(FCopy,
Q,*
w,hilb,strat);
2565 r=
bba(FCopy,
Q,*
w,hilb,strat);
2582 r=
mora(F,
Q,*
w,hilb,strat);
2584 r=
bba(F,
Q,*
w,hilb,strat);
2605 int newIdeal,
intvec *vw)
2608 return idInit(1,F->rank);
2708 r=
mora(F,
Q,*
w,hilb,strat);
2716 r=
sba(F,
Q,*
w,hilb,strat);
2744 bool sigdrop =
TRUE;
2746 int totalsbaruns = 1,blockedreductions = 20,blockred = 0,loops = 0;
2747 while(sigdrop && (loops < totalsbaruns || totalsbaruns == -1)
2748 && (blockred <= blockedreductions))
2859 r=
mora(F,
Q,*
w,hilb,strat);
2866 r=
sba(r,
Q,*
w,hilb,strat);
2891 if(sigdrop || blockred > blockedreductions)
2893 r =
kStd(r,
Q,
h,
w, hilb, syzComp, newIdeal, vw);
2899 #ifdef HAVE_SHIFTBBA
2974 WerrorS(
"No local ordering possible for shift algebra");
3010 int syzComp,
int reduced)
3015 return idInit(1,F->rank);
3050 strat->
minim=(reduced % 2)+1;
3099 r=
mora(F,
Q,*
w,hilb,strat);
3106 r=
bba(F,
Q,*
w,hilb,strat);
3124 if ((delete_w)&&(temp_w!=
NULL))
delete temp_w;
3132 else if (strat->
M==
NULL)
3135 WarnS(
"no minimal generating set computed");
3158 poly
kNF(ideal F, ideal
Q, poly
p,
int syzComp,
int lazyReduce)
3193 #ifdef HAVE_SHIFTBBA
3196 WerrorS(
"No local ordering possible for shift algebra");
3255 ideal
kNF(ideal F, ideal
Q, ideal
p,
int syzComp,
int lazyReduce)
3297 #ifdef HAVE_SHIFTBBA
3300 WerrorS(
"No local ordering possible for shift algebra");
3369 poly
k_NF (ideal F, ideal
Q, poly
p,
int syzComp,
int lazyReduce,
const ring _currRing)
3373 poly ret =
kNF(F,
Q,
p, syzComp, lazyReduce);
3427 initS(tempF, tempQ, strat);
3457 ideal shdl=strat->
Shdl;
3531 withT = ! strat->
homog;
3536 #ifdef HAVE_TAIL_RING
3541 while (strat->
Ll >= 0)
3548 strat->
P = strat->
L[strat->
Ll];
3551 if (strat->
P.p1 ==
NULL)
3557 if (strat->
P.p ==
NULL && strat->
P.t_p ==
NULL)
3565 &olddeg,&reduc,strat, red_result);
3568 red_result = strat->
red(&strat->
P,strat);
3572 if (red_result == 1)
3578 strat->
P.GetP(strat->
lmBin);
3580 int pos=
posInS(strat,strat->
sl,strat->
P.p,strat->
P.ecart);
3587 strat->
P.pCleardenom();
3591 strat->
P.p =
redtailBba(&(strat->
P),pos-1,strat, withT);
3592 strat->
P.pCleardenom();
3600 strat->
P.p =
redtailBba(&(strat->
P),pos-1,strat, withT);
3612 strat->
enterS(strat->
P, pos, strat, strat->
tl);
3620 for(;ii<=strat->
sl;ii++)
3625 h.p=strat->
S[ii]; strat->
S[ii]=
NULL;
3627 h.sev=strat->
sevS[ii];
3631 if (strat->
T[jj].p==
h.p)
3633 strat->
T[jj].p=
NULL;
3636 memmove(&(strat->
T[jj]),&(strat->
T[jj+1]),
3637 (strat->
tl-jj)*
sizeof(strat->
T[jj]));
3638 memmove(&(strat->
sevT[jj]),&(strat->
sevT[jj+1]),
3639 (strat->
tl-jj)*
sizeof(strat->
sevT[jj]));
3646 int lpos=strat->
posInL(strat->
L,strat->
Ll,&
h,strat);
3651 Print(
"move S[%d] -> L[%d]: ",ii,pos);
3659 for(ii=pos+1;ii<=strat->
sl;ii++) strat->
fromQ[ii]=0;
3697 #ifdef HAVE_TAIL_RING
3780 while (need_retry && (counter>0))
3786 int new_elems=
idElem(res1);
3787 counter -= (new_elems >= elems);
3790 if (
idElem(res1)<=1) need_retry=0;
3812 #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