7 #define PLURAL_INTERNAL_DECLARATIONS 43 return(nc_ReduceSPoly(p1,
p_Copy(p2,r),r));
112 (*h).ecart = d-(*h).FDeg;
131 && ((d >= reddeg) || (pass > strat->
LazyPass))
134 at = strat->
posInL(strat->
L,strat->
Ll,h,strat);
180 for (i=
currRing->real_var_start;i<=currRing->real_var_end;i++)
256 Print(
" with S[%d]= ",c_j);
292 (*h).ecart = d-(*h).FDeg;
296 c_j=-1; c_e=-2; c_p=
NULL;
313 if ((c_j<0)||(c_e>=0))
330 if ((c_j<0)||(c_e>a_e))
575 if ((strat->
Ll >= 0) && ((d > reddeg) || (pass > strat->
LazyPass)))
636 int i,
j,at,reddeg,d,pass,ei;
652 ei = strat->
T[
j].ecart;
664 if ((!
BTEST1(20)) && (ei <= (*h).ecart))
667 if ((strat->
T[i].ecart < ei) &&
pDivisibleBy(strat->
T[i].p,(*h).p))
674 ei = strat->
T[
i].ecart;
691 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
730 if (ei <= (*h).ecart)
754 if ((strat->
Ll >= 0) && ((d > reddeg) || (pass > strat->
LazyPass)))
756 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
772 Print(
" degree jumped: -> L%d\n",at);
814 int j,jbest,at,reddeg,d,pass;
832 p=spSpolyCreate(strat->
T[j].p,(*h).p,strat->
kNoether);
856 ph=spSpolyCreate(strat->
T[j].p,(*h).p,strat->
kNoether);
869 else if (
pLmCmp(ph,p) == -1)
912 if ((strat->
Ll >= 0) && ((pass > strat->
LazyPass) || (d > reddeg)))
914 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
985 for(jj=
currRing->real_var_start;jj<=currRing->real_var_end;jj++)
987 if(
pGetExp(F->m[ii],jj)>0) { is_rat_id=
TRUE;
break; }
989 if (is_rat_id)
break;
1035 PrintS(
"<gnc_gr_bba>\n");
1076 while (strat->
Ll >= 0)
1095 strat->
P = strat->
L[strat->
Ll];
1099 if (strat->
P.p !=
NULL)
1117 #ifdef HAVE_RATGRING 1141 if (strat->
P.p !=
NULL)
1145 &olddeg,&reduc,strat, red_result);
1157 strat->red(&strat->P,strat);
1166 if (strat->
P.p !=
NULL)
1175 #ifdef HAVE_RATGRING 1181 PrintS(
"unit element detected:");
1185 strat->
P.p =
pOne();
1190 int pos=
posInS(strat,strat->
sl,strat->
P.p, strat->
P.ecart);
1196 #ifdef HAVE_RATGRING 1225 if (strat->
sl==-1) pos=0;
1226 else pos=
posInS(strat,strat->
sl,strat->
P.p,strat->
P.ecart);
1228 strat->
enterS(strat->
P,pos,strat,-1);
1281 PrintS(
"</gnc_gr_bba>\n");
1286 return (strat->
Shdl);
1293 WarnS(
"Sorry, non-commutative mora is not yet implemented!");
void initEcartPairBba(LObject *Lp, poly, poly, int, int)
int posInL11(const LSet set, const int length, LObject *p, const kStrategy)
int(* posInL)(const LSet set, const int length, LObject *L, const kStrategy strat)
void nc_gr_initBba(ideal F, kStrategy strat)
nc_gr_initBba is needed for sca_gr_bba and gr_bba.
ideal k_gnc_gr_bba(const ideal F, const ideal Q, const intvec *, const intvec *, kStrategy strat, const ring _currRing)
#define TEST_OPT_DEGBOUND
void initBuchMoraPos(kStrategy strat)
void message(int i, int *reduc, int *olddeg, kStrategy strat, int red_result)
void messageStat(int hilbcount, kStrategy strat)
static int si_min(const int a, const int b)
Compatiblity layer for legacy polynomial operations (over currRing)
void initBuchMora(ideal F, ideal Q, kStrategy strat)
#define pLmCmp(p, q)
returns 0|1|-1 if p=q|p>q|p<q w.r.t monomial ordering
static BOOLEAN rIsRatGRing(const ring r)
static short rVar(const ring r)
#define rVar(r) (r->N)
void enterpairs(poly h, int k, int ecart, int pos, kStrategy strat, int atR)
poly nc_rat_ReduceSpolyNew(const poly p1, poly p2, int ishift, const ring r)
static void kDeleteLcm(LObject *P)
static long p_Totaldegree(poly p, const ring r)
void(* initEcartPair)(LObject *h, poly f, poly g, int ecartF, int ecartG)
poly nc_CreateShortSpoly(poly p1, poly p2, const ring r)
void enterL(LSet *set, int *length, int *LSetmax, LObject p, int at)
int(* red)(LObject *L, kStrategy strat)
KINLINE poly redtailBba(poly p, int pos, kStrategy strat, BOOLEAN normalize)
int(* posInT)(const TSet T, const int tl, LObject &h)
static poly p_Copy(poly p, const ring r)
returns a copy of p
poly gnc_ReduceSpolyNew(const poly p1, poly p2, const ring r)
void enterT(LObject &p, kStrategy strat, int atT)
void deleteInL(LSet set, int *length, int j, kStrategy strat)
void(* initEcart)(TObject *L)
#define pGetExp(p, i)
Exponent.
void ratGB_divide_out(poly p)
void initEcartPairMora(LObject *Lp, poly, poly, int ecartF, int ecartG)
#define TEST_OPT_INTSTRATEGY
int redGrRatGB(LObject *h, kStrategy strat)
static BOOLEAN rIsPluralRing(const ring r)
we must always have this test!
void initEcartBBA(TObject *h)
void(* enterS)(LObject &h, int pos, kStrategy strat, int atR)
static poly nc_ReduceSpoly(const poly p1, poly p2, const ring r)
int posInL0(const LSet set, const int length, LObject *p, const kStrategy)
#define pIsConstant(p)
like above, except that Comp must be 0
poly nc_rat_CreateSpoly(poly pp1, poly pp2, int ishift, const ring r)
void initBuchMoraCrit(kStrategy strat)
void rDebugPrint(const ring r)
void PrintS(const char *s)
static BOOLEAN p_LmDivisibleByPart(poly a, poly b, const ring r, const int start, const int end)
ideal k_gnc_gr_mora(const ideal F, const ideal Q, const intvec *, const intvec *, kStrategy strat, const ring _currRing)
void rWrite(ring r, BOOLEAN details)
#define pHead(p)
returns newly allocated copy of Lm(p), coef is copied, next=NULL, p might be NULL ...
static BOOLEAN p_LmDivisibleBy(poly a, poly b, const ring r)
void rChangeCurrRing(ring r)
int redGrFirst(LObject *h, kStrategy strat)
static void p_Delete(poly *p, const ring r)
BOOLEAN p_LmIsConstantRat(const poly p, const ring r)
#define pDivisibleBy(a, b)
returns TRUE, if leading monom of a divides leading monom of b i.e., if there exists a expvector c > ...
int posInT110(const TSet set, const int length, LObject &p)
void pNorm(poly p, const ring R=currRing)
int posInS(const kStrategy strat, const int length, const poly p, const int ecart_p)
void completeReduce(kStrategy strat, BOOLEAN withT)
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
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)
static poly nc_CreateSpoly(const poly p1, const poly p2, const ring r)
void p_wrp(poly p, ring lmRing, ring tailRing)
void initEcartNormal(TObject *h)
poly p_Cleardenom(poly p, const ring r)
void exitBuchMora(kStrategy strat)
void enterSBba(LObject &p, int atS, kStrategy strat, int atR)