12#define MORA_USE_BUCKETS
14#define PRE_INTEGER_CHECK 0
145 if (ret < 0)
return ret;
175 d =
h->GetpFDeg()+
h->ecart;
177 h->SetShortExpVector();
187 ei = strat->
T[
j].ecart;
192 unsigned long not_sev=
~h->sev;
193 poly h_t=
h->GetLmTailRing();
194 li = strat->
T[
j].length;
195 if (li<=0) li=strat->
T[
j].GetpLength();
204 if (
i > strat->
tl)
break;
206 if (strat->
T[
i].length<=0) strat->
T[
i].GetpLength();
207 if ((strat->
T[
i].ecart < ei || (strat->
T[
i].ecart == ei &&
208 strat->
T[
i].length < li))
215 if (strat->
T[
i].ecart < ei || (strat->
T[
i].ecart == ei &&
216 strat->
T[
i].length < li))
221 ei = strat->
T[
i].ecart;
222 if (ei <= h->ecart)
break;
223 li = strat->
T[
i].length;
241 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
278 else if (
h->t_p!=
NULL)
297 else if (
h->t_p!=
NULL)
308 h->SetShortExpVector();
313 h->ecart = d-
h->GetpFDeg();
315 h->ecart = d-
h->GetpFDeg()+ei-
h->ecart;
319 h->ecart =
h->pLDeg(strat->
LDegLast) -
h->GetpFDeg();
326 if (strat->
honey)
h->SetLength();
336 d =
h->GetpFDeg()+
h->ecart;
343 && ((d >= reddeg) || (pass > strat->
LazyPass)))
349 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
371 if (
h->pTotalDeg()+
h->ecart >= (
int)strat->
tailRing->bitmask)
376 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();
581 &&strat->
T[0].GetpFDeg() == 0
582 && strat->
T[0].length <= 2)
595 && T0ecart <= h->ecart)
615 h->LmDeleteAndIter();
635 if (
h->GetLmTailRing() ==
NULL)
644 ei = strat->
T[
j].ecart;
647 if (ei >
h->ecart && ii < strat->tl)
649 li = strat->
T[
j].length;
659 if (
i > strat->
tl)
break;
660 if ((strat->
T[
i].ecart < ei || (strat->
T[
i].ecart == ei &&
661 strat->
T[
i].length < li))
670 if (strat->
T[
i].ecart < ei || (strat->
T[
i].ecart == ei &&
671 strat->
T[
i].length < li))
676 ei = strat->
T[
i].ecart;
677 if (ei <= h->ecart)
break;
678 li = strat->
T[
i].length;
697 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
698 if (at <= strat->Ll &&
pLmCmp(
h->p, strat->
L[strat->
Ll].p) != 0 && !
nEqual(
h->p->coef, strat->
L[strat->
Ll].p->coef))
727 h->SetShortExpVector();
732 h->ecart = d-
h->GetpFDeg();
734 h->ecart = d-
h->GetpFDeg()+ei-
h->ecart;
738 h->ecart =
h->pLDeg(strat->
LDegLast) -
h->GetpFDeg();
741 d =
h->GetpFDeg()+
h->ecart;
748 && ((d >= reddeg) || (pass > strat->
LazyPass)))
754 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
776 if (
h->pTotalDeg()+
h->ecart >= (
int)strat->
tailRing->bitmask)
781 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
796 if (strat->
tl<0)
return 1;
797 if (
h->IsNull())
return 0;
805 reddeg = d =
h->GetpFDeg();
811 h->SetShortExpVector();
817 h->SetDegStuffReturnLDeg(strat->
LDegLast);
858 else if (
h->t_p!=
NULL)
877 else if (
h->t_p!=
NULL)
886 h->SetShortExpVector();
899 h->SetDegStuffReturnLDeg(strat->
LDegLast);
909 if (strat->
T[
j].ecart <=
h->ecart)
910 h->ecart = d -
h->GetpFDeg();
912 h->ecart = d -
h->GetpFDeg() + strat->
T[
j].ecart -
h->ecart;
914 d =
h->GetpFDeg() +
h->ecart;
917 d =
h->SetDegStuffReturnLDeg(strat->
LDegLast);
927 && ((d >= reddeg) || (pass > strat->
LazyPass)))
932 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
956 if (
h->pTotalDeg()+
h->ecart >= (
int)strat->
tailRing->bitmask)
961 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
982 int o =
H.SetpFDeg();
997 unsigned long not_sev = ~ H.sev;
1003 int ei = strat->
T[
j].ecart;
1004 int li = strat->
T[
j].length;
1015 if (
j > strat->
tl)
break;
1016 if (ei <=
H.ecart)
break;
1017 if (((strat->
T[
j].ecart < ei)
1018 || ((strat->
T[
j].ecart == ei)
1019 && (strat->
T[
j].length < li)))
1027 ei = strat->
T[
j].ecart;
1028 li = strat->
T[
j].length;
1086 poly T0p = strat->
T[0].p;
1087 int T0ecart = strat->
T[0].ecart;
1088 int o =
H.SetpFDeg();
1092 unsigned long not_sev = ~ H.sev;
1093 if (strat->
T[0].GetpFDeg() == 0 && strat->
T[0].length <= 2)
1111 && (T0ecart <=
H.ecart))
1146 int ei = strat->
T[
j].ecart;
1147 int li = strat->
T[
j].length;
1158 if (
j > strat->
tl)
break;
1159 if (ei <=
H.ecart)
break;
1160 if (((strat->
T[
j].ecart < ei)
1161 || ((strat->
T[
j].ecart == ei)
1162 && (strat->
T[
j].length < li)))
1171 ei = strat->
T[
j].ecart;
1172 li = strat->
T[
j].length;
1226 for (
i=1;
i<=strat->
Ll;
i++)
1228 at = strat->
posInL(strat->
L,
i-1,&(strat->
L[
i]),strat);
1232 for (
j=
i-1;
j>=at;
j--) strat->
L[
j+1] = strat->
L[
j];
1248 for (
i=1;
i<=strat->
tl;
i++)
1250 if (strat->
T[
i-1].length > strat->
T[
i].length)
1253 sev = strat->
sevT[
i];
1259 if (strat->
T[
i].length > strat->
T[at].length)
break;
1261 for (
j =
i-1;
j>at;
j--)
1263 strat->
T[
j+1]=strat->
T[
j];
1265 strat->
R[strat->
T[
j+1].i_r] = &(strat->
T[
j+1]);
1268 strat->
sevT[at+1] = sev;
1269 strat->
R[
p.i_r] = &(strat->
T[at+1]);
1345 if (L->bucket !=
NULL)
1367 int op=
p->GetpFDeg() +
p->ecart;
1375 && (set[
j].GetpFDeg()+set[
j].ecart >= op))
1403 p=strat->
L[strat->
Ll];
1404 strat->
L[strat->
Ll]=strat->
L[
j];
1437 strat->
L[
j].SetLmCurrRing();
1450 p=strat->
L[strat->
Ll];
1451 strat->
L[strat->
Ll]=strat->
L[
j];
1503 if (! strat->
L[
i].IsNull())
1505 strat->
L[
i].SetLmCurrRing();
1506 strat->
L[
i].SetpFDeg();
1508 = strat->
L[
i].pLDeg(strat->
LDegLast) - strat->
L[
i].GetpFDeg();
1514 if (strat->
L[
i].IsNull())
1544 if (
p.p != strat->
T[
i].p)
1572 for (
i=strat->
Ll;
i>=0;
i--)
1574 strat->
L[
i].SetpFDeg();
1576 for (
i=strat->
tl;
i>=0;
i--)
1578 strat->
T[
i].SetpFDeg();
1626 Print(
"new s%d:",atS);
1883 int hilbeledeg=1,hilbcount=0;
1916#ifdef HAVE_TAIL_RING
1930 while (strat->
Ll >= 0)
1937 while (strat->
Ll >= 0)
1942 && (strat->
L[strat->
Ll].ecart+strat->
L[strat->
Ll].GetpFDeg()>
Kstd1_deg))
1949 while ((strat->
Ll >= 0)
1950 && (strat->
L[strat->
Ll].p1!=
NULL) && (strat->
L[strat->
Ll].p2!=
NULL)
1951 && (strat->
L[strat->
Ll].ecart+strat->
L[strat->
Ll].GetpFDeg()>
Kstd1_deg)
1960 if (strat->
Ll<0)
break;
1963 strat->
P = strat->
L[strat->
Ll];
1991 else if (strat->
P.p1 ==
NULL)
1999 if (!strat->
P.IsNull())
2003 message(strat->
P.ecart+strat->
P.GetpFDeg(),&olddeg,&reduc,strat, red_result);
2005 red_result = strat->
red(&strat->
P,strat);
2009 if (! strat->
P.IsNull())
2016 strat->
P.pCleardenom();
2020 strat->
P.p =
redtail(&(strat->
P),strat->
sl,strat);
2021 if (strat->
P.p==
NULL)
2023 WerrorS(
"exponent overflow - wrong ordering");
2032 if ((strat->
P.p->next==
NULL)
2034 strat->
P.pCleardenom();
2036 strat->
P.SetShortExpVector();
2045 posInS(strat,strat->
sl,strat->
P.p, strat->
P.ecart),
2051 khCheck(
Q,
w,hilb,hilbeledeg,hilbcount,strat);
2112 return (strat->
Shdl);
2189 for (
i=strat->
sl;
i>=0;
i--)
2193 for (
i=0;
i<=strat->
sl;
i++)
2329 for (
i=strat->
sl;
i>=0;
i--)
2343 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];
2517 #if PRE_INTEGER_CHECK
2562 r=
mora(FCopy,
Q,*
w,hilb,strat);
2564 r=
bba(FCopy,
Q,*
w,hilb,strat);
2581 r=
mora(F,
Q,*
w,hilb,strat);
2583 r=
bba(F,
Q,*
w,hilb,strat);
2606 return idInit(1,F->rank);
2658 ideal
res=
kStd2(F,
Q,
h,
w,hh,syzComp,newIdeal,vw,sp);
2659 if (hh!=
NULL)
delete hh;
2664 int newIdeal,
intvec *vw)
2667 return idInit(1,F->rank);
2768 r=
mora(F,
Q,*
w,hilb,strat);
2776 r=
sba(F,
Q,*
w,hilb,strat);
2803 bool sigdrop =
TRUE;
2805 int totalsbaruns = 1,blockedreductions = 20,blockred = 0,loops = 0;
2806 while(sigdrop && (loops < totalsbaruns || totalsbaruns == -1)
2807 && (blockred <= blockedreductions))
2919 r=
mora(F,
Q,*
w,hilb,strat);
2926 r=
sba(r,
Q,*
w,hilb,strat);
2950 if(sigdrop || blockred > blockedreductions)
2952 r =
kStd2(r,
Q,
h,
w, hilb, syzComp, newIdeal, vw);
2967 WerrorS(
"No local ordering possible for shift algebra");
3065 int syzComp,
int reduced)
3070 return idInit(1,F->rank);
3105 strat->
minim=(reduced % 2)+1;
3162 r=
bba(F,
Q,*
w,hilb,strat);
3179 if ((delete_w)&&(temp_w!=
NULL))
delete temp_w;
3187 else if (strat->
M==
NULL)
3190 WarnS(
"no minimal generating set computed");
3217 int syzComp,
int reduced)
3221 if (hh!=
NULL)
delete hh;
3224poly
kNF(ideal F, ideal
Q, poly
p,
int syzComp,
int lazyReduce)
3263 WerrorS(
"No local ordering possible for shift algebra");
3322ideal
kNF(ideal F, ideal
Q, ideal
p,
int syzComp,
int lazyReduce)
3369 WerrorS(
"No local ordering possible for shift algebra");
3438poly
k_NF (ideal F, ideal
Q, poly
p,
int syzComp,
int lazyReduce,
const ring _currRing)
3442 poly ret =
kNF(F,
Q,
p, syzComp, lazyReduce);
3497 initS(tempF, tempQ, strat);
3528 ideal shdl=strat->
Shdl;
3603 withT = ! strat->
homog;
3608#ifdef HAVE_TAIL_RING
3613 while (strat->
Ll >= 0)
3620 strat->
P = strat->
L[strat->
Ll];
3623 if (strat->
P.p1 ==
NULL)
3629 if (strat->
P.p ==
NULL && strat->
P.t_p ==
NULL)
3637 &olddeg,&reduc,strat, red_result);
3640 red_result = strat->
red(&strat->
P,strat);
3644 if (red_result == 1)
3650 strat->
P.GetP(strat->
lmBin);
3652 int pos=
posInS(strat,strat->
sl,strat->
P.p,strat->
P.ecart);
3659 strat->
P.pCleardenom();
3675 strat->
enterS(strat->
P, pos, strat, strat->
tl);
3683 for(;ii<=strat->
sl;ii++)
3688 h.p=strat->
S[ii]; strat->
S[ii]=
NULL;
3690 h.sev=strat->
sevS[ii];
3694 if (strat->
T[jj].p==
h.p)
3696 strat->
T[jj].p=
NULL;
3699 memmove(&(strat->
T[jj]),&(strat->
T[jj+1]),
3700 (strat->
tl-jj)*
sizeof(strat->
T[jj]));
3701 memmove(&(strat->
sevT[jj]),&(strat->
sevT[jj+1]),
3702 (strat->
tl-jj)*
sizeof(strat->
sevT[jj]));
3709 int lpos=strat->
posInL(strat->
L,strat->
Ll,&
h,strat);
3714 Print(
"move S[%d] -> L[%d]: ",ii,pos);
3722 for(ii=pos+1;ii<=strat->
sl;ii++) strat->
fromQ[ii]=0;
3760#ifdef HAVE_TAIL_RING
3843 while (need_retry && (counter>0))
3849 int new_elems=
idElem(res1);
3850 counter -= (new_elems >= elems);
3853 if (
idElem(res1)<=1) need_retry=0;
3875#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_IsZero(number n, const coeffs r)
TRUE iff 'n' represents the zero element.
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)
long scMult0Int(ideal S, ideal Q)
ideal idMinBase(ideal h1, ideal *SB)
#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)
bigintmat * iv2biv(intvec *hilb, const coeffs cf)
KINLINE TObject ** initR()
KINLINE BOOLEAN arriRewDummy(poly, unsigned long, poly, kStrategy, int)
KINLINE unsigned long * initsevT()
int redLiftstd(LObject *h, kStrategy strat)
static ideal nc_GB(const ideal F, const ideal Q, const intvec *w, const bigintmat *hilb, kStrategy strat, const ring r)
void khCheck(ideal Q, intvec *w, bigintmat *hilb, int &eledeg, int &count, kStrategy strat)
void khCheckLocInhom(ideal Q, intvec *w, bigintmat *hilb, 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, BOOLEAN reduce)
long kHomModDeg(poly p, const ring r)
void reorderT(kStrategy strat)
poly kNFBound(ideal F, ideal Q, poly p, int bound, int syzComp, int lazyReduce)
void initMora(ideal F, kStrategy strat)
int redFirst(LObject *h, kStrategy strat)
void firstUpdate(kStrategy strat)
long kModDeg(poly p, const ring r)
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)
ideal kStd_internal(ideal F, ideal Q, tHomog h, intvec **w, bigintmat *hilb, int syzComp, int newIdeal, intvec *vw, s_poly_proc_t sp)
pure GB/SB computations
void enterSMoraNF(LObject &p, int atS, kStrategy strat, int atR=-1)
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, bigintmat *hilb, int syzComp, int newIdeal, intvec *vw, BOOLEAN rightGB)
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)
ideal kMin_std2(ideal F, ideal Q, tHomog h, intvec **w, ideal &M, bigintmat *hilb, int syzComp, int reduced)
static BOOLEAN kMoraUseBucket(kStrategy strat)
poly kNF1(ideal F, ideal Q, poly q, kStrategy strat, int lazyReduce)
ideal kInterRed(ideal F, const ideal Q)
static void kOptimizeLDeg(pLDegProc ldeg, kStrategy strat)
void initBba(kStrategy strat)
ideal mora(ideal F, ideal Q, intvec *w, bigintmat *hilb, kStrategy strat)
int redRiloc(LObject *h, kStrategy strat)
ideal kStd2(ideal F, ideal Q, tHomog h, intvec **w, bigintmat *hilb, int syzComp, int newIdeal, intvec *vw, s_poly_proc_t sp)
generic interface to GB/SB computations, large hilbert vectors
void initSba(ideal F, kStrategy strat)
static poly redMoraNFRing(poly h, kStrategy strat, int flag)
ideal kSba(ideal F, ideal Q, tHomog h, intvec **w, int sbaOrder, int arri, bigintmat *hilb, int syzComp, int newIdeal, intvec *vw)
void kDebugPrint(kStrategy strat)
void enterSMora(LObject &p, int atS, kStrategy strat, int atR=-1)
ideal kInterRedOld(ideal F, const ideal Q)
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 kStd(ideal F, ideal Q, tHomog h, intvec **w, intvec *hilb, int syzComp, int newIdeal, intvec *vw, s_poly_proc_t sp)
generic interface to GB/SB computations
#define KSTD_NF_CANCELUNIT
BOOLEAN(* s_poly_proc_t)(kStrategy strat)
poly kTryHC(ideal F, ideal Q)
ideal kTryHilbstd(ideal F, ideal Q)
int redRing_Z(LObject *h, kStrategy strat)
ideal sba(ideal F0, ideal Q, intvec *w, bigintmat *hilb, 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)
int redLazy(LObject *h, kStrategy strat)
int redSigRing(LObject *h, kStrategy strat)
ideal bbaShift(ideal F, ideal Q, intvec *w, bigintmat *hilb, 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 bba(ideal F, ideal Q, intvec *w, bigintmat *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)
void enterpairs(poly h, int k, int ecart, int pos, kStrategy strat, int atR)
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)
BOOLEAN kTest_L(LObject *L, kStrategy strat, BOOLEAN testp, int lpos, TSet T, int tlength)
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)
BOOLEAN kTest_T(TObject *T, kStrategy strat, int i, char TN)
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)
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)
void initHilbCrit(ideal, ideal, bigintmat **hilb, kStrategy strat)
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)
number ndQuotRem(number a, number b, number *r, const coeffs 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 int pLength(poly a)
static void p_LmDelete(poly p, const ring r)
static long p_FDeg(const 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)
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 ...
Compatibility 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:
#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,...)
BOOLEAN rHasBlockOrder(const ring r)
BOOLEAN rOrd_is_Ds(const ring r)
BOOLEAN rOrd_is_ds(const ring r)
static BOOLEAN rField_is_Z(const ring r)
static BOOLEAN rHasLocalOrMixedOrdering(const ring r)
static BOOLEAN rHasGlobalOrdering(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_Q(const ring r)
static BOOLEAN rIsNCRing(const ring r)
static BOOLEAN rField_is_numeric(const ring r)
static short rVar(const ring r)
#define rVar(r) (r->N)
static BOOLEAN rHasMixedOrdering(const ring r)
static BOOLEAN rField_has_simple_inverse(const ring r)
#define rField_is_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
BOOLEAN id_IsModule(ideal A, const ring src)
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
BOOLEAN idIsMonomial(ideal h)
returns true if h is generated by monomials
static int idElem(const ideal F)
number of non-zero polys in F
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