2364 #if SBA_PRINT_ZERO_REDUCTIONS 2365 long zeroreductions = 0;
2367 #if SBA_PRINT_PRODUCT_CRITERION 2368 long product_criterion = 0;
2370 #if SBA_PRINT_SIZE_G 2372 int size_g_non_red = 0;
2374 #if SBA_PRINT_SIZE_SYZ 2378 #if SBA_PRINT_REDUCTION_STEPS 2379 sba_reduction_steps = 0;
2380 sba_interreduction_steps = 0;
2382 #if SBA_PRINT_OPERATIONS 2384 sba_interreduction_operations = 0;
2388 ring sRing, currRingOld;
2393 if (sRing!=currRingOld)
2412 dummy =
pCopy(F->m[0]);
2414 F->m[
i] = F->m[
i+1];
2435 dummy =
pCopy(F->m[0]);
2437 F->m[
i] = F->m[
i+1];
2456 F->m[
i] = F1->m[(*sort)[
i]-1];
2470 F->m[
j] = F->m[
j-1];
2488 printf(
"SBA COMPUTATIONS DONE IN THE FOLLOWING RING:\n");
2490 printf(
"ordSgn = %d\n",
currRing->OrdSgn);
2493 int srmax,lrmax, red_result = 1;
2495 int hilbeledeg=1,hilbcount=0,minimcnt=0;
2509 reduc = olddeg = lrmax = 0;
2522 #ifdef HAVE_TAIL_RING 2540 strat->
enterS(strat->
L[strat->
Ll-(
i)], strat->
sl+1, strat, strat->
tl);
2550 while (strat->
Ll >= 0)
2553 printf(
"\n ------------------------NEW LOOP\n");
2554 printf(
"\nShdl = \n");
2558 for(
int ii = 0; ii<=strat->
sl;ii++)
2565 for(
int iii = 0; iii< strat->
syzl; iii++)
2567 printf(
"\nsyz[%i]:\n",iii);
2572 for(
int iii = 0; iii<= strat->
tl; iii++)
2574 printf(
"\nT[%i]:\n",iii);
2578 printf(
"\n list L\n");
2581 for(iii = 0; iii<= strat->
Ll; iii++)
2583 printf(
"\nL[%i]:\n",iii);
2591 printf(
"L[%i]:",strat->
Ll);
2600 if (strat->
Ll > lrmax) lrmax =strat->
Ll;
2630 f5c ( strat, olddeg, minimcnt, hilbeledeg, hilbcount, srmax,
2631 lrmax, reduc,
Q, w, hilb );
2641 strat->
P = strat->
L[strat->
Ll];
2648 printf(
"\n-------------------------\nThis is the current element P\n");
2655 if (!strat->
rewCrit2(strat->
P.sig, ~strat->
P.sevSig, strat->
P.GetLmCurrRing(),
strat, strat->
P.checked+1)) {
2658 PrintS(
"SIG OF NEXT PAIR TO HANDLE IN SIG-BASED ALGORITHM\n");
2659 PrintS(
"-------------------------------------------------\n");
2664 PrintS(
"-------------------------------------------------\n");
2699 else if (strat->
P.p1 ==
NULL)
2701 if (strat->
minim > 0)
2707 if (strat->
P.p ==
NULL && strat->
P.t_p ==
NULL)
2715 PrintS(
"Poly before red: ");
2719 #if SBA_PRODUCT_CRITERION 2720 if (strat->
P.prod_crit) {
2721 #if SBA_PRINT_PRODUCT_CRITERION 2722 product_criterion++;
2724 int pos =
posInSyz(strat, strat->
P.sig);
2726 if (strat->
P.lcm!=
NULL)
2730 red_result = strat->
red(&strat->
P,strat);
2733 red_result = strat->
red(&strat->
P,strat);
2747 strat->
P.p =
pNeg(strat->
P.p);
2748 strat->
P.sig =
pNeg(strat->
P.sig);
2751 if(strat->
P.sig !=
NULL)
2753 if(strat->
P.p !=
NULL)
2757 printf(
"\nAfter reduce (redresult=%i): \n",red_result);
pWrite(strat->
P.p);
pWrite(strat->
P.sig);
2764 printf(
"\nSigdrop in the reduce. Trying redring\n");
2766 red_result =
redRing(&strat->
P,strat);
2770 printf(
"\nSigdrop cancelled since redRing reduced to 0\n");
2774 strat->
P.sig =
NULL;
2779 printf(
"\nStill Sigdrop - redRing reduced to:\n");
pWrite(strat->
P.p);
2781 strat->
enterS(strat->
P, 0, strat, strat->
tl);
2790 printf(
"\nToo many blocked reductions\n");
2800 if (red_result != 0) {
2801 PrintS(
"Poly after red: ");
2803 pWrite(strat->
P.GetLmCurrRing());
2805 printf(
"%d\n",red_result);
2810 if(strat->
P.p !=
NULL)
2812 &olddeg,&reduc,
strat, red_result);
2814 message((strat->honey ? strat->P.ecart : 0),
2815 &olddeg,&reduc,strat, red_result);
2818 if (strat->overflow)
2823 if (red_result == 1)
2826 strat->P.GetP(strat->lmBin);
2830 (strat->P).FDeg = (strat->P).pFDeg();
2834 if (strat->homog) strat->initEcart(&(strat->P));
2842 int pos = strat->sl+1;
2850 beforetailred =
pCopy(strat->P.sig);
2856 strat->P.p =
redtailSba(&(strat->P),pos-1,strat, withT);
2860 if (strat->sbaOrder != 2) {
2863 strat->P.pCleardenom();
2866 strat->P.p =
redtailSba(&(strat->P),pos-1,strat, withT);
2867 strat->P.pCleardenom();
2874 strat->P.p =
redtailSba(&(strat->P),pos-1,strat, withT);
2884 printf(
"\n Still sigdrop after redtailSba - it reduced to \n");
pWrite(strat->P.p);
2886 strat->enterS(strat->P, 0, strat, strat->tl);
2892 if(strat->P.sig ==
NULL ||
pLtCmp(beforetailred,strat->P.sig) == 1)
2895 printf(
"\nSigDrop after TAILred\n");
pWrite(beforetailred);
pWrite(strat->P.sig);
2897 strat->sigdrop =
TRUE;
2899 red_result =
redRing(&strat->P,strat);
2904 printf(
"\nReduced to 0 via redRing. Cancel sigdrop\n");
2906 strat->sigdrop =
FALSE;
2912 printf(
"\nReduced to this via redRing.SIGDROP\n");
pWrite(strat->P.p);
2914 strat->enterS(strat->P, 0, strat, strat->tl);
2920 if(strat->P.p ==
NULL)
2921 goto case_when_red_result_changed;
2924 printf(
"\nNach redTailSba: \n");
2929 if (strat->sbaOrder == 1)
2931 for (
int jj = 0; jj<strat->tl+1; jj++)
2933 if (
pGetComp(strat->T[jj].sig) == strat->currIdx)
2935 strat->T[jj].is_sigsafe =
FALSE;
2941 for (
int jj = 0; jj<strat->tl+1; jj++)
2943 strat->T[jj].is_sigsafe =
FALSE;
2951 if ((strat->P.p1==
NULL) && (strat->minim>0))
2953 if (strat->minim==1)
2955 strat->M->m[minimcnt]=
p_Copy(strat->P.p,
currRing,strat->tailRing);
2960 strat->M->m[minimcnt]=strat->P.p2;
2964 pNext(strat->M->m[minimcnt])
2965 = strat->p_shallow_copy_delete(
pNext(strat->M->m[minimcnt]),
2974 strat->T[strat->tl].is_sigsafe =
FALSE;
2981 superenterpairsSig(strat->P.p,strat->P.sig,strat->sl+1,strat->sl,strat->P.ecart,pos,strat, strat->tl);
2983 enterpairsSig(strat->P.p,strat->P.sig,strat->sl+1,strat->sl,strat->P.ecart,pos,strat, strat->tl);
2985 printf(
"\nThis element is added to S\n");
2986 p_Write(strat->P.p, strat->tailRing);
p_Write(strat->P.p1, strat->tailRing);
p_Write(strat->P.p2, strat->tailRing);
pWrite(strat->P.sig);
2993 strat->enterS(strat->P, pos, strat, strat->tl);
2994 if(strat->sbaOrder != 1)
2997 for (
int tk=0; tk<strat->sl+1; tk++)
3018 for(
int ps=0;ps<strat->sl+1;ps++)
3022 if (strat->syzl == strat->syzmax)
3026 (strat->syzmax)*
sizeof(
unsigned long),
3028 *
sizeof(
unsigned long));
3031 Q.sig =
pCopy(strat->P.sig);
3034 if (strat->sbaOrder == 0)
3057 if(strat->sbaOrder == 0 || strat->sbaOrder == 3)
3068 if (strat->currIdx < idx) {
3069 for (
int i=0; i<strat->sl; ++
i) {
3079 strat->currIdx = idx;
3083 for (
int i=cmp+1; i<=max_cmp; ++
i) {
3085 for (
int j=0;
j<strat->sl; ++
j) {
3100 if (strat->sbaOrder == 0) {
3116 printf(
"---------------------------\n");
3117 Print(
" %d. ELEMENT ADDED TO GCURR:\n",strat->sl+1);
3140 if (hilb!=
NULL)
khCheck(Q,w,hilb,hilbeledeg,hilbcount,strat);
3142 if (strat->P.lcm!=
NULL)
3148 if (strat->sl>srmax) srmax = strat->sl;
3152 case_when_red_result_changed:
3158 if (red_result!=2) {
3159 #if SBA_PRINT_ZERO_REDUCTIONS 3168 int pos =
posInSyz(strat, strat->P.sig);
3172 Print(
"ADDING STUFF TO SYZ : ");
3178 if (strat->P.p1 ==
NULL && strat->minim > 0)
3185 memset(&(strat->P), 0,
sizeof(strat->P));
3191 printf(
"\nSigDrop!\n");
3193 printf(
"\nEnded with no SigDrop\n");
3199 if(strat->P.sig !=
NULL)
3200 strat->sbaEnterS =
pGetComp(strat->P.sig)-1;
3203 memset(&(strat->P), 0,
sizeof(strat->P));
3222 clearS(strat->S[j],strat->sevS[j],&k,&j,strat);
3233 if (strat->completeReduce_retry)
3238 #ifdef HAVE_TAIL_RING 3239 if(
currRing->bitmask>strat->tailRing->bitmask)
3241 strat->completeReduce_retry=
FALSE;
3244 for(i=strat->sl;i>=0;i--) strat->S_2_R[
i]=-1;
3247 if (strat->completeReduce_retry)
3254 #if SBA_PRINT_SIZE_SYZ 3256 size_syz = strat->syzl;
3269 #if SBA_PRINT_SIZE_G 3270 size_g_non_red =
IDELEMS(strat->Shdl);
3284 for(;k>=0 && (strat->L[
k].p1 !=
NULL || strat->L[
k].p2 !=
NULL);k--)
3294 for(;k>=0 && strat->L[
k].p1 ==
NULL && strat->L[
k].p2 ==
NULL;k--)
3297 strat->enterS(strat->L[k], strat->sl+1, strat, strat->tl);
3305 for(k=strat->sl;k>=0;k--)
3307 printf(
"\nsig[%i] = ",i);
pWrite(strat->sig[k]);
3308 if(strat->sig[k] ==
NULL)
3309 strat->sig[
k] =
pCopy(strat->sig[k-1]);
3318 if ((strat->sbaOrder == 1 || strat->sbaOrder == 3) && sRing!=currRingOld)
3327 if(strat->tailRing == sRing)
3338 #if SBA_PRINT_SIZE_G 3339 size_g =
IDELEMS(strat->Shdl);
3342 printf(
"SIZE OF SHDL: %d\n",
IDELEMS(strat->Shdl));
3344 while (oo<
IDELEMS(strat->Shdl))
3346 printf(
" %d. ",oo+1);
3351 #if SBA_PRINT_ZERO_REDUCTIONS 3352 printf(
"----------------------------------------------------------\n");
3353 printf(
"ZERO REDUCTIONS: %ld\n",zeroreductions);
3356 #if SBA_PRINT_REDUCTION_STEPS 3357 printf(
"----------------------------------------------------------\n");
3358 printf(
"S-REDUCTIONS: %ld\n",sba_reduction_steps);
3360 #if SBA_PRINT_OPERATIONS 3361 printf(
"OPERATIONS: %ld\n",sba_operations);
3363 #if SBA_PRINT_REDUCTION_STEPS 3364 printf(
"- - - - - - - - - - - - - - - - - - - - - - - - - - - - - \n");
3365 printf(
"INTERREDUCTIONS: %ld\n",sba_interreduction_steps);
3367 #if SBA_PRINT_OPERATIONS 3368 printf(
"INTERREDUCTION OPERATIONS: %ld\n",sba_interreduction_operations);
3370 #if SBA_PRINT_REDUCTION_STEPS 3371 printf(
"- - - - - - - - - - - - - - - - - - - - - - - - - - - - - \n");
3372 printf(
"ALL REDUCTIONS: %ld\n",sba_reduction_steps+sba_interreduction_steps);
3373 sba_interreduction_steps = 0;
3374 sba_reduction_steps = 0;
3376 #if SBA_PRINT_OPERATIONS 3377 printf(
"ALL OPERATIONS: %ld\n",sba_operations+sba_interreduction_operations);
3378 sba_interreduction_operations = 0;
3381 #if SBA_PRINT_SIZE_G 3382 printf(
"----------------------------------------------------------\n");
3383 printf(
"SIZE OF G: %d / %d\n",size_g,size_g_non_red);
3387 #if SBA_PRINT_SIZE_SYZ 3388 printf(
"SIZE OF SYZ: %ld\n",size_syz);
3389 printf(
"----------------------------------------------------------\n");
3392 #if SBA_PRINT_PRODUCT_CRITERION 3393 printf(
"PRODUCT CRITERIA: %ld\n",product_criterion);
3394 product_criterion = 0;
3396 return (strat->Shdl);
#define omRealloc0Size(addr, o_size, size)
int(* posInL)(const LSet set, const int length, LObject *L, const kStrategy strat)
void id_DelDiv(ideal id, const ring r)
delete id[j], if LT(j) == coeff*mon*LT(i) and vice versa, i.e., delete id[i], if LT(i) == coeff*mon*L...
void initSbaPos(kStrategy strat)
int redRing(LObject *h, kStrategy strat)
void message(int i, int *reduc, int *olddeg, kStrategy strat, int red_result)
BOOLEAN idInsertPolyOnPos(ideal I, poly p, int pos)
insert p into I on position pos
int posInIdealMonFirst(const ideal F, const poly p, int start, int end)
static unsigned long p_SetComp(poly p, unsigned long c, ring r)
BOOLEAN(* rewCrit2)(poly sig, unsigned long not_sevSig, poly lm, kStrategy strat, int start)
void initSba(ideal F, kStrategy strat)
void initSyzRules(kStrategy strat)
#define pLmDelete(p)
assume p != NULL, deletes Lm(p)->coef and Lm(p)
ring sbaRing(kStrategy strat, const ring r, BOOLEAN, int)
void WerrorS(const char *s)
void initSbaBuchMora(ideal F, ideal Q, kStrategy strat)
static intvec * idSort(ideal id, BOOLEAN nolex=TRUE)
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy ...
int(* red)(LObject *L, kStrategy strat)
int(* posInT)(const TSet T, const int tl, LObject &h)
void enterpairsSig(poly h, poly hSig, int hFrom, int k, int ecart, int pos, kStrategy strat, int atR)
#define pGetComp(p)
Component.
static void p_SetExpV(poly p, int *ev, const ring r)
static poly p_Copy(poly p, const ring r)
returns a copy of p
void kStratInitChangeTailRing(kStrategy strat)
#define TEST_OPT_NOT_BUCKETS
void enterT(LObject &p, kStrategy strat, int atT)
void deleteInL(LSet set, int *length, int j, kStrategy strat)
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
#define TEST_OPT_INTSTRATEGY
void initHilbCrit(ideal, ideal, intvec **hilb, kStrategy strat)
void messageStatSBA(int hilbcount, kStrategy strat)
#define pGetShortExpVector(a)
returns the "Short Exponent Vector" – used to speed up divisibility tests (see polys-impl.cc )
void(* enterS)(LObject &h, int pos, kStrategy strat, int atR)
void ksCreateSpoly(LObject *Pair, poly spNoether, int use_buckets, ring tailRing, poly m1, poly m2, TObject **R)
ideal kInterRed(ideal F, ideal Q)
ideal idrMoveR(ideal &id, ring src_r, ring dest_r)
static int p_LmCmp(poly p, poly q, const ring r)
BOOLEAN kStratChangeTailRing(kStrategy strat, LObject *L, TObject *T, unsigned long expbound)
void exitSba(kStrategy strat)
void PrintS(const char *s)
void superenterpairsSig(poly h, poly hSig, int hFrom, int k, int ecart, int pos, kStrategy strat, int atR)
static void p_ExpVectorAdd(poly p1, poly p2, const ring r)
void f5c(kStrategy strat, int &olddeg, int &minimcnt, int &hilbeledeg, int &hilbcount, int &srmax, int &lrmax, int &reduc, ideal Q, intvec *w, intvec *hilb)
void rWrite(ring r, BOOLEAN details)
static unsigned pLength(poly a)
#define pHead(p)
returns newly allocated copy of Lm(p), coef is copied, next=NULL, p might be NULL ...
void idSkipZeroes(ideal ide)
gives an ideal/module the minimal possible size
void rChangeCurrRing(ring r)
BOOLEAN kCheckSpolyCreation(LObject *L, kStrategy strat, poly &m1, poly &m2)
static void p_Delete(poly *p, const ring r)
void khCheck(ideal Q, intvec *w, intvec *hilb, int &eledeg, int &count, kStrategy strat)
unsigned long p_GetShortExpVector(const poly p, const ring r)
ideal idInit(int idsize, int rank)
initialise an ideal / module
static BOOLEAN rField_is_Ring(const ring r)
void cleanT(kStrategy strat)
#define SBA_INTERRED_START
void pEnlargeSet(poly **p, int l, int increment)
void rDelete(ring r)
unconditionally deletes fields in r
int posInSyz(const kStrategy strat, poly sig)
void initSbaCrit(kStrategy strat)
#define pGetExpV(p, e)
Gets a copy of (resp. set) the exponent vector, where e is assumed to point to (r->N +1)*sizeof(long)...
void completeReduce(kStrategy strat, BOOLEAN withT)
void updateResult(ideal r, ideal Q, kStrategy strat)
static void pLmFree(poly p)
frees the space of the monomial m, assumes m != NULL coef is not freed, m is not advanced ...
KINLINE void clearS(poly p, unsigned long p_sev, int *at, int *k, kStrategy strat)
int(* test_PosInT)(const TSet T, const int tl, LObject &h)
void sort(CFArray &A, int l=0)
quick sort A
void p_Write(poly p, ring lmRing, ring tailRing)
int(* test_PosInL)(const LSet set, const int length, LObject *L, const kStrategy strat)
static poly p_Add_q(poly p, poly q, const ring r)
poly redtailSba(LObject *L, int pos, kStrategy strat, BOOLEAN withT, BOOLEAN normalize)
BOOLEAN idIs0(ideal h)
returns true if h is the zero ideal
void Werror(const char *fmt,...)
void kDebugPrint(kStrategy strat)
void enterSyz(LObject &p, kStrategy strat, int atT)
ideal idrMoveR_NoSort(ideal &id, ring src_r, ring dest_r)
#define pCopy(p)
return a copy of the poly