My Project
Loading...
Searching...
No Matches
Macros | Typedefs | Functions | Variables
kstd1.h File Reference
#include "kernel/structs.h"
#include "polys/monomials/ring.h"

Go to the source code of this file.

Macros

#define KSTD_NF_LAZY   1
 
#define KSTD_NF_ECART   2
 
#define KSTD_NF_NONORM   4
 

Typedefs

typedef BOOLEAN(* s_poly_proc_t) (kStrategy strat)
 

Functions

ideal mora (ideal F, ideal Q, intvec *w, intvec *hilb, kStrategy strat)
 
poly kNF1 (ideal F, ideal Q, poly q, kStrategy strat, int lazyReduce)
 
ideal kNF1 (ideal F, ideal Q, ideal q, kStrategy strat, int lazyReduce)
 
poly kNF (ideal F, ideal Q, poly p, int syzComp=0, int lazyReduce=0)
 
ideal kNF (ideal F, ideal Q, ideal p, int syzComp=0, int lazyReduce=0)
 
poly kNFBound (ideal F, ideal Q, poly p, int bound, int syzComp=0, int lazyReduce=0)
 
ideal kNFBound (ideal F, ideal Q, ideal p, int bound, int syzComp=0, int lazyReduce=0)
 
ideal idDivRem (ideal A, const ideal quot, ideal &factor, ideal *unit, int lazyReduce=0)
 
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.
 
ideal kSba (ideal F, ideal Q, tHomog h, intvec **mw, int incremental=0, int arri=0, intvec *hilb=NULL, int syzComp=0, int newIdeal=0, intvec *vw=NULL)
 
ideal kStd (ideal F, ideal Q, tHomog h, intvec **mw, intvec *hilb=NULL, int syzComp=0, int newIdeal=0, intvec *vw=NULL, s_poly_proc_t sp=NULL)
 
ideal kStdShift (ideal F, ideal Q, tHomog h, intvec **mw, intvec *hilb=NULL, int syzComp=0, int newIdeal=0, intvec *vw=NULL, BOOLEAN rightGB=FALSE)
 
ideal rightgb (ideal F, const ideal Q)
 
void initMora (ideal F, kStrategy strat)
 
ideal kInterRed (ideal F, const ideal Q=NULL)
 
ideal kInterRedOld (ideal F, const ideal Q=NULL)
 
long kModDeg (poly p, const ring r=currRing)
 
long kHomModDeg (poly p, const ring r=currRing)
 
ideal stdred (ideal F, ideal Q, tHomog h, intvec **w)
 
ideal kMin_std (ideal F, ideal Q, tHomog h, intvec **w, ideal &M, intvec *hilb=NULL, int syzComp=0, int reduced=0)
 
BOOLEAN kVerify (ideal F, ideal Q)
 

Variables

EXTERN_VAR int Kstd1_mu
 
EXTERN_VAR int Kstd1_deg
 
EXTERN_VAR BITSET kOptions
 
EXTERN_VAR BITSET validOpts
 
EXTERN_VAR intveckModW
 
EXTERN_VAR intveckHomW
 

Macro Definition Documentation

◆ KSTD_NF_ECART

#define KSTD_NF_ECART   2

Definition at line 19 of file kstd1.h.

◆ KSTD_NF_LAZY

#define KSTD_NF_LAZY   1

Definition at line 17 of file kstd1.h.

◆ KSTD_NF_NONORM

#define KSTD_NF_NONORM   4

Definition at line 21 of file kstd1.h.

Typedef Documentation

◆ s_poly_proc_t

typedef BOOLEAN(* s_poly_proc_t) (kStrategy strat)

Definition at line 14 of file kstd1.h.

Function Documentation

◆ idDivRem()

ideal idDivRem ( ideal A,
const ideal quot,
ideal & factor,
ideal * unit,
int lazyReduce = 0 )

Definition at line 347 of file kLiftstd.cc.

348{
349 /* special cases */
350 if (idIs0(A) || idIs0(quot))
351 {
353 setUnit(A->rank,unit);
354 return idCopy(A);
355 }
356 /* ideal or module? */
359 int lsmod=0;
360 if (k==0) { lsmod=1;k=1;} /*ideal*/
361 /* new ring */
365 /* move ideals to new ring */
367 ideal s_A;
368 if (orig_ring != syz_ring)
369 {
372 }
373 else
374 {
377 }
378 /* quot[i] -> quot[i]+e(k+i+1) */
379 for(int i=0;i<IDELEMS(s_quot);i++)
380 {
382 poly p=p_One(syz_ring);
385 s_quot->m[i]=p_Add_q(s_quot->m[i],p,syz_ring);
386 }
387 s_quot->rank=k+IDELEMS(quot)+1;
388 /* A[i] -> A[i]*e(1) */
389 if (lsmod==1)
390 {
391 for(int i=0;i<IDELEMS(s_A);i++)
392 {
393 p_Shift(&s_A->m[i],1,syz_ring);
394 }
395 }
396 if (unit!=NULL)
397 {
398 int u_k=k+IDELEMS(quot)+2;
399 for(int i=0;i<IDELEMS(s_A);i++)
400 {
401 poly p=p_One(syz_ring);
404 s_A->m[i]=p_Add_q(s_A->m[i],p,syz_ring);
405 }
406 s_A->rank=k+IDELEMS(quot)+IDELEMS(A)+1;
407 }
408 /* normalform */
410 /* clean s_quot,s_A */
413 /* interpret rest: remainder */
415 for(int i=0;i<IDELEMS(rest);i++)
416 {
417 poly p=rest->m[i];
418 poly d=NULL;
419 while(p!=NULL)
420 {
421 poly q=p; pIter(p);
422 pNext(q)=NULL;
423 if (p_GetComp(q,syz_ring)<=k)
424 {
425 result->m[i]=p_Add_q(result->m[i],q,syz_ring);
426 }
427 else
428 {
429 d=p_Add_q(d,q,syz_ring);
430 }
431 }
432 rest->m[i]=d;
434 }
435 /* interpret rest: factors */
437 if (unit==NULL)
438 {
439 for(int i=0;i<IDELEMS(rest);i++)
440 {
441 poly p=rest->m[i];
442 p_Shift(&p,-k-lsmod-1,syz_ring);
443 factor->m[i]=p;
444 factor->m[i]=p_Neg(factor->m[i],syz_ring);
445 rest->m[i]=NULL;
446 }
447 }
448 else
449 {
451 /* comp k+1..u_k-1 -> rest, u_k.. -> unit*/
452 int u_k=k+IDELEMS(quot)+2;
453 for(int i=0;i<IDELEMS(rest);i++)
454 {
455 poly p=rest->m[i];
456 rest->m[i]=NULL;
457 poly d=NULL;
458 while(p!=NULL)
459 {
460 poly q=p; pIter(p);
461 pNext(q)=NULL;
462 if(p_GetComp(q,syz_ring)<u_k)
463 {
464 p_Shift(&q,-k-1,syz_ring);
465 factor->m[i]=p_Add_q(factor->m[i],q,syz_ring);
466 }
467 else
468 {
469 d=p_Add_q(d,q,syz_ring);
470 }
471 }
472 (*unit)->m[i]=d;
473 /*fix sign:*/
474 factor->m[i]=p_Neg(factor->m[i],syz_ring);
475 p_Shift(&(*unit)->m[i],-(IDELEMS(quot)+k+1),syz_ring);
476 }
477 }
479 if (orig_ring != syz_ring)
480 {
484 if (unit!=NULL)
485 {
487 }
489 }
490 return result;
491}
#define TRUE
Definition auxiliary.h:100
int i
Definition cfEzgcd.cc:132
int k
Definition cfEzgcd.cc:99
int p
Definition cfModGcd.cc:4077
return result
CanonicalForm factor
Definition facAbsFact.cc:97
ideal id_Copy(ideal h1, const ring r)
copy an ideal
BOOLEAN idIs0(ideal h)
returns true if h is the zero ideal
ideal idCopy(ideal A)
Definition ideals.h:60
static void setUnit(int e, ideal *unit)
Definition kLiftstd.cc:334
poly kNF(ideal F, ideal Q, poly p, int syzComp, int lazyReduce)
Definition kstd1.cc:3185
#define p_GetComp(p, r)
Definition monomials.h:64
#define pIter(p)
Definition monomials.h:37
#define pNext(p)
Definition monomials.h:36
#define NULL
Definition omList.c:12
void p_Shift(poly *p, int i, const ring r)
shifts components of the vector p by i
Definition p_polys.cc:4706
poly p_One(const ring r)
Definition p_polys.cc:1313
static poly p_Neg(poly p, const ring r)
Definition p_polys.h:1107
static poly p_Add_q(poly p, poly q, const ring r)
Definition p_polys.h:936
static unsigned long p_SetComp(poly p, unsigned long c, ring r)
Definition p_polys.h:247
static void p_Setm(poly p, const ring r)
Definition p_polys.h:233
void rChangeCurrRing(ring r)
Definition polys.cc:15
VAR ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
Definition polys.cc:13
ideal idrMoveR(ideal &id, ring src_r, ring dest_r)
Definition prCopy.cc:248
ideal idrMoveR_NoSort(ideal &id, ring src_r, ring dest_r)
Definition prCopy.cc:261
ideal idrCopyR_NoSort(ideal id, ring src_r, ring dest_r)
Definition prCopy.cc:205
ring rAssure_SyzOrder(const ring r, BOOLEAN complete)
Definition ring.cc:4439
void rDelete(ring r)
unconditionally deletes fields in r
Definition ring.cc:450
void rSetSyzComp(int k, const ring r)
Definition ring.cc:5147
ideal idInit(int idsize, int rank)
initialise an ideal / module
void id_Delete(ideal *h, ring r)
deletes an ideal/module/matrix
long id_RankFreeModule(ideal s, ring lmRing, ring tailRing)
return the maximal component number found in any polynomial in s
#define IDELEMS(i)
#define A
Definition sirandom.c:24

◆ initMora()

void initMora ( ideal F,
kStrategy strat )

!

Definition at line 1819 of file kstd1.cc.

1820{
1821 int i,j;
1822
1823 strat->NotUsedAxis = (BOOLEAN *)omAlloc(((currRing->N)+1)*sizeof(BOOLEAN));
1824 for (j=(currRing->N); j>0; j--) strat->NotUsedAxis[j] = TRUE;
1825 strat->enterS = enterSMora;
1826 strat->initEcartPair = initEcartPairMora; /*- ecart approximation -*/
1827 strat->posInLOld = strat->posInL;
1828 strat->posInLOldFlag = TRUE;
1829 strat->initEcart = initEcartNormal;
1830 strat->kAllAxis = (currRing->ppNoether) != NULL; //!!
1831 if ( currRing->ppNoether != NULL )
1832 {
1833 strat->kNoether = pCopy((currRing->ppNoether));
1834 strat->red = redFirst; /*take the first possible in T*/
1835 if (TEST_OPT_PROT)
1836 {
1837 Print("H(%ld)",p_FDeg(currRing->ppNoether,currRing)+1);
1838 mflush();
1839 }
1840 }
1841 else if (strat->homog)
1842 strat->red = redFirst; /*take the first possible in T*/
1843 else
1844 strat->red = redEcart;/*take the first possible in under ecart-restriction*/
1845 if (currRing->ppNoether != NULL)
1846 {
1847 HCord = currRing->pFDeg((currRing->ppNoether),currRing)+1;
1848 }
1849 else
1850 {
1851 HCord = 32000;/*- very large -*/
1852 }
1853
1855 {
1856 if (rField_is_Z(currRing))
1857 strat->red = redRiloc_Z;
1858 else
1859 strat->red = redRiloc;
1860 }
1861
1862 /*reads the ecartWeights used for Graebes method from the
1863 *intvec ecart and set ecartWeights
1864 */
1865 if ((TEST_OPT_WEIGHTM)&&(F!=NULL))
1866 {
1867 //interred machen Aenderung
1868 strat->pOrigFDeg=currRing->pFDeg;
1869 strat->pOrigLDeg=currRing->pLDeg;
1870 ecartWeights=(short *)omAlloc(((currRing->N)+1)*sizeof(short));
1871 /*uses automatic computation of the ecartWeights to set them*/
1873
1875 if (TEST_OPT_PROT)
1876 {
1877 for(i=1; i<=(currRing->N); i++)
1878 Print(" %d",ecartWeights[i]);
1879 PrintLn();
1880 mflush();
1881 }
1882 }
1883 kOptimizeLDeg(currRing->pLDeg, strat);
1884}
int BOOLEAN
Definition auxiliary.h:87
char posInLOldFlag
Definition kutil.h:382
poly kNoether
Definition kutil.h:329
BOOLEAN * NotUsedAxis
Definition kutil.h:332
int(* posInL)(const LSet set, const int length, LObject *L, const kStrategy strat)
Definition kutil.h:284
pFDegProc pOrigFDeg
Definition kutil.h:296
int(* posInLOld)(const LSet Ls, const int Ll, LObject *Lo, const kStrategy strat)
Definition kutil.h:288
void(* initEcartPair)(LObject *h, poly f, poly g, int ecartF, int ecartG)
Definition kutil.h:287
char kAllAxis
Definition kutil.h:376
void(* enterS)(LObject &h, int pos, kStrategy strat, int atR)
Definition kutil.h:286
void(* initEcart)(TObject *L)
Definition kutil.h:280
int(* red)(LObject *L, kStrategy strat)
Definition kutil.h:278
char homog
Definition kutil.h:372
pLDegProc pOrigLDeg
Definition kutil.h:297
#define Print
Definition emacs.cc:80
int j
Definition facHensel.cc:110
int redFirst(LObject *h, kStrategy strat)
Definition kstd1.cc:797
int redEcart(LObject *h, kStrategy strat)
Definition kstd1.cc:169
static void kOptimizeLDeg(pLDegProc ldeg, kStrategy strat)
Definition kstd1.cc:100
int redRiloc(LObject *h, kStrategy strat)
Definition kstd1.cc:387
void enterSMora(LObject &p, int atS, kStrategy strat, int atR=-1)
Definition kstd1.cc:1628
int redRiloc_Z(LObject *h, kStrategy strat)
Definition kstd1.cc:568
VAR int HCord
Definition kutil.cc:246
void initEcartPairMora(LObject *Lp, poly, poly, int ecartF, int ecartG)
Definition kutil.cc:1325
void initEcartNormal(TObject *h)
Definition kutil.cc:1303
#define omAlloc(size)
#define TEST_OPT_WEIGHTM
Definition options.h:121
#define TEST_OPT_PROT
Definition options.h:103
void pSetDegProcs(ring r, pFDegProc new_FDeg, pLDegProc new_lDeg)
Definition p_polys.cc:3637
static long p_FDeg(const poly p, const ring r)
Definition p_polys.h:380
#define pCopy(p)
return a copy of the poly
Definition polys.h:185
void PrintLn()
Definition reporter.cc:310
#define mflush()
Definition reporter.h:58
static BOOLEAN rField_is_Z(const ring r)
Definition ring.h:509
#define rField_is_Ring(R)
Definition ring.h:485
long totaldegreeWecart(poly p, ring r)
Definition weight.cc:217
long maxdegreeWecart(poly p, int *l, ring r)
Definition weight.cc:247
void kEcartWeights(poly *s, int sl, short *eweight, const ring R)
Definition weight.cc:182
EXTERN_VAR short * ecartWeights
Definition weight.h:12

◆ k_NF()

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.

Definition at line 3399 of file kstd1.cc.

3400{
3401 const ring save = currRing;
3403 poly ret = kNF(F, Q, p, syzComp, lazyReduce);
3405 return ret;
3406}
#define Q
Definition sirandom.c:26

◆ kHomModDeg()

long kHomModDeg ( poly p,
const ring r = currRing )

Definition at line 2436 of file kstd1.cc.

2437{
2438 int i;
2439 long j=0;
2440
2441 for (i=r->N;i>0;i--)
2442 j+=p_GetExp(p,i,r)*(*kHomW)[i-1];
2443 if (kModW == NULL) return j;
2444 i = __p_GetComp(p,r);
2445 if (i==0) return j;
2446 return j+(*kModW)[i-1];
2447}
VAR intvec * kModW
Definition kstd1.cc:2424
#define __p_GetComp(p, r)
Definition monomials.h:63
static long p_GetExp(const poly p, const unsigned long iBitmask, const int VarOffset)
get a single variable exponent @Note: the integer VarOffset encodes:
Definition p_polys.h:469

◆ kInterRed()

ideal kInterRed ( ideal F,
const ideal Q = NULL )

Definition at line 3764 of file kstd1.cc.

3765{
3766#ifdef HAVE_PLURAL
3767 if(rIsPluralRing(currRing)) return kInterRedOld(F,Q);
3768#endif
3771 )
3772 return kInterRedOld(F,Q);
3773
3774 //return kInterRedOld(F,Q);
3775
3776 BITSET save1;
3778 //si_opt_1|=Sy_bit(OPT_NOT_SUGAR);
3780 //si_opt_1&= ~Sy_bit(OPT_REDTAIL);
3781 //si_opt_1&= ~Sy_bit(OPT_REDSB);
3782 //extern char * showOption() ;
3783 //Print("%s\n",showOption());
3784
3785 int need_retry;
3786 int counter=3;
3787 ideal res, res1;
3788 int elems;
3789 ideal null=NULL;
3790 if ((Q==NULL) || (!TEST_OPT_REDSB))
3791 {
3792 elems=idElem(F);
3794 }
3795 else
3796 {
3797 ideal FF=idSimpleAdd(F,Q);
3799 idDelete(&FF);
3800 null=idInit(1,1);
3801 if (need_retry)
3803 else
3804 res1=kNF(null,Q,res);
3805 idDelete(&res);
3806 res=res1;
3807 need_retry=1;
3808 }
3809 if (idElem(res)<=1) need_retry=0;
3810 while (need_retry && (counter>0))
3811 {
3812 #ifdef KDEBUG
3813 if (TEST_OPT_DEBUG) { Print("retry counter %d\n",counter); }
3814 #endif
3816 int new_elems=idElem(res1);
3817 counter -= (new_elems >= elems);
3818 elems = new_elems;
3819 idDelete(&res);
3820 if (idElem(res1)<=1) need_retry=0;
3821 if ((Q!=NULL) && (TEST_OPT_REDSB))
3822 {
3823 if (need_retry)
3825 else
3826 res=kNF(null,Q,res1);
3827 idDelete(&res1);
3828 }
3829 else
3830 res = res1;
3831 if (idElem(res)<=1) need_retry=0;
3832 }
3833 if (null!=NULL) idDelete(&null);
3836 return res;
3837}
CanonicalForm res
Definition facAbsFact.cc:60
#define idDelete(H)
delete an ideal
Definition ideals.h:29
#define idSimpleAdd(A, B)
Definition ideals.h:42
ideal kInterRedBba(ideal F, ideal Q, int &need_retry)
Definition kstd1.cc:3504
ideal kInterRedOld(ideal F, const ideal Q)
Definition kstd1.cc:3412
#define KSTD_NF_LAZY
Definition kstd1.h:17
VAR unsigned si_opt_1
Definition options.c:5
#define SI_SAVE_OPT1(A)
Definition options.h:21
#define SI_RESTORE_OPT1(A)
Definition options.h:24
#define OPT_REDTHROUGH
Definition options.h:82
#define Sy_bit(x)
Definition options.h:31
#define TEST_OPT_REDSB
Definition options.h:104
#define TEST_OPT_DEBUG
Definition options.h:108
static BOOLEAN rIsPluralRing(const ring r)
we must always have this test!
Definition ring.h:400
static BOOLEAN rField_is_numeric(const ring r)
Definition ring.h:515
BOOLEAN rHasLocalOrMixedOrdering(const ring r)
Definition ring.h:762
void idSkipZeroes(ideal ide)
gives an ideal/module the minimal possible size
static int idElem(const ideal F)
number of non-zero polys in F
#define BITSET
Definition structs.h:16

◆ kInterRedOld()

ideal kInterRedOld ( ideal F,
const ideal Q = NULL )

Definition at line 3412 of file kstd1.cc.

3413{
3414 int j;
3415 kStrategy strat = new skStrategy;
3416
3417 ideal tempF = F;
3418 ideal tempQ = Q;
3419
3420#ifdef HAVE_PLURAL
3421 if(rIsSCA(currRing))
3422 {
3423 const unsigned int m_iFirstAltVar = scaFirstAltVar(currRing);
3424 const unsigned int m_iLastAltVar = scaLastAltVar(currRing);
3426
3427 // this should be done on the upper level!!! :
3428 // tempQ = SCAQuotient(currRing);
3429
3430 if(Q == currRing->qideal)
3432 }
3433#endif
3434
3435// if (TEST_OPT_PROT)
3436// {
3437// writeTime("start InterRed:");
3438// mflush();
3439// }
3440 //strat->syzComp = 0;
3441 strat->kAllAxis = (currRing->ppNoether) != NULL;
3442 strat->kNoether=pCopy((currRing->ppNoether));
3444 initBuchMoraCrit(strat);
3445 strat->NotUsedAxis = (BOOLEAN *)omAlloc(((currRing->N)+1)*sizeof(BOOLEAN));
3446 for (j=(currRing->N); j>0; j--) strat->NotUsedAxis[j] = TRUE;
3447 strat->enterS = enterSBba;
3448 strat->posInT = posInT17;
3449 strat->initEcart = initEcartNormal;
3450 strat->sl = -1;
3451 strat->tl = -1;
3452 strat->tmax = setmaxT;
3453 strat->T = initT();
3454 strat->R = initR();
3455 strat->sevT = initsevT();
3457 initS(tempF, tempQ, strat);
3458 if (TEST_OPT_REDSB)
3459 strat->noTailReduction=FALSE;
3460 updateS(TRUE,strat);
3462 completeReduce(strat);
3463 //else if (TEST_OPT_PROT) PrintLn();
3464 cleanT(strat);
3465 if (strat->kNoether!=NULL) pLmFree(&strat->kNoether);
3466 omFreeSize((ADDRESS)strat->T,strat->tmax*sizeof(TObject));
3467 omFreeSize((ADDRESS)strat->ecartS,IDELEMS(strat->Shdl)*sizeof(int));
3468 omFreeSize((ADDRESS)strat->sevS,IDELEMS(strat->Shdl)*sizeof(unsigned long));
3469 omFreeSize((ADDRESS)strat->NotUsedAxis,((currRing->N)+1)*sizeof(BOOLEAN));
3470 omfree(strat->sevT);
3471 omfree(strat->S_2_R);
3472 omfree(strat->R);
3473
3474 if (strat->fromQ)
3475 {
3476 for (j=IDELEMS(strat->Shdl)-1;j>=0;j--)
3477 {
3478 if(strat->fromQ[j]) pDelete(&strat->Shdl->m[j]);
3479 }
3480 omFreeSize((ADDRESS)strat->fromQ,IDELEMS(strat->Shdl)*sizeof(int));
3481 }
3482// if (TEST_OPT_PROT)
3483// {
3484// writeTime("end Interred:");
3485// mflush();
3486// }
3487 ideal shdl=strat->Shdl;
3489 if (strat->fromQ)
3490 {
3491 strat->fromQ=NULL;
3493 idDelete(&shdl);
3494 shdl=res;
3495 }
3496 delete(strat);
3497#ifdef HAVE_PLURAL
3498 if( tempF != F )
3500#endif
3501 return shdl;
3502}
#define FALSE
Definition auxiliary.h:96
int * S_2_R
Definition kutil.h:342
char noTailReduction
Definition kutil.h:378
TSet T
Definition kutil.h:326
intset ecartS
Definition kutil.h:309
char honey
Definition kutil.h:377
int ak
Definition kutil.h:353
TObject ** R
Definition kutil.h:340
int tl
Definition kutil.h:350
unsigned long * sevT
Definition kutil.h:325
ideal Shdl
Definition kutil.h:303
int tmax
Definition kutil.h:350
intset fromQ
Definition kutil.h:321
int(* posInT)(const TSet T, const int tl, LObject &h)
Definition kutil.h:281
int sl
Definition kutil.h:348
unsigned long * sevS
Definition kutil.h:322
KINLINE TSet initT()
Definition kInline.h:84
KINLINE TObject ** initR()
Definition kInline.h:95
KINLINE unsigned long * initsevT()
Definition kInline.h:100
ideal kInterRed(ideal F, const ideal Q)
Definition kstd1.cc:3764
int posInT17(const TSet set, const int length, LObject &p)
Definition kutil.cc:5305
void initS(ideal F, ideal Q, kStrategy strat)
Definition kutil.cc:7634
void updateS(BOOLEAN toT, kStrategy strat)
Definition kutil.cc:8593
void cleanT(kStrategy strat)
Definition kutil.cc:564
void initBuchMoraCrit(kStrategy strat)
Definition kutil.cc:9475
void completeReduce(kStrategy strat, BOOLEAN withT)
Definition kutil.cc:10339
void enterSBba(LObject &p, int atS, kStrategy strat, int atR)
Definition kutil.cc:8828
#define setmaxT
Definition kutil.h:33
class sTObject TObject
Definition kutil.h:57
static bool rIsSCA(const ring r)
Definition nc.h:190
ideal id_KillSquares(const ideal id, const short iFirstAltVar, const short iLastAltVar, const ring r, const bool bSkipZeroes)
Definition sca.cc:1518
#define omfree(addr)
#define omFreeSize(addr, size)
#define TEST_OPT_INTSTRATEGY
Definition options.h:110
#define pDelete(p_ptr)
Definition polys.h:186
static void pLmFree(poly p)
frees the space of the monomial m, assumes m != NULL coef is not freed, m is not advanced
Definition polys.h:70
ideal SCAQuotient(const ring r)
Definition sca.h:10
static short scaLastAltVar(ring r)
Definition sca.h:25
static short scaFirstAltVar(ring r)
Definition sca.h:18

◆ kMin_std()

ideal kMin_std ( ideal F,
ideal Q,
tHomog h,
intvec ** w,
ideal & M,
intvec * hilb = NULL,
int syzComp = 0,
int reduced = 0 )

Definition at line 3035 of file kstd1.cc.

3037{
3038 if(idIs0(F))
3039 {
3040 M=idInit(1,F->rank);
3041 return idInit(1,F->rank);
3042 }
3044 {
3045 ideal sb;
3046 sb = kStd(F, Q, h, w, hilb);
3048 if(IDELEMS(sb) <= IDELEMS(F))
3049 {
3050 M = idCopy(sb);
3051 idSkipZeroes(M);
3052 return(sb);
3053 }
3054 else
3055 {
3056 M = idCopy(F);
3057 idSkipZeroes(M);
3058 return(sb);
3059 }
3060 }
3061 ideal r=NULL;
3062 int Kstd1_OldDeg = Kstd1_deg,i;
3064 BOOLEAN b=currRing->pLexOrder,toReset=FALSE;
3067 kStrategy strat=new skStrategy;
3068
3070 strat->syzComp = syzComp;
3072 strat->LazyPass=20;
3073 else
3074 strat->LazyPass=2;
3075 strat->LazyDegree = 1;
3076 strat->minim=(reduced % 2)+1;
3077 strat->ak = id_RankFreeModule(F,currRing);
3078 if (delete_w)
3079 {
3080 temp_w=new intvec((strat->ak)+1);
3081 w = &temp_w;
3082 }
3083 if (h==testHomog)
3084 {
3085 if (strat->ak == 0)
3086 {
3087 h = (tHomog)idHomIdeal(F,Q);
3088 w=NULL;
3089 }
3090 else
3091 {
3092 h = (tHomog)idHomModule(F,Q,w);
3093 }
3094 }
3095 if (h==isHomog)
3096 {
3097 if (strat->ak > 0 && (w!=NULL) && (*w!=NULL))
3098 {
3099 kModW = *w;
3100 strat->kModW = *w;
3101 assume(currRing->pFDeg != NULL && currRing->pLDeg != NULL);
3102 strat->pOrigFDeg = currRing->pFDeg;
3103 strat->pOrigLDeg = currRing->pLDeg;
3105
3106 toReset = TRUE;
3107 if (reduced>1)
3108 {
3110 Kstd1_deg = -1;
3111 for (i=IDELEMS(F)-1;i>=0;i--)
3112 {
3113 if ((F->m[i]!=NULL) && (currRing->pFDeg(F->m[i],currRing)>=Kstd1_deg))
3114 Kstd1_deg = currRing->pFDeg(F->m[i],currRing)+1;
3115 }
3116 }
3117 }
3118 currRing->pLexOrder = TRUE;
3119 strat->LazyPass*=2;
3120 }
3121 strat->homog=h;
3122 ideal SB=NULL;
3124 {
3125 r=idMinBase(F,&SB); // SB and M via minbase
3126 strat->M=r;
3127 r=SB;
3128 }
3129 else
3130 {
3131 if (w!=NULL)
3132 r=bba(F,Q,*w,hilb,strat);
3133 else
3134 r=bba(F,Q,NULL,hilb,strat);
3135 }
3136#ifdef KDEBUG
3137 {
3138 int i;
3139 for (i=IDELEMS(r)-1; i>=0; i--) pTest(r->m[i]);
3140 }
3141#endif
3142 idSkipZeroes(r);
3143 if (toReset)
3144 {
3146 kModW = NULL;
3147 }
3148 currRing->pLexOrder = b;
3149 if ((delete_w)&&(temp_w!=NULL)) delete temp_w;
3150 if ((IDELEMS(r)==1) && (r->m[0]!=NULL) && pIsConstant(r->m[0]) && (strat->ak==0))
3151 {
3152 M=idInit(1,F->rank);
3153 M->m[0]=pOne();
3154 //if (strat->ak!=0) { pSetComp(M->m[0],strat->ak); pSetmComp(M->m[0]); }
3155 if (strat->M!=NULL) idDelete(&strat->M);
3156 }
3157 else if (strat->M==NULL)
3158 {
3159 M=idInit(1,F->rank);
3160 WarnS("no minimal generating set computed");
3161 }
3162 else
3163 {
3164 idSkipZeroes(strat->M);
3165 M=strat->M;
3166 }
3167 delete(strat);
3168 if (reduced>2)
3169 {
3171 if (!oldDegBound)
3172 si_opt_1 &= ~Sy_bit(OPT_DEGBOUND);
3173 }
3174 else
3175 {
3176 if (IDELEMS(M)>IDELEMS(r))
3177 {
3178 idDelete(&M);
3179 M=idCopy(r);
3180 }
3181 }
3182 return r;
3183}
CanonicalForm b
Definition cfModGcd.cc:4102
intvec * kModW
Definition kutil.h:335
int syzComp
Definition kutil.h:354
int minim
Definition kutil.h:357
ideal M
Definition kutil.h:305
int LazyPass
Definition kutil.h:353
int LazyDegree
Definition kutil.h:353
#define WarnS
Definition emacs.cc:78
const CanonicalForm & w
Definition facAbsFact.cc:51
ideal idMinBase(ideal h1, ideal *SB)
Definition ideals.cc:51
static BOOLEAN idHomModule(ideal m, ideal Q, intvec **w)
Definition ideals.h:96
static BOOLEAN idHomIdeal(ideal id, ideal Q=NULL)
Definition ideals.h:91
STATIC_VAR Poly * h
Definition janet.cc:971
long kModDeg(poly p, const ring r)
Definition kstd1.cc:2426
ideal kStd(ideal F, ideal Q, tHomog h, intvec **w, intvec *hilb, int syzComp, int newIdeal, intvec *vw, s_poly_proc_t sp)
Definition kstd1.cc:2449
EXTERN_VAR int Kstd1_deg
Definition kstd1.h:50
ideal bba(ideal F, ideal Q, intvec *w, intvec *hilb, kStrategy strat)
Definition kstd2.cc:2626
#define assume(x)
Definition mod2.h:389
#define TEST_OPT_DEGBOUND
Definition options.h:113
#define TEST_OPT_RETURN_SB
Definition options.h:112
#define OPT_DEGBOUND
Definition options.h:90
void pRestoreDegProcs(ring r, pFDegProc old_FDeg, pLDegProc old_lDeg)
Definition p_polys.cc:3649
#define pTest(p)
Definition polys.h:414
#define pIsConstant(p)
like above, except that Comp must be 0
Definition polys.h:238
#define pOne()
Definition polys.h:315
static BOOLEAN rField_has_simple_inverse(const ring r)
Definition ring.h:548
#define M
Definition sirandom.c:25
tHomog
Definition structs.h:35
@ isHomog
Definition structs.h:37
@ testHomog
Definition structs.h:38

◆ kModDeg()

long kModDeg ( poly p,
const ring r = currRing )

Definition at line 2426 of file kstd1.cc.

2427{
2428 long o=p_WDegree(p, r);
2429 long i=__p_GetComp(p, r);
2430 if (i==0) return o;
2431 //assume((i>0) && (i<=kModW->length()));
2432 if (i<=kModW->length())
2433 return o+(*kModW)[i-1];
2434 return o;
2435}
static BOOLEAN length(leftv result, leftv arg)
Definition interval.cc:257
long p_WDegree(poly p, const ring r)
Definition p_polys.cc:714

◆ kNF() [1/2]

ideal kNF ( ideal F,
ideal Q,
ideal p,
int syzComp = 0,
int lazyReduce = 0 )

Definition at line 3283 of file kstd1.cc.

3284{
3285 ideal res;
3286 if (TEST_OPT_PROT)
3287 {
3288 Print("(S:%d)",IDELEMS(p));mflush();
3289 }
3290 if (idIs0(p))
3291 return idInit(IDELEMS(p),si_max(p->rank,F->rank));
3292
3293 ideal pp = p;
3294#ifdef HAVE_PLURAL
3295 if(rIsSCA(currRing))
3296 {
3297 const unsigned int m_iFirstAltVar = scaFirstAltVar(currRing);
3298 const unsigned int m_iLastAltVar = scaLastAltVar(currRing);
3300
3301 if(Q == currRing->qideal)
3303 }
3304#endif
3305
3306 if ((Q!=NULL)&&(idIs0(Q))) Q=NULL;
3307
3308 if ((idIs0(F))&&(Q==NULL))
3309 {
3310#ifdef HAVE_PLURAL
3311 if(p != pp)
3312 return pp;
3313#endif
3314 return idCopy(p); /*F+Q=0*/
3315 }
3316
3317 kStrategy strat=new skStrategy;
3318 strat->syzComp = syzComp;
3320 if (strat->ak>0) // only for module case, see Tst/Short/bug_reduce.tst
3321 {
3322 strat->ak = si_max(strat->ak,(int)F->rank);
3323 }
3324
3326 {
3327#ifdef HAVE_SHIFTBBA
3328 if (currRing->isLPring)
3329 {
3330 WerrorS("No local ordering possible for shift algebra");
3331 return(NULL);
3332 }
3333#endif
3334 res=kNF1(F,Q,pp,strat,lazyReduce);
3335 }
3336 else
3337 res=kNF2(F,Q,pp,strat,lazyReduce);
3338 delete(strat);
3339
3340#ifdef HAVE_PLURAL
3341 if(pp != p)
3343#endif
3344
3345 return res;
3346}
static int si_max(const int a, const int b)
Definition auxiliary.h:124
CanonicalForm FACTORY_PUBLIC pp(const CanonicalForm &)
CanonicalForm pp ( const CanonicalForm & f )
Definition cf_gcd.cc:676
void WerrorS(const char *s)
Definition feFopen.cc:24
poly kNF1(ideal F, ideal Q, poly q, kStrategy strat, int lazyReduce)
Definition kstd1.cc:2126
poly kNF2(ideal F, ideal Q, poly q, kStrategy strat, int lazyReduce)
Definition kstd2.cc:3950

◆ kNF() [2/2]

poly kNF ( ideal F,
ideal Q,
poly p,
int syzComp = 0,
int lazyReduce = 0 )

Definition at line 3185 of file kstd1.cc.

3186{
3187 if (p==NULL)
3188 return NULL;
3189
3190 poly pp = p;
3191
3192#ifdef HAVE_PLURAL
3193 if(rIsSCA(currRing))
3194 {
3195 const unsigned int m_iFirstAltVar = scaFirstAltVar(currRing);
3196 const unsigned int m_iLastAltVar = scaLastAltVar(currRing);
3198
3199 if(Q == currRing->qideal)
3201 }
3202#endif
3203 if((Q!=NULL) &&(idIs0(Q))) Q=NULL;
3204
3205 if ((idIs0(F))&&(Q==NULL))
3206 {
3207#ifdef HAVE_PLURAL
3208 if(p != pp)
3209 return pp;
3210#endif
3211 return pCopy(p); /*F+Q=0*/
3212 }
3213
3214 kStrategy strat=new skStrategy;
3215 strat->syzComp = syzComp;
3217 poly res;
3218
3220 {
3221#ifdef HAVE_SHIFTBBA
3222 if (currRing->isLPring)
3223 {
3224 WerrorS("No local ordering possible for shift algebra");
3225 return(NULL);
3226 }
3227#endif
3228 res=kNF1(F,Q,pp,strat,lazyReduce);
3229 }
3230 else
3231 res=kNF2(F,Q,pp,strat,lazyReduce);
3232 delete(strat);
3233
3234#ifdef HAVE_PLURAL
3235 if(pp != p)
3236 p_Delete(&pp, currRing);
3237#endif
3238 return res;
3239}
poly p_KillSquares(const poly p, const short iFirstAltVar, const short iLastAltVar, const ring r)
Definition sca.cc:1463
static void p_Delete(poly *p, const ring r)
Definition p_polys.h:901
#define pMaxComp(p)
Definition polys.h:299

◆ kNF1() [1/2]

ideal kNF1 ( ideal F,
ideal Q,
ideal q,
kStrategy strat,
int lazyReduce )

Definition at line 2271 of file kstd1.cc.

2272{
2273 assume(!idIs0(q));
2274 assume(!(idIs0(F)&&(Q==NULL)));
2275
2276// lazy_reduce flags: can be combined by |
2277//#define KSTD_NF_LAZY 1
2278 // do only a reduction of the leading term
2279//#define KSTD_NF_ECART 2
2280 // only local: reduce even with bad ecart
2281 poly p;
2282 int i;
2283 int j;
2284 int o;
2285 LObject h;
2286 ideal res;
2287 BITSET save1;
2289
2290 //if (idIs0(q)) return idInit(IDELEMS(q),si_max(q->rank,F->rank));
2291 //if ((idIs0(F))&&(Q==NULL))
2292 // return idCopy(q); /*F=0*/
2293 //strat->ak = si_max(idRankFreeModule(F),idRankFreeModule(q));
2294 /*- creating temp data structures------------------- -*/
2295 //strat->kAllAxis = (currRing->ppNoether) != NULL;
2296 strat->kNoether=pCopy((currRing->ppNoether));
2299 && (0<Kstd1_deg)
2300 && ((strat->kNoether==NULL)
2302 {
2303 pLmDelete(&strat->kNoether);
2304 strat->kNoether=pOne();
2305 pSetExp(strat->kNoether,1, Kstd1_deg+1);
2306 pSetm(strat->kNoether);
2307 //strat->kAllAxis=TRUE;
2308 }
2309 initBuchMoraCrit(strat);
2311 initBuchMoraPosRing(strat);
2312 else
2313 initBuchMoraPos(strat);
2314 initMora(F,strat);
2315 strat->enterS = enterSMoraNF;
2316 /*- set T -*/
2317 strat->tl = -1;
2318 strat->tmax = setmaxT;
2319 strat->T = initT();
2320 strat->R = initR();
2321 strat->sevT = initsevT();
2322 /*- set S -*/
2323 strat->sl = -1;
2324 /*- init local data struct.-------------------------- -*/
2325 /*Shdl=*/initS(F,Q,strat);
2326 if ((strat->ak!=0)
2327 && (strat->kNoether!=NULL))
2328 {
2329 if (strat->ak!=1)
2330 {
2331 pSetComp(strat->kNoether,1);
2332 pSetmComp(strat->kNoether);
2333 poly p=pHead(strat->kNoether);
2334 pSetComp(p,strat->ak);
2335 pSetmComp(p);
2336 p=pAdd(strat->kNoether,p);
2337 strat->kNoether=pNext(p);
2339 }
2340 }
2341 if (((lazyReduce & KSTD_NF_LAZY)==0)
2342 && (!rField_is_Ring(currRing)))
2343 {
2344 for (i=strat->sl; i>=0; i--)
2345 pNorm(strat->S[i]);
2346 }
2347 /*- compute------------------------------------------- -*/
2348 res=idInit(IDELEMS(q),strat->ak);
2349 for (i=0; i<IDELEMS(q); i++)
2350 {
2351 if (q->m[i]!=NULL)
2352 {
2353 p = pCopy(q->m[i]);
2354 deleteHC(&p,&o,&j,strat);
2355 if (p!=NULL)
2356 {
2357 /*- puts the elements of S also to T -*/
2358 for (j=0; j<=strat->sl; j++)
2359 {
2360 h.p = strat->S[j];
2361 h.ecart = strat->ecartS[j];
2362 h.pLength = h.length = pLength(h.p);
2363 if (strat->sevS[j] == 0) strat->sevS[j] = pGetShortExpVector(h.p);
2364 else assume(strat->sevS[j] == pGetShortExpVector(h.p));
2365 h.sev = strat->sevS[j];
2366 h.SetpFDeg();
2368 enterT_strong(h,strat);
2369 else
2370 enterT(h,strat);
2371 }
2372 if (TEST_OPT_PROT) { PrintS("r"); mflush(); }
2374 {
2375 p = redMoraNFRing(p,strat, lazyReduce);
2376 }
2377 else
2378 p = redMoraNF(p,strat, lazyReduce);
2379 if ((p!=NULL)&&((lazyReduce & KSTD_NF_LAZY)==0))
2380 {
2381 if (TEST_OPT_PROT) { PrintS("t"); mflush(); }
2382 p = redtail(p,strat->sl,strat);
2383 }
2384 cleanT(strat);
2385 }
2386 res->m[i]=p;
2387 }
2388 //else
2389 // res->m[i]=NULL;
2390 }
2391 /*- release temp data------------------------------- -*/
2392 assume(strat->L==NULL); /*strat->L unused */
2393 assume(strat->B==NULL); /*strat->B unused */
2394 omFreeSize((ADDRESS)strat->T,strat->tmax*sizeof(TObject));
2395 omFreeSize((ADDRESS)strat->ecartS,IDELEMS(strat->Shdl)*sizeof(int));
2396 omFreeSize((ADDRESS)strat->sevS,IDELEMS(strat->Shdl)*sizeof(unsigned long));
2397 omFreeSize((ADDRESS)strat->NotUsedAxis,((currRing->N)+1)*sizeof(BOOLEAN));
2398 omFree(strat->sevT);
2399 omFree(strat->S_2_R);
2400 omFree(strat->R);
2401 if ((Q!=NULL)&&(strat->fromQ!=NULL))
2402 {
2404 omFreeSize((ADDRESS)strat->fromQ,i*sizeof(int));
2405 strat->fromQ=NULL;
2406 }
2407 if (strat->kNoether!=NULL) pLmFree(&strat->kNoether);
2408// if ((TEST_OPT_WEIGHTM)&&(F!=NULL))
2409// {
2410// pFDeg=strat->pOrigFDeg;
2411// pLDeg=strat->pOrigLDeg;
2412// if (ecartWeights)
2413// {
2414// omFreeSize((ADDRESS *)&ecartWeights,((currRing->N)+1)*sizeof(short));
2415// ecartWeights=NULL;
2416// }
2417// }
2418 idDelete(&strat->Shdl);
2420 if (TEST_OPT_PROT) PrintLn();
2421 return res;
2422}
polyset S
Definition kutil.h:306
LSet B
Definition kutil.h:328
LSet L
Definition kutil.h:327
void initMora(ideal F, kStrategy strat)
Definition kstd1.cc:1819
void enterSMoraNF(LObject &p, int atS, kStrategy strat, int atR=-1)
Definition kstd1.cc:1681
static poly redMoraNFRing(poly h, kStrategy strat, int flag)
Definition kstd1.cc:1083
static poly redMoraNF(poly h, kStrategy strat, int flag)
Definition kstd1.cc:978
poly redtail(LObject *L, int end_pos, kStrategy strat)
Definition kutil.cc:6882
void enterT(LObject &p, kStrategy strat, int atT)
Definition kutil.cc:9177
void initBuchMoraPos(kStrategy strat)
Definition kutil.cc:9626
void enterT_strong(LObject &p, kStrategy strat, int atT)
Definition kutil.cc:9277
void deleteHC(LObject *L, kStrategy strat, BOOLEAN fromNext)
Definition kutil.cc:293
void initBuchMoraPosRing(kStrategy strat)
Definition kutil.cc:9712
#define setmaxTinc
Definition kutil.h:34
class sLObject LObject
Definition kutil.h:58
#define omFree(addr)
#define OPT_REDTAIL
Definition options.h:91
#define TEST_OPT_STAIRCASEBOUND
Definition options.h:115
static int pLength(poly a)
Definition p_polys.h:190
static void p_LmDelete(poly p, const ring r)
Definition p_polys.h:723
#define pAdd(p, q)
Definition polys.h:203
#define pHead(p)
returns newly allocated copy of Lm(p), coef is copied, next=NULL, p might be NULL
Definition polys.h:67
#define pSetm(p)
Definition polys.h:271
void pNorm(poly p)
Definition polys.h:362
#define pSetComp(p, v)
Definition polys.h:38
#define pLmDelete(p)
assume p != NULL, deletes Lm(p)->coef and Lm(p)
Definition polys.h:76
#define pGetShortExpVector(a)
returns the "Short Exponent Vector" – used to speed up divisibility tests (see polys-impl....
Definition polys.h:152
#define pSetmComp(p)
TODO:
Definition polys.h:273
#define pSetExp(p, i, v)
Definition polys.h:42
#define pWTotaldegree(p)
Definition polys.h:283
void PrintS(const char *s)
Definition reporter.cc:284

◆ kNF1() [2/2]

poly kNF1 ( ideal F,
ideal Q,
poly q,
kStrategy strat,
int lazyReduce )

Definition at line 2126 of file kstd1.cc.

2127{
2128 assume(q!=NULL);
2129 assume(!(idIs0(F)&&(Q==NULL)));
2130
2131// lazy_reduce flags: can be combined by |
2132//#define KSTD_NF_LAZY 1
2133 // do only a reduction of the leading term
2134//#define KSTD_NF_ECART 2
2135 // only local: reduce even with bad ecart
2136 poly p;
2137 int i;
2138 int j;
2139 int o;
2140 LObject h;
2141 BITSET save1;
2143
2144 //if ((idIs0(F))&&(Q==NULL))
2145 // return pCopy(q); /*F=0*/
2146 //strat->ak = si_max(idRankFreeModule(F),pMaxComp(q));
2147 /*- creating temp data structures------------------- -*/
2148 //strat->kAllAxis = (currRing->ppNoether) != NULL;
2149 strat->kNoether = pCopy((currRing->ppNoether));
2152 si_opt_1&=~Sy_bit(OPT_INTSTRATEGY);
2154 && (! TEST_V_DEG_STOP)
2155 && (0<Kstd1_deg)
2156 && ((strat->kNoether==NULL)
2158 {
2159 pLmDelete(&strat->kNoether);
2160 strat->kNoether=pOne();
2161 pSetExp(strat->kNoether,1, Kstd1_deg+1);
2162 pSetm(strat->kNoether);
2163 // strat->kAllAxis=TRUE;
2164 }
2165 initBuchMoraCrit(strat);
2167 initBuchMoraPosRing(strat);
2168 else
2169 initBuchMoraPos(strat);
2170 initMora(F,strat);
2171 strat->enterS = enterSMoraNF;
2172 /*- set T -*/
2173 strat->tl = -1;
2174 strat->tmax = setmaxT;
2175 strat->T = initT();
2176 strat->R = initR();
2177 strat->sevT = initsevT();
2178 /*- set S -*/
2179 strat->sl = -1;
2180 /*- init local data struct.-------------------------- -*/
2181 /*Shdl=*/initS(F,Q,strat);
2182 if ((strat->ak!=0)
2183 && (strat->kAllAxis)) /*never true for ring-cf*/
2184 {
2185 if (strat->ak!=1)
2186 {
2187 pSetComp(strat->kNoether,1);
2188 pSetmComp(strat->kNoether);
2189 poly p=pHead(strat->kNoether);
2190 pSetComp(p,strat->ak);
2191 pSetmComp(p);
2192 p=pAdd(strat->kNoether,p);
2193 strat->kNoether=pNext(p);
2195 }
2196 }
2197 if (((lazyReduce & KSTD_NF_LAZY)==0)
2198 && (!rField_is_Ring(currRing)))
2199 {
2200 for (i=strat->sl; i>=0; i--)
2201 pNorm(strat->S[i]);
2202 }
2203 /*- puts the elements of S also to T -*/
2204 for (i=0; i<=strat->sl; i++)
2205 {
2206 h.p = strat->S[i];
2207 h.ecart = strat->ecartS[i];
2208 if (strat->sevS[i] == 0) strat->sevS[i] = pGetShortExpVector(h.p);
2209 else assume(strat->sevS[i] == pGetShortExpVector(h.p));
2210 h.length = pLength(h.p);
2211 h.sev = strat->sevS[i];
2212 h.SetpFDeg();
2213 enterT(h,strat);
2214 }
2215#ifdef KDEBUG
2216// kDebugPrint(strat);
2217#endif
2218 /*- compute------------------------------------------- -*/
2219 p = pCopy(q);
2220 deleteHC(&p,&o,&j,strat);
2221 kTest(strat);
2222 if (TEST_OPT_PROT) { PrintS("r"); mflush(); }
2223 if (BVERBOSE(23)) kDebugPrint(strat);
2225 {
2226 if (p!=NULL) p = redMoraNFRing(p,strat, lazyReduce & KSTD_NF_ECART);
2227 }
2228 else
2229 {
2230 if (p!=NULL) p = redMoraNF(p,strat, lazyReduce & KSTD_NF_ECART);
2231 }
2232 if ((p!=NULL)&&((lazyReduce & KSTD_NF_LAZY)==0))
2233 {
2234 if (TEST_OPT_PROT) { PrintS("t"); mflush(); }
2235 p = redtail(p,strat->sl,strat);
2236 }
2237 /*- release temp data------------------------------- -*/
2238 cleanT(strat);
2239 assume(strat->L==NULL); /*strat->L unused */
2240 assume(strat->B==NULL); /*strat->B unused */
2241 omFreeSize((ADDRESS)strat->T,strat->tmax*sizeof(TObject));
2242 omFreeSize((ADDRESS)strat->ecartS,IDELEMS(strat->Shdl)*sizeof(int));
2243 omFreeSize((ADDRESS)strat->sevS,IDELEMS(strat->Shdl)*sizeof(unsigned long));
2244 omFreeSize((ADDRESS)strat->NotUsedAxis,((currRing->N)+1)*sizeof(BOOLEAN));
2245 omFree(strat->sevT);
2246 omFree(strat->S_2_R);
2247 omFree(strat->R);
2248
2249 if ((Q!=NULL)&&(strat->fromQ!=NULL))
2250 {
2251 i=((IDELEMS(Q)+IDELEMS(F)+15)/16)*16;
2252 omFreeSize((ADDRESS)strat->fromQ,i*sizeof(int));
2253 strat->fromQ=NULL;
2254 }
2255 if (strat->kNoether!=NULL) pLmFree(&strat->kNoether);
2256// if ((TEST_OPT_WEIGHTM)&&(F!=NULL))
2257// {
2258// pRestoreDegProcs(currRing,strat->pOrigFDeg, strat->pOrigLDeg);
2259// if (ecartWeights)
2260// {
2261// omFreeSize((ADDRESS *)&ecartWeights,((currRing->N)+1)*sizeof(short));
2262// ecartWeights=NULL;
2263// }
2264// }
2265 idDelete(&strat->Shdl);
2267 if (TEST_OPT_PROT) PrintLn();
2268 return p;
2269}
void kDebugPrint(kStrategy strat)
Definition kutil.cc:11559
#define KSTD_NF_ECART
Definition kstd1.h:19
BOOLEAN kTest(kStrategy strat)
Definition kutil.cc:1011
#define OPT_INTSTRATEGY
Definition options.h:92
#define BVERBOSE(a)
Definition options.h:35
#define TEST_V_DEG_STOP
Definition options.h:137

◆ kNFBound() [1/2]

ideal kNFBound ( ideal F,
ideal Q,
ideal p,
int bound,
int syzComp = 0,
int lazyReduce = 0 )

Definition at line 3348 of file kstd1.cc.

3349{
3350 ideal res;
3351 if (TEST_OPT_PROT)
3352 {
3353 Print("(S:%d)",IDELEMS(p));mflush();
3354 }
3355 if (idIs0(p))
3356 return idInit(IDELEMS(p),si_max(p->rank,F->rank));
3357
3358 ideal pp = p;
3359#ifdef HAVE_PLURAL
3360 if(rIsSCA(currRing))
3361 {
3362 const unsigned int m_iFirstAltVar = scaFirstAltVar(currRing);
3363 const unsigned int m_iLastAltVar = scaLastAltVar(currRing);
3365
3366 if(Q == currRing->qideal)
3368 }
3369#endif
3370
3371 if ((idIs0(F))&&(Q==NULL))
3372 {
3373#ifdef HAVE_PLURAL
3374 if(p != pp)
3375 return pp;
3376#endif
3377 return idCopy(p); /*F+Q=0*/
3378 }
3379
3380 kStrategy strat=new skStrategy;
3381 strat->syzComp = syzComp;
3383 if (strat->ak>0) // only for module case, see Tst/Short/bug_reduce.tst
3384 {
3385 strat->ak = si_max(strat->ak,(int)F->rank);
3386 }
3387
3388 res=kNF2Bound(F,Q,pp,bound,strat,lazyReduce);
3389 delete(strat);
3390
3391#ifdef HAVE_PLURAL
3392 if(pp != p)
3394#endif
3395
3396 return res;
3397}
static CanonicalForm bound(const CFMatrix &M)
Definition cf_linsys.cc:460
poly kNF2Bound(ideal F, ideal Q, poly q, int bound, kStrategy strat, int lazyReduce)
Definition kstd2.cc:4032

◆ kNFBound() [2/2]

poly kNFBound ( ideal F,
ideal Q,
poly p,
int bound,
int syzComp = 0,
int lazyReduce = 0 )

Definition at line 3241 of file kstd1.cc.

3242{
3243 if (p==NULL)
3244 return NULL;
3245
3246 poly pp = p;
3247
3248#ifdef HAVE_PLURAL
3249 if(rIsSCA(currRing))
3250 {
3251 const unsigned int m_iFirstAltVar = scaFirstAltVar(currRing);
3252 const unsigned int m_iLastAltVar = scaLastAltVar(currRing);
3254
3255 if(Q == currRing->qideal)
3257 }
3258#endif
3259
3260 if ((idIs0(F))&&(Q==NULL))
3261 {
3262#ifdef HAVE_PLURAL
3263 if(p != pp)
3264 return pp;
3265#endif
3266 return pCopy(p); /*F+Q=0*/
3267 }
3268
3269 kStrategy strat=new skStrategy;
3270 strat->syzComp = syzComp;
3272 poly res;
3273 res=kNF2Bound(F,Q,pp,bound,strat,lazyReduce);
3274 delete(strat);
3275
3276#ifdef HAVE_PLURAL
3277 if(pp != p)
3278 p_Delete(&pp, currRing);
3279#endif
3280 return res;
3281}

◆ kSba()

ideal kSba ( ideal F,
ideal Q,
tHomog h,
intvec ** mw,
int incremental = 0,
int arri = 0,
intvec * hilb = NULL,
int syzComp = 0,
int newIdeal = 0,
intvec * vw = NULL )

Definition at line 2634 of file kstd1.cc.

2636{
2637 if(idIs0(F))
2638 return idInit(1,F->rank);
2640 {
2641 ideal r;
2642 BOOLEAN b=currRing->pLexOrder,toReset=FALSE;
2644 kStrategy strat=new skStrategy;
2645 strat->sbaOrder = sbaOrder;
2646 if (arri!=0)
2647 {
2648 strat->rewCrit1 = arriRewDummy;
2649 strat->rewCrit2 = arriRewCriterion;
2651 }
2652 else
2653 {
2657 }
2658
2660 strat->syzComp = syzComp;
2661 if (TEST_OPT_SB_1)
2662 //if(!rField_is_Ring(currRing)) // always true here
2663 strat->newIdeal = newIdeal;
2665 strat->LazyPass=20;
2666 else
2667 strat->LazyPass=2;
2668 strat->LazyDegree = 1;
2672 strat->ak = id_RankFreeModule(F,currRing);
2673 strat->kModW=kModW=NULL;
2674 strat->kHomW=kHomW=NULL;
2675 if (vw != NULL)
2676 {
2677 currRing->pLexOrder=FALSE;
2678 strat->kHomW=kHomW=vw;
2679 strat->pOrigFDeg = currRing->pFDeg;
2680 strat->pOrigLDeg = currRing->pLDeg;
2682 toReset = TRUE;
2683 }
2684 if (h==testHomog)
2685 {
2686 if (strat->ak == 0)
2687 {
2688 h = (tHomog)idHomIdeal(F,Q);
2689 w=NULL;
2690 }
2691 else if (!TEST_OPT_DEGBOUND)
2692 {
2693 if (w!=NULL)
2694 h = (tHomog)idHomModule(F,Q,w);
2695 else
2696 h = (tHomog)idHomIdeal(F,Q);
2697 }
2698 }
2699 currRing->pLexOrder=b;
2700 if (h==isHomog)
2701 {
2702 if (strat->ak > 0 && (w!=NULL) && (*w!=NULL))
2703 {
2704 strat->kModW = kModW = *w;
2705 if (vw == NULL)
2706 {
2707 strat->pOrigFDeg = currRing->pFDeg;
2708 strat->pOrigLDeg = currRing->pLDeg;
2710 toReset = TRUE;
2711 }
2712 }
2713 currRing->pLexOrder = TRUE;
2714 if (hilb==NULL) strat->LazyPass*=2;
2715 }
2716 strat->homog=h;
2717 #ifdef KDEBUG
2718 idTest(F);
2719 if(Q != NULL)
2720 idTest(Q);
2721 #endif
2722 #ifdef HAVE_PLURAL
2724 {
2725 const BOOLEAN bIsSCA = rIsSCA(currRing) && strat->z2homog; // for Z_2 prod-crit
2726 strat->no_prod_crit = ! bIsSCA;
2727 if (w!=NULL)
2728 r = nc_GB(F, Q, *w, hilb, strat, currRing);
2729 else
2730 r = nc_GB(F, Q, NULL, hilb, strat, currRing);
2731 }
2732 else
2733 #endif
2734 {
2736 {
2737 if (w!=NULL)
2738 r=mora(F,Q,*w,hilb,strat);
2739 else
2740 r=mora(F,Q,NULL,hilb,strat);
2741 }
2742 else
2743 {
2744 strat->sigdrop = FALSE;
2745 if (w!=NULL)
2746 r=sba(F,Q,*w,hilb,strat);
2747 else
2748 r=sba(F,Q,NULL,hilb,strat);
2749 }
2750 }
2751 #ifdef KDEBUG
2752 idTest(r);
2753 #endif
2754 if (toReset)
2755 {
2756 kModW = NULL;
2758 }
2759 currRing->pLexOrder = b;
2760 //Print("%d reductions canceled \n",strat->cel);
2761 //delete(strat);
2762 if ((delete_w)&&(w!=NULL)&&(*w!=NULL)) delete *w;
2763 return r;
2764 }
2765 else
2766 {
2767 //--------------------------RING CASE-------------------------
2768 assume(sbaOrder == 1);
2769 assume(arri == 0);
2770 ideal r;
2771 r = idCopy(F);
2772 int sbaEnterS = -1;
2773 bool sigdrop = TRUE;
2774 //This is how we set the SBA algorithm;
2775 int totalsbaruns = 1,blockedreductions = 20,blockred = 0,loops = 0;
2776 while(sigdrop && (loops < totalsbaruns || totalsbaruns == -1)
2777 && (blockred <= blockedreductions))
2778 {
2779 loops++;
2780 if(loops == 1)
2781 sigdrop = FALSE;
2782 BOOLEAN b=currRing->pLexOrder,toReset=FALSE;
2784 kStrategy strat=new skStrategy;
2785 strat->sbaEnterS = sbaEnterS;
2786 strat->sigdrop = sigdrop;
2787 #if 0
2788 strat->blockred = blockred;
2789 #else
2790 strat->blockred = 0;
2791 #endif
2793 //printf("\nsbaEnterS beginning = %i\n",strat->sbaEnterS);
2794 //printf("\nsigdrop beginning = %i\n",strat->sigdrop);
2795 strat->sbaOrder = sbaOrder;
2796 if (arri!=0)
2797 {
2798 strat->rewCrit1 = arriRewDummy;
2799 strat->rewCrit2 = arriRewCriterion;
2801 }
2802 else
2803 {
2807 }
2808
2810 strat->syzComp = syzComp;
2811 if (TEST_OPT_SB_1)
2813 strat->newIdeal = newIdeal;
2815 strat->LazyPass=20;
2816 else
2817 strat->LazyPass=2;
2818 strat->LazyDegree = 1;
2822 strat->ak = id_RankFreeModule(F,currRing);
2823 strat->kModW=kModW=NULL;
2824 strat->kHomW=kHomW=NULL;
2825 if (vw != NULL)
2826 {
2827 currRing->pLexOrder=FALSE;
2828 strat->kHomW=kHomW=vw;
2829 strat->pOrigFDeg = currRing->pFDeg;
2830 strat->pOrigLDeg = currRing->pLDeg;
2832 toReset = TRUE;
2833 }
2834 if (h==testHomog)
2835 {
2836 if (strat->ak == 0)
2837 {
2838 h = (tHomog)idHomIdeal(F,Q);
2839 w=NULL;
2840 }
2841 else if (!TEST_OPT_DEGBOUND)
2842 {
2843 if (w!=NULL)
2844 h = (tHomog)idHomModule(F,Q,w);
2845 else
2846 h = (tHomog)idHomIdeal(F,Q);
2847 }
2848 }
2849 currRing->pLexOrder=b;
2850 if (h==isHomog)
2851 {
2852 if (strat->ak > 0 && (w!=NULL) && (*w!=NULL))
2853 {
2854 strat->kModW = kModW = *w;
2855 if (vw == NULL)
2856 {
2857 strat->pOrigFDeg = currRing->pFDeg;
2858 strat->pOrigLDeg = currRing->pLDeg;
2860 toReset = TRUE;
2861 }
2862 }
2863 currRing->pLexOrder = TRUE;
2864 if (hilb==NULL) strat->LazyPass*=2;
2865 }
2866 strat->homog=h;
2867 #ifdef KDEBUG
2868 idTest(F);
2869 if(Q != NULL)
2870 idTest(Q);
2871 #endif
2872 #ifdef HAVE_PLURAL
2874 {
2875 const BOOLEAN bIsSCA = rIsSCA(currRing) && strat->z2homog; // for Z_2 prod-crit
2876 strat->no_prod_crit = ! bIsSCA;
2877 if (w!=NULL)
2878 r = nc_GB(F, Q, *w, hilb, strat, currRing);
2879 else
2880 r = nc_GB(F, Q, NULL, hilb, strat, currRing);
2881 }
2882 else
2883 #endif
2884 {
2886 {
2887 if (w!=NULL)
2888 r=mora(F,Q,*w,hilb,strat);
2889 else
2890 r=mora(F,Q,NULL,hilb,strat);
2891 }
2892 else
2893 {
2894 if (w!=NULL)
2895 r=sba(r,Q,*w,hilb,strat);
2896 else
2897 {
2898 r=sba(r,Q,NULL,hilb,strat);
2899 }
2900 }
2901 }
2902 #ifdef KDEBUG
2903 idTest(r);
2904 #endif
2905 if (toReset)
2906 {
2907 kModW = NULL;
2909 }
2910 currRing->pLexOrder = b;
2911 //Print("%d reductions canceled \n",strat->cel);
2912 sigdrop = strat->sigdrop;
2913 sbaEnterS = strat->sbaEnterS;
2914 blockred = strat->blockred;
2915 delete(strat);
2916 if ((delete_w)&&(w!=NULL)&&(*w!=NULL)) delete *w;
2917 }
2918 // Go to std
2919 if(sigdrop || blockred > blockedreductions)
2920 {
2921 r = kStd(r, Q, h, w, hilb, syzComp, newIdeal, vw);
2922 }
2923 return r;
2924 }
2925}
bool sigdrop
Definition kutil.h:359
void(* chainCrit)(poly p, int ecart, kStrategy strat)
Definition kutil.h:291
BOOLEAN(* rewCrit1)(poly sig, unsigned long not_sevSig, poly lm, kStrategy strat, int start)
Definition kutil.h:293
BOOLEAN(* rewCrit3)(poly sig, unsigned long not_sevSig, poly lm, kStrategy strat, int start)
Definition kutil.h:295
intvec * kHomW
Definition kutil.h:336
int blockred
Definition kutil.h:364
unsigned sbaOrder
Definition kutil.h:316
int blockredmax
Definition kutil.h:365
int newIdeal
Definition kutil.h:356
char z2homog
Definition kutil.h:374
char no_prod_crit
Definition kutil.h:394
void(* enterOnePair)(int i, poly p, int ecart, int isFromQ, kStrategy strat, int atR)
Definition kutil.h:290
BOOLEAN(* rewCrit2)(poly sig, unsigned long not_sevSig, poly lm, kStrategy strat, int start)
Definition kutil.h:294
int sbaEnterS
Definition kutil.h:362
#define idTest(id)
Definition ideals.h:47
KINLINE BOOLEAN arriRewDummy(poly, unsigned long, poly, kStrategy, int)
Definition kInline.h:1263
static ideal nc_GB(const ideal F, const ideal Q, const intvec *w, const intvec *hilb, kStrategy strat, const ring r)
Definition nc.h:27
long kHomModDeg(poly p, const ring r)
Definition kstd1.cc:2436
ideal mora(ideal F, ideal Q, intvec *w, intvec *hilb, kStrategy strat)
Definition kstd1.cc:1888
VAR intvec * kHomW
Definition kstd1.cc:2424
ideal sba(ideal F0, ideal Q, intvec *w, intvec *hilb, kStrategy strat)
Definition kstd2.cc:2984
BOOLEAN arriRewCriterionPre(poly sig, unsigned long not_sevSig, poly lm, kStrategy strat, int)
Definition kutil.cc:6688
BOOLEAN arriRewCriterion(poly, unsigned long, poly, kStrategy strat, int start=0)
Definition kutil.cc:6663
void enterOnePairNormal(int i, poly p, int ecart, int isFromQ, kStrategy strat, int atR=-1)
Definition kutil.cc:1951
BOOLEAN faugereRewCriterion(poly sig, unsigned long not_sevSig, poly, kStrategy strat, int start=0)
Definition kutil.cc:6604
void chainCritOpt_1(poly, int, kStrategy strat)
Definition kutil.cc:3457
void chainCritNormal(poly p, int ecart, kStrategy strat)
Definition kutil.cc:3216
#define TEST_OPT_SB_1
Definition options.h:119

◆ kStd()

ideal kStd ( ideal F,
ideal Q,
tHomog h,
intvec ** mw,
intvec * hilb = NULL,
int syzComp = 0,
int newIdeal = 0,
intvec * vw = NULL,
s_poly_proc_t sp = NULL )

Definition at line 2449 of file kstd1.cc.

2451{
2452 if(idIs0(F))
2453 return idInit(1,F->rank);
2454
2455 if((Q!=NULL)&&(idIs0(Q))) Q=NULL;
2456#ifdef HAVE_SHIFTBBA
2457 if(rIsLPRing(currRing)) return kStdShift(F, Q, h, w, hilb, syzComp, newIdeal, vw, FALSE);
2458#endif
2459
2460 ideal r;
2461 BOOLEAN b=currRing->pLexOrder,toReset=FALSE;
2463 kStrategy strat=new skStrategy;
2464
2465 strat->s_poly=sp;
2467 strat->syzComp = syzComp;
2468 if (TEST_OPT_SB_1
2470 )
2471 strat->newIdeal = newIdeal;
2473 strat->LazyPass=20;
2474 else
2475 strat->LazyPass=2;
2476 strat->LazyDegree = 1;
2477 strat->ak = id_RankFreeModule(F,currRing);
2478 strat->kModW=kModW=NULL;
2479 strat->kHomW=kHomW=NULL;
2480 if (vw != NULL)
2481 {
2482 currRing->pLexOrder=FALSE;
2483 strat->kHomW=kHomW=vw;
2484 strat->pOrigFDeg = currRing->pFDeg;
2485 strat->pOrigLDeg = currRing->pLDeg;
2487 toReset = TRUE;
2488 }
2489 if (h==testHomog)
2490 {
2491 if (strat->ak == 0)
2492 {
2493 h = (tHomog)idHomIdeal(F,Q);
2494 w=NULL;
2495 }
2496 else if (!TEST_OPT_DEGBOUND)
2497 {
2498 if (w!=NULL)
2499 h = (tHomog)idHomModule(F,Q,w);
2500 else
2501 h = (tHomog)idHomIdeal(F,Q);
2502 }
2503 }
2504 currRing->pLexOrder=b;
2505 if (h==isHomog)
2506 {
2507 if (strat->ak > 0 && (w!=NULL) && (*w!=NULL))
2508 {
2509 strat->kModW = kModW = *w;
2510 if (vw == NULL)
2511 {
2512 strat->pOrigFDeg = currRing->pFDeg;
2513 strat->pOrigLDeg = currRing->pLDeg;
2515 toReset = TRUE;
2516 }
2517 }
2518 currRing->pLexOrder = TRUE;
2519 if (hilb==NULL) strat->LazyPass*=2;
2520 }
2521 strat->homog=h;
2522#ifdef KDEBUG
2523 idTest(F);
2524 if (Q!=NULL) idTest(Q);
2525#endif
2526#ifdef HAVE_PLURAL
2528 {
2529 const BOOLEAN bIsSCA = rIsSCA(currRing) && strat->z2homog; // for Z_2 prod-crit
2530 strat->no_prod_crit = ! bIsSCA;
2531 if (w!=NULL)
2532 r = nc_GB(F, Q, *w, hilb, strat, currRing);
2533 else
2534 r = nc_GB(F, Q, NULL, hilb, strat, currRing);
2535 }
2536 else
2537#endif
2538 {
2539 #if PRE_INTEGER_CHECK
2540 //the preinteger check strategy is not for modules
2541 if(nCoeff_is_Z(currRing->cf) && strat->ak <= 0)
2542 {
2543 ideal FCopy = idCopy(F);
2544 poly pFmon = preIntegerCheck(FCopy, Q);
2545 if(pFmon != NULL)
2546 {
2548 strat->kModW=kModW=NULL;
2549 if (h==testHomog)
2550 {
2551 if (strat->ak == 0)
2552 {
2554 w=NULL;
2555 }
2556 else if (!TEST_OPT_DEGBOUND)
2557 {
2558 if (w!=NULL)
2560 else
2562 }
2563 }
2564 currRing->pLexOrder=b;
2565 if (h==isHomog)
2566 {
2567 if (strat->ak > 0 && (w!=NULL) && (*w!=NULL))
2568 {
2569 strat->kModW = kModW = *w;
2570 if (vw == NULL)
2571 {
2572 strat->pOrigFDeg = currRing->pFDeg;
2573 strat->pOrigLDeg = currRing->pLDeg;
2575 toReset = TRUE;
2576 }
2577 }
2578 currRing->pLexOrder = TRUE;
2579 if (hilb==NULL) strat->LazyPass*=2;
2580 }
2581 strat->homog=h;
2582 }
2583 omTestMemory(1);
2584 if(w == NULL)
2585 {
2587 r=mora(FCopy,Q,NULL,hilb,strat);
2588 else
2589 r=bba(FCopy,Q,NULL,hilb,strat);
2590 }
2591 else
2592 {
2594 r=mora(FCopy,Q,*w,hilb,strat);
2595 else
2596 r=bba(FCopy,Q,*w,hilb,strat);
2597 }
2598 idDelete(&FCopy);
2599 }
2600 else
2601 #endif
2602 {
2603 if(w==NULL)
2604 {
2606 r=mora(F,Q,NULL,hilb,strat);
2607 else
2608 r=bba(F,Q,NULL,hilb,strat);
2609 }
2610 else
2611 {
2613 r=mora(F,Q,*w,hilb,strat);
2614 else
2615 r=bba(F,Q,*w,hilb,strat);
2616 }
2617 }
2618 }
2619#ifdef KDEBUG
2620 idTest(r);
2621#endif
2622 if (toReset)
2623 {
2624 kModW = NULL;
2626 }
2627 currRing->pLexOrder = b;
2628//Print("%d reductions canceled \n",strat->cel);
2629 delete(strat);
2630 if ((delete_w)&&(w!=NULL)&&(*w!=NULL)) delete *w;
2631 return r;
2632}
s_poly_proc_t s_poly
Definition kutil.h:300
static FORCE_INLINE BOOLEAN nCoeff_is_Z(const coeffs r)
Definition coeffs.h:813
BOOLEAN idInsertPoly(ideal h1, poly h2)
insert h2 into h1 (if h2 is not the zero polynomial) return TRUE iff h2 was indeed inserted
ideal kStdShift(ideal F, ideal Q, tHomog h, intvec **w, intvec *hilb, int syzComp, int newIdeal, intvec *vw, BOOLEAN rightGB)
Definition kstd1.cc:2928
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...
Definition kutil.cc:10595
omError_t omTestMemory(int check_level)
Definition omDebug.c:94
static BOOLEAN rIsLPRing(const ring r)
Definition ring.h:411

◆ kStdShift()

ideal kStdShift ( ideal F,
ideal Q,
tHomog h,
intvec ** mw,
intvec * hilb = NULL,
int syzComp = 0,
int newIdeal = 0,
intvec * vw = NULL,
BOOLEAN rightGB = FALSE )

Definition at line 2928 of file kstd1.cc.

2930{
2932 assume(idIsInV(F));
2933 ideal r;
2934 BOOLEAN b=currRing->pLexOrder,toReset=FALSE;
2936 kStrategy strat=new skStrategy;
2937
2938 strat->rightGB = rightGB;
2939
2941 strat->syzComp = syzComp;
2942 if (TEST_OPT_SB_1)
2944 strat->newIdeal = newIdeal;
2946 strat->LazyPass=20;
2947 else
2948 strat->LazyPass=2;
2949 strat->LazyDegree = 1;
2950 strat->ak = id_RankFreeModule(F,currRing);
2951 strat->kModW=kModW=NULL;
2952 strat->kHomW=kHomW=NULL;
2953 if (vw != NULL)
2954 {
2955 currRing->pLexOrder=FALSE;
2956 strat->kHomW=kHomW=vw;
2957 strat->pOrigFDeg = currRing->pFDeg;
2958 strat->pOrigLDeg = currRing->pLDeg;
2960 toReset = TRUE;
2961 }
2962 if (h==testHomog)
2963 {
2964 if (strat->ak == 0)
2965 {
2966 h = (tHomog)idHomIdeal(F,Q);
2967 w=NULL;
2968 }
2969 else if (!TEST_OPT_DEGBOUND)
2970 {
2971 if (w!=NULL)
2972 h = (tHomog)idHomModule(F,Q,w);
2973 else
2974 h = (tHomog)idHomIdeal(F,Q);
2975 }
2976 }
2977 currRing->pLexOrder=b;
2978 if (h==isHomog)
2979 {
2980 if (strat->ak > 0 && (w!=NULL) && (*w!=NULL))
2981 {
2982 strat->kModW = kModW = *w;
2983 if (vw == NULL)
2984 {
2985 strat->pOrigFDeg = currRing->pFDeg;
2986 strat->pOrigLDeg = currRing->pLDeg;
2988 toReset = TRUE;
2989 }
2990 }
2991 currRing->pLexOrder = TRUE;
2992 if (hilb==NULL) strat->LazyPass*=2;
2993 }
2994 strat->homog=h;
2995#ifdef KDEBUG
2996 idTest(F);
2997#endif
2999 {
3000 /* error: no local ord yet with shifts */
3001 WerrorS("No local ordering possible for shift algebra");
3002 return(NULL);
3003 }
3004 else
3005 {
3006 /* global ordering */
3007 if (w!=NULL)
3008 r=bbaShift(F,Q,*w,hilb,strat);
3009 else
3010 r=bbaShift(F,Q,NULL,hilb,strat);
3011 }
3012#ifdef KDEBUG
3013 idTest(r);
3014#endif
3015 if (toReset)
3016 {
3017 kModW = NULL;
3019 }
3020 currRing->pLexOrder = b;
3021//Print("%d reductions canceled \n",strat->cel);
3022 delete(strat);
3023 if ((delete_w)&&(w!=NULL)&&(*w!=NULL)) delete *w;
3024 assume(idIsInV(r));
3025 return r;
3026}
char rightGB
Definition kutil.h:369
ideal bbaShift(ideal F, ideal Q, intvec *w, intvec *hilb, kStrategy strat)
Definition kstd2.cc:4591
#define idIsInV(I)
Definition shiftop.h:49

◆ kVerify()

BOOLEAN kVerify ( ideal F,
ideal Q )

◆ mora()

ideal mora ( ideal F,
ideal Q,
intvec * w,
intvec * hilb,
kStrategy strat )

Definition at line 1888 of file kstd1.cc.

1889{
1890 int olddeg = 0;
1891 int reduc = 0;
1892 int red_result = 1;
1893 int hilbeledeg=1,hilbcount=0;
1894 BITSET save1;
1897 {
1898 si_opt_1 &= ~Sy_bit(OPT_REDSB);
1899 si_opt_1 &= ~Sy_bit(OPT_REDTAIL);
1900 }
1901
1902 strat->update = TRUE;
1903 /*- setting global variables ------------------- -*/
1904 initBuchMoraCrit(strat);
1905 initHilbCrit(F,Q,&hilb,strat);
1906 initMora(F,strat);
1908 initBuchMoraPosRing(strat);
1909 else
1910 initBuchMoraPos(strat);
1911 /*Shdl=*/initBuchMora(F,Q,strat);
1912 if (TEST_OPT_FASTHC) missingAxis(&strat->lastAxis,strat);
1913 /*updateS in initBuchMora has Hecketest
1914 * and could have put strat->kHEdgdeFound FALSE*/
1915 if (TEST_OPT_FASTHC && (strat->lastAxis) && strat->posInLOldFlag)
1916 {
1917 strat->posInLOld = strat->posInL;
1918 strat->posInLOldFlag = FALSE;
1919 strat->posInL = posInL10;
1920 updateL(strat);
1921 reorderL(strat);
1922 }
1923 kTest_TS(strat);
1924 strat->use_buckets = kMoraUseBucket(strat);
1925
1926#ifdef HAVE_TAIL_RING
1927 if (strat->homog && strat->red == redFirst)
1928 if(!idIs0(F) &&(!rField_is_Ring(currRing)))
1930#endif
1931
1932 if (BVERBOSE(23))
1933 {
1934 kDebugPrint(strat);
1935 }
1936//deleteInL(strat->L,&strat->Ll,1,strat);
1937//deleteInL(strat->L,&strat->Ll,0,strat);
1938
1939 /*- compute-------------------------------------------*/
1940 while (strat->Ll >= 0)
1941 {
1942 #ifdef KDEBUG
1943 if (TEST_OPT_DEBUG) messageSets(strat);
1944 #endif
1945 if (siCntrlc)
1946 {
1947 while (strat->Ll >= 0)
1948 deleteInL(strat->L,&strat->Ll,strat->Ll,strat);
1949 strat->noClearS=TRUE;
1950 }
1952 && (strat->L[strat->Ll].ecart+strat->L[strat->Ll].GetpFDeg()> Kstd1_deg))
1953 {
1954 /*
1955 * stops computation if
1956 * - 24 (degBound)
1957 * && upper degree is bigger than Kstd1_deg
1958 */
1959 while ((strat->Ll >= 0)
1960 && (strat->L[strat->Ll].p1!=NULL) && (strat->L[strat->Ll].p2!=NULL)
1961 && (strat->L[strat->Ll].ecart+strat->L[strat->Ll].GetpFDeg()> Kstd1_deg)
1962 )
1963 {
1964 deleteInL(strat->L,&strat->Ll,strat->Ll,strat);
1965 //if (TEST_OPT_PROT)
1966 //{
1967 // PrintS("D"); mflush();
1968 //}
1969 }
1970 if (strat->Ll<0) break;
1971 else strat->noClearS=TRUE;
1972 }
1973 strat->P = strat->L[strat->Ll];/*- picks the last element from the lazyset L -*/
1974 if (strat->Ll==0) strat->interpt=TRUE;
1975 strat->Ll--;
1976 // create the real Spoly
1977 if (pNext(strat->P.p) == strat->tail)
1978 {
1979 /*- deletes the short spoly and computes -*/
1981 pLmDelete(strat->P.p);
1982 else
1983 pLmFree(strat->P.p);
1984 strat->P.p = NULL;
1985 poly m1 = NULL, m2 = NULL;
1986 // check that spoly creation is ok
1987 while (strat->tailRing != currRing &&
1988 !kCheckSpolyCreation(&(strat->P), strat, m1, m2))
1989 {
1990 assume(m1 == NULL && m2 == NULL);
1991 // if not, change to a ring where exponents are large enough
1992 kStratChangeTailRing(strat);
1993 }
1994 /* create the real one */
1995 ksCreateSpoly(&(strat->P), strat->kNoetherTail(), strat->use_buckets,
1996 strat->tailRing, m1, m2, strat->R);
1997 if (!strat->use_buckets)
1998 strat->P.SetLength(strat->length_pLength);
1999 }
2000 else if (strat->P.p1 == NULL)
2001 {
2002 // for input polys, prepare reduction (buckets !)
2003 strat->P.SetLength(strat->length_pLength);
2004 strat->P.PrepareRed(strat->use_buckets);
2005 }
2006
2007 // the s-poly
2008 if (!strat->P.IsNull())
2009 {
2010 // might be NULL from noether !!!
2011 if (TEST_OPT_PROT)
2012 message(strat->P.ecart+strat->P.GetpFDeg(),&olddeg,&reduc,strat, red_result);
2013 // reduce
2014 red_result = strat->red(&strat->P,strat);
2015 }
2016
2017 // the reduced s-poly
2018 if (! strat->P.IsNull())
2019 {
2020 strat->P.GetP();
2021 // statistics
2022 if (TEST_OPT_PROT) PrintS("s");
2023 // normalization
2025 strat->P.pCleardenom();
2026 else
2027 strat->P.pNorm();
2028 // tailreduction
2029 strat->P.p = redtail(&(strat->P),strat->sl,strat);
2030 if (strat->P.p==NULL)
2031 {
2032 WerrorS("exponent overflow - wrong ordering");
2033 return(idInit(1,1));
2034 }
2035 // set ecart -- might have changed because of tail reductions
2036 if ((!strat->noTailReduction) && (!strat->honey))
2037 strat->initEcart(&strat->P);
2038 // cancel unit
2039 cancelunit(&strat->P);
2040 // for char 0, clear denominators
2041 if ((strat->P.p->next==NULL) /* i.e. cancelunit did something*/
2043 strat->P.pCleardenom();
2044
2045 strat->P.SetShortExpVector();
2046 enterT(strat->P,strat);
2047 // build new pairs
2049 superenterpairs(strat->P.p,strat->sl,strat->P.ecart,0,strat, strat->tl);
2050 else
2051 enterpairs(strat->P.p,strat->sl,strat->P.ecart,0,strat, strat->tl);
2052 // put in S
2053 strat->enterS(strat->P,
2054 posInS(strat,strat->sl,strat->P.p, strat->P.ecart),
2055 strat, strat->tl);
2056 // apply hilbert criterion
2057 if (hilb!=NULL)
2058 {
2059 if (strat->homog==isHomog)
2061 else
2063 }
2064
2065 // clear strat->P
2066 kDeleteLcm(&strat->P);
2067
2068#ifdef KDEBUG
2069 // make sure kTest_TS does not complain about strat->P
2070 strat->P.Clear();
2071#endif
2072 }
2073 if (strat->kAllAxis)
2074 {
2075 if ((TEST_OPT_FINDET)
2076 || ((TEST_OPT_MULTBOUND) && (scMult0Int(strat->Shdl,NULL) < Kstd1_mu)))
2077 {
2078 // obachman: is this still used ???
2079 /*
2080 * stops computation if strat->kAllAxis and
2081 * - 27 (finiteDeterminacyTest)
2082 * or
2083 * - 23
2084 * (multBound)
2085 * && multiplicity of the ideal is smaller then a predefined number mu
2086 */
2087 while (strat->Ll >= 0) deleteInL(strat->L,&strat->Ll,strat->Ll,strat);
2088 }
2089 }
2090 kTest_TS(strat);
2091 }
2092 /*- complete reduction of the standard basis------------------------ -*/
2093 if (TEST_OPT_REDSB) completeReduce(strat);
2094 else if (TEST_OPT_PROT) PrintLn();
2095 /*- release temp data------------------------------- -*/
2096 exitBuchMora(strat);
2097 /*- polynomials used for HECKE: HC, noether -*/
2098 if (TEST_OPT_FINDET)
2099 {
2100 if (strat->kNoether!=NULL)
2101 Kstd1_mu=currRing->pFDeg(strat->kNoether,currRing);
2102 else
2103 Kstd1_mu=-1;
2104 }
2105 if (strat->kNoether!=NULL) pLmFree(&strat->kNoether);
2106 if (strat->kNoether!=NULL) pLmDelete(&strat->kNoether);
2107 omFreeSize((ADDRESS)strat->NotUsedAxis,((currRing->N)+1)*sizeof(BOOLEAN));
2109// if (TEST_OPT_WEIGHTM)
2110// {
2111// pRestoreDegProcs(currRing,strat->pOrigFDeg, strat->pOrigLDeg);
2112// if (ecartWeights)
2113// {
2114// omFreeSize((ADDRESS)ecartWeights,((currRing->N)+1)*sizeof(short));
2115// ecartWeights=NULL;
2116// }
2117// }
2118 if(nCoeff_is_Z(currRing->cf))
2119 finalReduceByMon(strat);
2120 if (Q!=NULL) updateResult(strat->Shdl,Q,strat);
2122 idTest(strat->Shdl);
2123 return (strat->Shdl);
2124}
KINLINE poly kNoetherTail()
Definition kInline.h:66
ring tailRing
Definition kutil.h:343
int Ll
Definition kutil.h:351
int lastAxis
Definition kutil.h:355
poly tail
Definition kutil.h:334
char use_buckets
Definition kutil.h:383
char interpt
Definition kutil.h:371
LObject P
Definition kutil.h:302
char noClearS
Definition kutil.h:402
char length_pLength
Definition kutil.h:387
char update
Definition kutil.h:381
long scMult0Int(ideal S, ideal Q)
Definition hdegree.cc:950
void khCheckLocInhom(ideal Q, intvec *w, intvec *hilb, int &count, kStrategy strat)
Definition khstd.cc:244
void khCheck(ideal Q, intvec *w, intvec *hilb, int &eledeg, int &count, kStrategy strat)
Definition khstd.cc:28
void ksCreateSpoly(LObject *Pair, poly spNoether, int use_buckets, ring tailRing, poly m1, poly m2, TObject **R)
Definition kspoly.cc:1208
void missingAxis(int *last, kStrategy strat)
Definition kstd1.cc:1284
void reorderL(kStrategy strat)
Definition kstd1.cc:1226
int posInL10(const LSet set, const int length, LObject *p, const kStrategy strat)
Definition kstd1.cc:1365
static BOOLEAN kMoraUseBucket(kStrategy strat)
Definition kstd1.cc:3840
void updateL(kStrategy strat)
Definition kstd1.cc:1398
EXTERN_VAR int Kstd1_mu
Definition kstd1.h:50
void message(int i, int *reduc, int *olddeg, kStrategy strat, int red_result)
Definition kutil.cc:7511
void initBuchMora(ideal F, ideal Q, kStrategy strat)
Definition kutil.cc:9799
BOOLEAN kTest_TS(kStrategy strat)
Definition kutil.cc:1072
void enterpairs(poly h, int k, int ecart, int pos, kStrategy strat, int atR)
Definition kutil.cc:4508
void initHilbCrit(ideal, ideal, intvec **hilb, kStrategy strat)
Definition kutil.cc:9457
BOOLEAN kStratChangeTailRing(kStrategy strat, LObject *L, TObject *T, unsigned long expbound)
Definition kutil.cc:11020
void exitBuchMora(kStrategy strat)
Definition kutil.cc:9884
int posInS(const kStrategy strat, const int length, const poly p, const int ecart_p)
Definition kutil.cc:4684
BOOLEAN kCheckSpolyCreation(LObject *L, kStrategy strat, poly &m1, poly &m2)
Definition kutil.cc:10533
void updateResult(ideal r, ideal Q, kStrategy strat)
Definition kutil.cc:10127
void superenterpairs(poly h, int k, int ecart, int pos, kStrategy strat, int atR)
Definition kutil.cc:4477
void deleteInL(LSet set, int *length, int j, kStrategy strat)
Definition kutil.cc:1214
void kStratInitChangeTailRing(kStrategy strat)
Definition kutil.cc:11113
void messageSets(kStrategy strat)
Definition kutil.cc:7584
void messageStat(int hilbcount, kStrategy strat)
Definition kutil.cc:7552
void finalReduceByMon(kStrategy strat)
used for GB over ZZ: final reduction by constant elements background: any known constant element of i...
Definition kutil.cc:10927
void cancelunit(LObject *L, BOOLEAN inNF)
Definition kutil.cc:372
static void kDeleteLcm(LObject *P)
Definition kutil.h:880
VAR BOOLEAN siCntrlc
Definition options.c:14
#define TEST_OPT_FINDET
Definition options.h:111
#define OPT_REDSB
Definition options.h:76
#define TEST_OPT_MULTBOUND
Definition options.h:114
#define TEST_OPT_FASTHC
Definition options.h:109
BOOLEAN rHasMixedOrdering(const ring r)
Definition ring.h:763

◆ rightgb()

ideal rightgb ( ideal F,
const ideal Q )

Definition at line 4955 of file kstd2.cc.

4956{
4958 assume(idIsInV(F));
4959 ideal RS = kStdShift(F, Q, testHomog, NULL, NULL, 0, 0, NULL, TRUE);
4960 idSkipZeroes(RS); // is this even necessary?
4961 assume(idIsInV(RS));
4962 return(RS);
4963}

◆ stdred()

ideal stdred ( ideal F,
ideal Q,
tHomog h,
intvec ** w )

Variable Documentation

◆ kHomW

Definition at line 71 of file kstd1.h.

◆ kModW

Definition at line 70 of file kstd1.h.

◆ kOptions

EXTERN_VAR BITSET kOptions

Definition at line 52 of file kstd1.h.

◆ Kstd1_deg

EXTERN_VAR int Kstd1_deg

Definition at line 50 of file kstd1.h.

◆ Kstd1_mu

EXTERN_VAR int Kstd1_mu

Definition at line 50 of file kstd1.h.

◆ validOpts

EXTERN_VAR BITSET validOpts

Definition at line 54 of file kstd1.h.