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;
190 if (ei >
h->ecart && ii < strat->tl)
192 li = strat->
T[
j].length;
202 if (
i > strat->
tl)
break;
203 if ((strat->
T[
i].ecart < ei || (strat->
T[
i].ecart == ei &&
204 strat->
T[
i].length < li))
211 if (strat->
T[
i].ecart < ei || (strat->
T[
i].ecart == ei &&
212 strat->
T[
i].length < li))
217 ei = strat->
T[
i].ecart;
218 if (ei <= h->ecart)
break;
219 li = strat->
T[
i].length;
237 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
266 h->SetShortExpVector();
271 h->ecart = d-
h->GetpFDeg();
273 h->ecart = d-
h->GetpFDeg()+ei-
h->ecart;
277 h->ecart =
h->pLDeg(strat->
LDegLast) -
h->GetpFDeg();
284 if (strat->
honey)
h->SetLength();
294 d =
h->GetpFDeg()+
h->ecart;
301 && ((d >= reddeg) || (pass > strat->
LazyPass)))
307 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
329 if (
h->pTotalDeg()+
h->ecart >= (
int)strat->
tailRing->bitmask)
334 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
351 d =
h->GetpFDeg()+
h->ecart;
353 h->SetShortExpVector();
372 if (
h->GetLmTailRing() ==
NULL)
381 ei = strat->
T[
j].ecart;
383 if (ei >
h->ecart && ii < strat->tl)
385 li = strat->
T[
j].length;
395 if (
i > strat->
tl)
break;
396 if ((strat->
T[
i].ecart < ei || (strat->
T[
i].ecart == ei &&
397 strat->
T[
i].length < li))
406 if (strat->
T[
i].ecart < ei || (strat->
T[
i].ecart == ei &&
407 strat->
T[
i].length < li))
412 ei = strat->
T[
i].ecart;
413 if (ei <= h->ecart)
break;
414 li = strat->
T[
i].length;
432 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
433 if (at <= strat->Ll &&
pLmCmp(
h->p, strat->
L[strat->
Ll].p) != 0 && !
nEqual(
h->p->coef, strat->
L[strat->
Ll].p->coef))
462 h->SetShortExpVector();
467 h->ecart = d-
h->GetpFDeg();
469 h->ecart = d-
h->GetpFDeg()+ei-
h->ecart;
473 h->ecart =
h->pLDeg(strat->
LDegLast) -
h->GetpFDeg();
476 d =
h->GetpFDeg()+
h->ecart;
483 && ((d >= reddeg) || (pass > strat->
LazyPass)))
489 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
511 if (
h->pTotalDeg()+
h->ecart >= (
int)strat->
tailRing->bitmask)
516 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
532 if (
h->IsNull())
return 0;
541 d =
h->GetpFDeg() +
h->ecart;
544 h->SetShortExpVector();
550 h->SetDegStuffReturnLDeg(strat->
LDegLast);
581 h->SetShortExpVector();
594 h->SetDegStuffReturnLDeg(strat->
LDegLast);
604 if (strat->
T[
j].ecart <=
h->ecart)
605 h->ecart = d -
h->GetpFDeg();
607 h->ecart = d -
h->GetpFDeg() + strat->
T[
j].ecart -
h->ecart;
609 d =
h->GetpFDeg() +
h->ecart;
612 d =
h->SetDegStuffReturnLDeg(strat->
LDegLast);
621 && ((d >= reddeg) || (pass > strat->
LazyPass)))
626 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
644 if (
h->pTotalDeg()+
h->ecart >= (
int)strat->
tailRing->bitmask)
649 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
670 int o =
H.SetpFDeg();
674 unsigned long not_sev = ~
H.sev;
691 int ei = strat->
T[
j].ecart;
692 int li = strat->
T[
j].length;
703 if (
j > strat->
tl)
break;
704 if (ei <=
H.ecart)
break;
705 if (((strat->
T[
j].ecart < ei)
706 || ((strat->
T[
j].ecart == ei)
707 && (strat->
T[
j].length < li)))
715 ei = strat->
T[
j].ecart;
716 li = strat->
T[
j].length;
770 int o =
H.SetpFDeg();
774 unsigned long not_sev = ~
H.sev;
792 int ei = strat->
T[
j].ecart;
793 int li = strat->
T[
j].length;
804 if (
j > strat->
tl)
break;
805 if (ei <=
H.ecart)
break;
806 if (((strat->
T[
j].ecart < ei)
807 || ((strat->
T[
j].ecart == ei)
808 && (strat->
T[
j].length < li)))
817 ei = strat->
T[
j].ecart;
818 li = strat->
T[
j].length;
874 for (
i=1;
i<=strat->
Ll;
i++)
876 at = strat->
posInL(strat->
L,
i-1,&(strat->
L[
i]),strat);
880 for (
j=
i-1;
j>=at;
j--) strat->
L[
j+1] = strat->
L[
j];
896 for (
i=1;
i<=strat->
tl;
i++)
898 if (strat->
T[
i-1].length > strat->
T[
i].length)
901 sev = strat->
sevT[
i];
907 if (strat->
T[
i].length > strat->
T[at].length)
break;
909 for (
j =
i-1;
j>at;
j--)
911 strat->
T[
j+1]=strat->
T[
j];
913 strat->
R[strat->
T[
j+1].i_r] = &(strat->
T[
j+1]);
916 strat->
sevT[at+1] = sev;
917 strat->
R[
p.i_r] = &(strat->
T[at+1]);
993 if (L->bucket !=
NULL)
1015 int op=
p->GetpFDeg() +
p->ecart;
1023 && (set[
j].GetpFDeg()+set[
j].ecart >= op))
1051 p=strat->
L[strat->
Ll];
1052 strat->
L[strat->
Ll]=strat->
L[
j];
1085 strat->
L[
j].SetLmCurrRing();
1097 p=strat->
L[strat->
Ll];
1098 strat->
L[strat->
Ll]=strat->
L[
j];
1117 while (i <= strat->Ll)
1150 if (! strat->
L[
i].IsNull())
1152 strat->
L[
i].SetLmCurrRing();
1153 strat->
L[
i].SetpFDeg();
1155 = strat->
L[
i].pLDeg(strat->
LDegLast) - strat->
L[
i].GetpFDeg();
1162 if (strat->
L[
i].IsNull())
1184 while (i <= strat->tl)
1192 if (
p.p != strat->
T[
i].p)
1220 for (
i=strat->
Ll;
i>=0;
i--)
1222 strat->
L[
i].SetpFDeg();
1224 for (
i=strat->
tl;
i>=0;
i--)
1226 strat->
T[
i].SetpFDeg();
1278 Print(
"new s%d:",atS);
1484 strat->
HCord = 32000;
1521 int hilbeledeg=1,hilbcount=0;
1564 #ifdef HAVE_TAIL_RING
1578 while (strat->
Ll >= 0)
1585 while (strat->
Ll >= 0)
1590 && (strat->
L[strat->
Ll].ecart+strat->
L[strat->
Ll].GetpFDeg()>
Kstd1_deg))
1597 while ((strat->
Ll >= 0)
1598 && (strat->
L[strat->
Ll].p1!=
NULL) && (strat->
L[strat->
Ll].p2!=
NULL)
1599 && (strat->
L[strat->
Ll].ecart+strat->
L[strat->
Ll].GetpFDeg()>
Kstd1_deg)
1608 if (strat->
Ll<0)
break;
1611 strat->
P = strat->
L[strat->
Ll];
1638 else if (strat->
P.p1 ==
NULL)
1646 if (!strat->
P.IsNull())
1650 message(strat->
P.ecart+strat->
P.GetpFDeg(),&olddeg,&reduc,strat, red_result);
1652 red_result = strat->
red(&strat->
P,strat);
1656 if (! strat->
P.IsNull())
1663 strat->
P.pCleardenom();
1667 strat->
P.p =
redtail(&(strat->
P),strat->
sl,strat);
1668 if (strat->
P.p==
NULL)
1670 WerrorS(
"expoent overflow - wrong ordering");
1679 if ((strat->
P.p->next==
NULL)
1681 strat->
P.pCleardenom();
1691 posInS(strat,strat->
sl,strat->
P.p, strat->
P.ecart),
1697 khCheck(
Q,
w,hilb,hilbeledeg,hilbcount,strat);
1707 memset(&strat->
P,0,
sizeof(strat->
P));
1762 return (strat->
Shdl);
1837 for (
i=strat->
sl;
i>=0;
i--)
1841 for (
i=0;
i<=strat->
sl;
i++)
1981 for (
i=strat->
sl;
i>=0;
i--)
1995 for (
j=0;
j<=strat->
sl;
j++)
2071 return o+(*kModW)[
i-1];
2079 for (
i=r->N;
i>0;
i--)
2084 return j+(*kModW)[
i-1];
2091 return idInit(1,F->rank);
2172 #if PRE_INTEGER_CHECK
2227 r=
mora(FCopy,
Q,*
w,hilb,strat);
2229 r=
bba(FCopy,
Q,*
w,hilb,strat);
2246 r=
mora(F,
Q,*
w,hilb,strat);
2248 r=
bba(F,
Q,*
w,hilb,strat);
2269 int newIdeal,
intvec *vw)
2272 return idInit(1,F->rank);
2372 r=
mora(F,
Q,*
w,hilb,strat);
2380 r=
sba(F,
Q,*
w,hilb,strat);
2408 bool sigdrop =
TRUE;
2410 int totalsbaruns = 1,blockedreductions = 20,blockred = 0,loops = 0;
2411 while(sigdrop && (loops < totalsbaruns || totalsbaruns == -1)
2412 && (blockred <= blockedreductions))
2523 r=
mora(F,
Q,*
w,hilb,strat);
2530 r=
sba(r,
Q,*
w,hilb,strat);
2555 if(sigdrop || blockred > blockedreductions)
2557 r =
kStd(r,
Q,
h,
w, hilb, syzComp, newIdeal, vw);
2563 #ifdef HAVE_SHIFTBBA
2565 int newIdeal,
intvec *vw,
int uptodeg,
int lV)
2639 WerrorS(
"No local ordering possible for shift algebra");
2674 int syzComp,
int reduced)
2679 return idInit(1,F->rank);
2714 strat->
minim=(reduced % 2)+1;
2763 r=
mora(F,
Q,*
w,hilb,strat);
2770 r=
bba(F,
Q,*
w,hilb,strat);
2788 if ((delete_w)&&(temp_w!=
NULL))
delete temp_w;
2796 else if (strat->
M==
NULL)
2799 WarnS(
"no minimal generating set computed");
2822 poly
kNF(ideal F, ideal
Q, poly
p,
int syzComp,
int lazyReduce)
2910 ideal
kNF(ideal F, ideal
Q, ideal
p,
int syzComp,
int lazyReduce)
3015 poly
k_NF (ideal F, ideal
Q, poly
p,
int syzComp,
int lazyReduce,
const ring _currRing)
3019 poly ret =
kNF(F,
Q,
p, syzComp, lazyReduce);
3073 initS(tempF, tempQ, strat);
3103 ideal shdl=strat->
Shdl;
3177 withT = ! strat->
homog;
3182 #ifdef HAVE_TAIL_RING
3187 while (strat->
Ll >= 0)
3194 strat->
P = strat->
L[strat->
Ll];
3197 if (strat->
P.p1 ==
NULL)
3203 if (strat->
P.p ==
NULL && strat->
P.t_p ==
NULL)
3211 &olddeg,&reduc,strat, red_result);
3214 red_result = strat->
red(&strat->
P,strat);
3218 if (red_result == 1)
3224 strat->
P.GetP(strat->
lmBin);
3226 int pos=
posInS(strat,strat->
sl,strat->
P.p,strat->
P.ecart);
3233 strat->
P.pCleardenom();
3237 strat->
P.p =
redtailBba(&(strat->
P),pos-1,strat, withT);
3238 strat->
P.pCleardenom();
3246 strat->
P.p =
redtailBba(&(strat->
P),pos-1,strat, withT);
3258 strat->
enterS(strat->
P, pos, strat, strat->
tl);
3266 for(;ii<=strat->
sl;ii++)
3269 memset(&
h,0,
sizeof(
h));
3271 h.p=strat->
S[ii]; strat->
S[ii]=
NULL;
3273 h.sev=strat->
sevS[ii];
3277 if (strat->
T[jj].p==
h.p)
3279 strat->
T[jj].p=
NULL;
3282 memmove(&(strat->
T[jj]),&(strat->
T[jj+1]),
3283 (strat->
tl-jj)*
sizeof(strat->
T[jj]));
3284 memmove(&(strat->
sevT[jj]),&(strat->
sevT[jj+1]),
3285 (strat->
tl-jj)*
sizeof(strat->
sevT[jj]));
3292 int lpos=strat->
posInL(strat->
L,strat->
Ll,&
h,strat);
3297 Print(
"move S[%d] -> L[%d]: ",ii,pos);
3305 for(ii=pos+1;ii<=strat->
sl;ii++) strat->
fromQ[ii]=0;
3322 memset(&(strat->
P), 0,
sizeof(strat->
P));
3343 #ifdef HAVE_TAIL_RING
3426 while (need_retry && (counter>0))
3432 int new_elems=
idElem(res1);
3433 counter -= (new_elems >= elems);
3436 if (
idElem(res1)<=1) need_retry=0;
3458 #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 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()
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 ksReducePoly(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)
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 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)
ideal kStdShift(ideal F, ideal Q, tHomog h, intvec **w, intvec *hilb, int syzComp, int newIdeal, intvec *vw, int uptodeg, int lV)
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)
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 kFindDivisibleByInS(const kStrategy strat, int *max_ind, LObject *L)
return -1 if no divisor is found number of first divisor in S, otherwise
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)
ideal bbaShift(ideal F, ideal Q, intvec *w, intvec *hilb, kStrategy strat, int uptodeg, int lV)
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
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)
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_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)
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
void rChangeCurrRing(ring r)
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 might 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 rIsPluralRing(const ring r)
we must always have this test!
long(* pLDegProc)(poly p, int *length, 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)