/usr/include/singular/singular/kernel/GBEngine/kstd1.h is in libsingular4-dev-common 4.0.3+ds-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 | #ifndef KSTD1_H
#define KSTD1_H
/****************************************
* Computer Algebra System SINGULAR *
****************************************/
/*
* ABSTRACT
*/
#include <kernel/structs.h>
#include <polys/monomials/ring.h>
ideal mora (ideal F, ideal Q,intvec *w,intvec *hilb,kStrategy strat);
typedef BOOLEAN (*s_poly_proc_t)(kStrategy strat);
// lazy_reduce flags: can be combined by |
#define KSTD_NF_LAZY 1
// do only a reduction of the leading term
#define KSTD_NF_ECART 2
// only local: recude even with bad ecart
#define KSTD_NF_NONORM 4
// only global: avoid normalization, return a multiply of NF
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);
/// NOTE: this is just a wrapper which sets currRing for the actual kNF call
poly k_NF (ideal F, ideal Q, poly p,int syzComp, int lazyReduce, const ring _currRing);
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 ** w, intvec *hilb,int syzComp,
int newIdeal, intvec *vw, int uptodeg, int lVblock);
/* the following global data are defined in kutil.cc */
//extern int syzComp;
/*stop building pairs after that component --> ideals.cc, syz.cc */
extern int LazyPass,LazyDegree,Kstd1_mu,Kstd1_deg;
/*parameters for Lazy or global stops --> ipshell.cc, grammar.y*/
extern BITSET kOptions;
/*the known test options (a constant)*/
extern BITSET validOpts;
void initMora(ideal F,kStrategy strat);
ideal kInterRed (ideal F, ideal Q=NULL);
ideal kInterRedOld (ideal F, ideal Q=NULL);
long kModDeg(poly p, ring r = currRing);
long kHomModDeg(poly p, 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);
extern intvec * kModW;
extern intvec * kHomW;
/* options:
0 prot
1 redSB
2 notBucket
3 notSugar
4 interrupt
5 sugarCrit
6 teach
7 cancel unit: obachman 11/00 tossed
8 morepairs: obachman 11/00: tossed
9 return SB (syz,quotient,intersect)
10 fastHC
11-19 sort in L/T
20 redBest: obachman 11/00 tossed
22 staircaseBound: in NF create a HC x1^degBound+1
23 multBound
24 degBound
25 no redTail(p)/redTail(s)
26 integer strategy
27 stop at HC (finiteDeterminacyTest)
28 infRedTail: ignore ecart in local redTail-calls
29 kStd + 1 new element
30 noRedSyz
31 weight
verbose:31 stop at certain weights
*/
#endif
|