 |
My Project
UNKNOWN_GIT_VERSION
|
Go to the source code of this file.
|
void | listprint (std::vector< int > vec) |
|
void | listsprint (std::vector< std::vector< int > > posMat) |
|
void | id_print (ideal h) |
|
void | lpprint (std::vector< poly > pv) |
|
void | lpsprint (std::vector< std::vector< poly > > pvs) |
|
ideal | idMinus (ideal h1, ideal h2) |
|
bool | p_Ifsfree (poly P) |
|
ideal | sfreemon (ideal h, int deg) |
|
ideal | id_sfmon () |
|
ideal | id_complement (ideal h) |
|
ideal | qringadd (ideal h1, ideal h2, int deg) |
|
int | id_maxdeg (ideal h) |
|
ideal | idsrRing (ideal h) |
|
ideal | SimFacset (poly p) |
|
bool | IsSimplex (ideal h) |
|
ideal | complementsimplex (ideal h) |
|
bool | IsinL (int a, std::vector< int > badset) |
|
std::vector< int > | vecIntersection (std::vector< int > p, std::vector< int > q) |
|
bool | vEv (std::vector< int > vec1, std::vector< int > vec2) |
|
bool | vsubset (std::vector< int > vec1, std::vector< int > vec2) |
|
bool | vEvl (std::vector< int > vec1, std::vector< int > vec2) |
|
bool | vInvsl (std::vector< int > vec, std::vector< std::vector< int > > vecs) |
|
int | vInvs (std::vector< int > vec, std::vector< std::vector< int > > vecs) |
|
std::vector< int > | vecUnion (std::vector< int > vec1, std::vector< int > vec2) |
|
std::vector< int > | vecMinus (std::vector< int > vec1, std::vector< int > vec2) |
|
std::vector< int > | support1 (poly p) |
|
std::vector< std::vector< int > > | supports (ideal h) |
|
ideal | findb (ideal h) |
|
ideal | finda (ideal h, poly S, int ddeg) |
|
bool | mabconditionv (std::vector< std::vector< int > > hvs, std::vector< int > pv, std::vector< int > av, std::vector< int > bv) |
|
std::vector< std::vector< int > > | Mabv (ideal h, poly a, poly b) |
|
std::vector< int > | eli1 (std::vector< int > eq1, std::vector< int > eq2) |
|
std::vector< std::vector< int > > | soleli1 (std::vector< std::vector< int > > eqs) |
|
std::vector< int > | freevars (int n, std::vector< int > bset, std::vector< std::vector< int > > gset) |
|
std::vector< int > | fvarsvalue (int vnum, std::vector< int > fvars) |
|
std::vector< std::vector< int > > | vAbsorb (std::vector< int > bset, std::vector< std::vector< int > > gset) |
|
std::vector< int > | vecbase1 (int num, std::vector< int > oset) |
|
std::vector< int > | make0 (int n) |
|
std::vector< int > | make1 (int n) |
|
std::vector< int > | ofindbases1 (int num, int vnum, std::vector< int > bset, std::vector< std::vector< int > > gset) |
|
std::vector< std::vector< int > > | ofindbases (int num, std::vector< int > bset, std::vector< std::vector< int > > gset) |
|
std::vector< std::vector< int > > | eli2 (int num, std::vector< int > bset, std::vector< std::vector< int > > gset) |
|
poly | pMake (std::vector< int > vbase) |
|
ideal | idMake (std::vector< std::vector< int > > vecs) |
|
ideal | idmodulo (ideal h1, ideal h2) |
|
int | pcoef (poly p, int m) |
|
bool | vInp (int m, poly p) |
|
std::vector< int > | vMake (poly p) |
|
std::vector< std::vector< int > > | vsMake (ideal h) |
|
std::vector< std::vector< int > > | vecqring (std::vector< std::vector< int > > vec1, std::vector< std::vector< int > > vec2) |
|
std::vector< std::vector< int > > | links (poly a, ideal h) |
|
ideal | psubset (poly p) |
|
std::vector< std::vector< int > > | listsinsertlist (std::vector< std::vector< int > > gset, int a, int b) |
|
std::vector< int > | makeequation (int i, int j, int t) |
|
poly | pMake3 (std::vector< int > vbase) |
|
ideal | idMake3 (std::vector< std::vector< int > > vecs) |
|
void | equmab (int num) |
|
std::vector< int > | subspace1 (std::vector< std::vector< int > > mv, std::vector< int > bv) |
|
poly | pMaken (std::vector< int > vbase) |
|
ideal | idMaken (std::vector< std::vector< int > > vecs) |
|
std::vector< poly > | pMakei (std::vector< std::vector< int > > mv, std::vector< int > vbase) |
|
std::vector< std::vector< poly > > | idMakei (std::vector< std::vector< int > > mv, std::vector< std::vector< int > > vecs) |
|
void | gradedpiece1 (ideal h, poly a, poly b) |
|
bool | condition1for2 (std::vector< int > pv, std::vector< int > qv, std::vector< int > bv) |
|
bool | condition2for2 (std::vector< std::vector< int > > hvs, std::vector< int > pv, std::vector< int > qv, std::vector< int > sv, std::vector< int > av, std::vector< int > bv) |
|
bool | condition3for2 (std::vector< std::vector< int > > hvs, std::vector< int > pv, std::vector< int > qv, std::vector< int > av, std::vector< int > bv) |
|
ideal | getpresolve (ideal h) |
|
std::vector< int > | numfree (ideal h) |
|
std::vector< std::vector< int > > | canonicalbase (int n) |
|
std::vector< std::vector< int > > | getvector (ideal h, int n) |
|
std::vector< int > | findalpha (std::vector< std::vector< int > > mv, std::vector< int > bv) |
|
std::vector< int > | subspacet1 (int num, std::vector< std::vector< int > > ntvs) |
|
std::vector< std::vector< int > > | subspacet (std::vector< std::vector< int > > mv, std::vector< int > bv, std::vector< std::vector< int > > ntvs) |
|
std::vector< std::vector< int > > | mabtv (std::vector< std::vector< int > > hvs, std::vector< std::vector< int > > Mv, std::vector< int > av, std::vector< int > bv) |
|
void | gradedpiece2 (ideal h, poly a, poly b) |
|
bool | nabconditionv (std::vector< std::vector< int > > hvs, std::vector< int > pv, std::vector< int > av, std::vector< int > bv) |
|
std::vector< std::vector< int > > | Nabv (std::vector< std::vector< int > > hvs, std::vector< int > av, std::vector< int > bv) |
|
bool | nabtconditionv (std::vector< std::vector< int > > hvs, std::vector< int > pv, std::vector< int > qv, std::vector< int > av, std::vector< int > bv) |
|
std::vector< std::vector< int > > | nabtv (std::vector< std::vector< int > > hvs, std::vector< std::vector< int > > Nv, std::vector< int > av, std::vector< int > bv) |
|
bool | tNab (std::vector< std::vector< int > > hvs, std::vector< int > pv, std::vector< std::vector< int > > bvs) |
|
std::vector< int > | tnab (std::vector< std::vector< int > > hvs, std::vector< std::vector< int > > nvs, std::vector< std::vector< int > > bvs) |
|
std::vector< int > | phimage (std::vector< int > pv, std::vector< int > av, std::vector< int > bv) |
|
std::vector< std::vector< int > > | value1 (std::vector< std::vector< int > > mvs, std::vector< std::vector< int > > nvs, std::vector< std::vector< int > > vecs, std::vector< int > av, std::vector< int > bv) |
|
intvec * | Tmat (std::vector< std::vector< int > > vecs) |
|
std::vector< int > | gensindex (ideal M, ideal ids) |
|
ideal | mingens (ideal h, poly a, poly b) |
|
std::vector< std::vector< int > > | minisolve (std::vector< std::vector< int > > solve, std::vector< int > index) |
|
intvec * | gradedpiece1n (ideal h, poly a, poly b) |
|
void | T1 (ideal h) |
|
bool | condition2for2nv (std::vector< std::vector< int > > hvs, std::vector< int > pv, std::vector< int > qv, std::vector< int > fv) |
|
std::vector< int > | findalphan (std::vector< std::vector< int > > N, std::vector< int > tN) |
|
std::vector< std::vector< int > > | subspacetn (std::vector< std::vector< int > > N, std::vector< int > tN, std::vector< std::vector< int > > ntvs) |
|
std::vector< std::vector< int > > | value2 (std::vector< std::vector< int > > mvs, std::vector< std::vector< int > > nvs, std::vector< std::vector< int > > mts, std::vector< std::vector< int > > nts, std::vector< std::vector< int > > vecs, std::vector< int > av, std::vector< int > bv) |
|
ideal | genst (ideal h, poly a, poly b) |
|
intvec * | gradedpiece2n (ideal h, poly a, poly b) |
|
void | T2 (ideal h) |
|
void | Tlink (ideal h, poly a, poly b, int n) |
|
ideal | makemab (ideal h, poly a, poly b) |
|
std::vector< int > | v_minus (std::vector< int > v1, std::vector< int > v2) |
|
std::vector< int > | gdegree (poly a, poly b) |
|
BOOLEAN | idcomplement (leftv res, leftv args) |
|
BOOLEAN | idsr (leftv res, leftv args) |
|
intvec * | dmat (poly a, poly b) |
|
BOOLEAN | gd (leftv res, leftv args) |
|
BOOLEAN | fb (leftv res, leftv args) |
|
BOOLEAN | fa (leftv res, leftv args) |
|
BOOLEAN | fgp (leftv res, leftv args) |
|
BOOLEAN | genstt (leftv res, leftv args) |
|
BOOLEAN | sgp (leftv res, leftv args) |
|
BOOLEAN | Links (leftv res, leftv args) |
|
void | firstorderdef_setup (SModulFunctions *p) |
|
int SI_MOD_INIT() | cohomo (SModulFunctions *p) |
|
◆ canonicalbase()
std::vector<std::vector<int> > canonicalbase |
( |
int |
n | ) |
|
Definition at line 1721 of file cohomo.cc.
1723 std::vector<std::vector<int> > vecs;
1724 std::vector<int>
vec;
1735 vecs.push_back(
vec);
◆ cohomo()
◆ complementsimplex()
ideal complementsimplex |
( |
ideal |
h | ) |
|
Definition at line 409 of file cohomo.cc.
430 PrintS(
"This is the simplicial complex:\n");
◆ condition1for2()
bool condition1for2 |
( |
std::vector< int > |
pv, |
|
|
std::vector< int > |
qv, |
|
|
std::vector< int > |
bv |
|
) |
| |
◆ condition2for2()
bool condition2for2 |
( |
std::vector< std::vector< int > > |
hvs, |
|
|
std::vector< int > |
pv, |
|
|
std::vector< int > |
qv, |
|
|
std::vector< int > |
sv, |
|
|
std::vector< int > |
av, |
|
|
std::vector< int > |
bv |
|
) |
| |
◆ condition2for2nv()
bool condition2for2nv |
( |
std::vector< std::vector< int > > |
hvs, |
|
|
std::vector< int > |
pv, |
|
|
std::vector< int > |
qv, |
|
|
std::vector< int > |
fv |
|
) |
| |
◆ condition3for2()
bool condition3for2 |
( |
std::vector< std::vector< int > > |
hvs, |
|
|
std::vector< int > |
pv, |
|
|
std::vector< int > |
qv, |
|
|
std::vector< int > |
av, |
|
|
std::vector< int > |
bv |
|
) |
| |
Definition at line 1640 of file cohomo.cc.
1642 std::vector<int> v1,v2,v3;
◆ dmat()
intvec* dmat |
( |
poly |
a, |
|
|
poly |
b |
|
) |
| |
◆ eli1()
std::vector<int> eli1 |
( |
std::vector< int > |
eq1, |
|
|
std::vector< int > |
eq2 |
|
) |
| |
◆ eli2()
std::vector<std::vector<int> > eli2 |
( |
int |
num, |
|
|
std::vector< int > |
bset, |
|
|
std::vector< std::vector< int > > |
gset |
|
) |
| |
Definition at line 1034 of file cohomo.cc.
1037 std::vector<int> badset;
1038 std::vector<std::vector<int> > goodset;
1039 std::vector<std::vector<int> >
solve;
1047 int m=goodset.size();
1048 badset=goodset[
m-1];
1049 goodset.erase(goodset.end());
◆ equmab()
Definition at line 1386 of file cohomo.cc.
1397 sprintf (tt[
i],
"t(%d)",
i+1);
◆ fa()
Definition at line 3007 of file cohomo.cc.
3012 ideal h1= (ideal)
h->Data();
3016 poly q= (poly)
h->Data();
3020 int d= (int)(
long)
h->Data();
◆ fb()
Definition at line 2993 of file cohomo.cc.
2998 ideal h1= (ideal)
h->Data();
◆ fgp()
Definition at line 3030 of file cohomo.cc.
3035 ideal h1= (ideal)
h->Data();
3039 poly
p= (poly)
h->Data();
3043 poly q= (poly)
h->Data();
◆ finda()
ideal finda |
( |
ideal |
h, |
|
|
poly |
S, |
|
|
int |
ddeg |
|
) |
| |
◆ findalpha()
std::vector<int> findalpha |
( |
std::vector< std::vector< int > > |
mv, |
|
|
std::vector< int > |
bv |
|
) |
| |
Definition at line 1824 of file cohomo.cc.
1826 std::vector<int> alset;
1827 for(
int i=0;
i<mv.size();
i++)
◆ findalphan()
std::vector<int> findalphan |
( |
std::vector< std::vector< int > > |
N, |
|
|
std::vector< int > |
tN |
|
) |
| |
Definition at line 2528 of file cohomo.cc.
2530 int i;std::vector<int> alset,
vec;
2531 for(
i=0;
i<
N.size();
i++)
◆ findb()
◆ firstorderdef_setup()
◆ freevars()
std::vector<int> freevars |
( |
int |
n, |
|
|
std::vector< int > |
bset, |
|
|
std::vector< std::vector< int > > |
gset |
|
) |
| |
Definition at line 825 of file cohomo.cc.
829 std::vector<int>
mvar;
830 std::vector<int> fvar;
834 mvar.push_back(bset[
i]);
838 mvar.push_back(gset[
i][0]);
◆ fvarsvalue()
std::vector<int> fvarsvalue |
( |
int |
vnum, |
|
|
std::vector< int > |
fvars |
|
) |
| |
Definition at line 852 of file cohomo.cc.
854 int i;std::vector<int> fset=fvars;
855 for(
i=0;
i<fset.size();
i++)
859 fset.erase(fset.begin()+
i);
◆ gd()
Definition at line 2974 of file cohomo.cc.
2979 poly
p= (poly)
h->Data();
2983 poly q= (poly)
h->Data();
◆ gdegree()
std::vector<int> gdegree |
( |
poly |
a, |
|
|
poly |
b |
|
) |
| |
Definition at line 2860 of file cohomo.cc.
2863 std::vector<int> av,bv;
◆ gensindex()
std::vector<int> gensindex |
( |
ideal |
M, |
|
|
ideal |
ids |
|
) |
| |
◆ genst()
ideal genst |
( |
ideal |
h, |
|
|
poly |
a, |
|
|
poly |
b |
|
) |
| |
Definition at line 2637 of file cohomo.cc.
2640 std::vector<std::vector<int> > hvs=
supports(
h);
2642 std::vector<std::vector<int> > mv=
Mabv(
h,a,
b), mts=
mabtv(hvs,mv,av,bv);
2643 std::vector<std::vector<poly> > pvs=
idMakei(mv,mts);
2645 for(
i=0;
i<pvs.size();
i++)
◆ genstt()
Definition at line 3054 of file cohomo.cc.
3059 ideal h1= (ideal)
h->Data();
3063 poly
p= (poly)
h->Data();
3067 poly q= (poly)
h->Data();
◆ getpresolve()
ideal getpresolve |
( |
ideal |
h | ) |
|
◆ getvector()
std::vector<std::vector<int> > getvector |
( |
ideal |
h, |
|
|
int |
n |
|
) |
| |
Definition at line 1745 of file cohomo.cc.
1747 std::vector<int>
vec;
1748 std::vector<std::vector<int> > vecs;
1755 std::vector<int> fvar=
numfree(h1);
1801 vecs.push_back(
vec);
◆ gradedpiece1()
void gradedpiece1 |
( |
ideal |
h, |
|
|
poly |
a, |
|
|
poly |
b |
|
) |
| |
Definition at line 1523 of file cohomo.cc.
1526 std::vector<std::vector<int> > hvs=
supports(
h);
1530 std::vector<std::vector<int> > sbv=
supports(sub);
1532 std::vector<std::vector<int> > mv=
Mabv(
h,a,
b);
1533 PrintS(
"The homophisim is map onto the set:\n");
1536 std::vector<std::vector<int> > good;
1537 std::vector<int>
bad,vv;
1567 PrintS(
"This is the solution of coefficients:\n");
1575 std::vector<std::vector<int> > suu;
1579 PrintS(
"This is the solution of coefficients:\n");
1586 PrintS(
"No element considered!\n");
◆ gradedpiece1n()
intvec* gradedpiece1n |
( |
ideal |
h, |
|
|
poly |
a, |
|
|
poly |
b |
|
) |
| |
Definition at line 2359 of file cohomo.cc.
2362 std::vector<std::vector<int> > hvs=
supports(
h);
2369 std::vector<std::vector<int> > sbv=
supports(sub);
2371 std::vector<std::vector<int> > nv=
Nabv(hvs,av,bv);
2374 std::vector<std::vector<int> > mv=
Mabv(
h,a,
b);
2382 std::vector<std::vector<int> > good,
solve;
2383 std::vector<int>
bad;
2385 std::vector<int> tnv;
2388 tnv=
tnab(hvs,nv,sbv);
2389 for(
i=0;
i<tnv.size();
i++)
2392 bad.push_back(co+1);
2416 std::vector<int> su=
make1(n);
2417 std::vector<std::vector<int> > suu;
◆ gradedpiece2()
void gradedpiece2 |
( |
ideal |
h, |
|
|
poly |
a, |
|
|
poly |
b |
|
) |
| |
Definition at line 1922 of file cohomo.cc.
1926 std::vector<std::vector<int> > hvs=
supports(
h);
1930 std::vector<std::vector<int> > mv=
Mabv(
h,a,
b);
1931 std::vector<std::vector<int> > mts=
mabtv(hvs,mv,av,bv);
1932 PrintS(
"The homomorphism should map onto:\n");
1936 std::vector<std::vector<int> > vecs,vars;
1937 std::vector<int>
vec,var;
1940 vars=
mabtv(hvs,mv,av,bv);
1942 for(t0=0;t0<vars.size();t0++)
1953 vecs.push_back(
vec);
1963 vecs.push_back(
vec);
1966 for(t1=t0+1;t1<vars.size();t1++)
1968 for(t2=t1+1;t2<vars.size();t2++)
1970 if(vars[t0][0]==vars[t1][0]&&vars[t1][1]==vars[t2][1]&&vars[t0][1]==vars[t2][0])
1978 vecs.push_back(
vec);
1990 std::vector<std::vector<int> > re=
getvector(id_re,vn);
1991 PrintS(
"this is the solution for ideal :\n");
1994 std::vector<std::vector<int> > sub=
subspacet(mv, bv,vars);
1995 PrintS(
"this is the solution for subspace:\n");
1999 PrintS(
"This is the solution of coefficients:\n");
2005 PrintS(
"No element considered!");
◆ gradedpiece2n()
intvec* gradedpiece2n |
( |
ideal |
h, |
|
|
poly |
a, |
|
|
poly |
b |
|
) |
| |
Definition at line 2663 of file cohomo.cc.
2666 std::vector<std::vector<int> > hvs=
supports(
h);
2670 std::vector<std::vector<int> > sbv=
supports(sub);
2671 std::vector<std::vector<int> > nv=
Nabv(hvs,av,bv);
2673 std::vector<int> tnv=
tnab(hvs,nv,sbv);
2675 std::vector<std::vector<int> > mv=
Mabv(
h,a,
b);
2676 std::vector<std::vector<int> > mts=
mabtv(hvs,mv,av,bv);
2681 std::vector<std::vector<int> > vecs,vars,ntvs;
2682 std::vector<int>
vec,var;
2683 std::vector<std::vector<int> >
solve;
2686 ntvs=
nabtv( hvs, nv, av, bv);
2690 for(
int t0=0;t0<
l;t0++)
2700 vecs.push_back(
vec);
2703 for(
int t1=t0+1;t1<ntvs.size();t1++)
2705 for(
int t2=t1+1;t2<ntvs.size();t2++)
2707 if(ntvs[t0][0]==ntvs[t1][0]&&ntvs[t1][1]==ntvs[t2][1]&&ntvs[t0][1]==ntvs[t2][0])
2715 vecs.push_back(
vec);
2728 std::vector<std::vector<int> > re=
getvector(id_re,
l);
2732 std::vector<std::vector<int> > sub=
subspacetn(nv, tnv,ntvs);
◆ id_complement()
ideal id_complement |
( |
ideal |
h | ) |
|
◆ id_maxdeg()
◆ id_print()
◆ id_sfmon()
Definition at line 239 of file cohomo.cc.
241 ideal asfmons,sfmons,mons,
p;
◆ idcomplement()
Definition at line 2908 of file cohomo.cc.
2913 ideal hh=(ideal)
h->Data();
◆ idMake()
ideal idMake |
( |
std::vector< std::vector< int > > |
vecs | ) |
|
Definition at line 1094 of file cohomo.cc.
1096 int lv=vecs.size();poly
p;
◆ idMake3()
ideal idMake3 |
( |
std::vector< std::vector< int > > |
vecs | ) |
|
◆ idMakei()
std::vector<std::vector<poly> > idMakei |
( |
std::vector< std::vector< int > > |
mv, |
|
|
std::vector< std::vector< int > > |
vecs |
|
) |
| |
Definition at line 1497 of file cohomo.cc.
1499 int i,lv=vecs.size();
1500 std::vector<std::vector<poly> > re;
1501 std::vector<poly>
h;
◆ idMaken()
ideal idMaken |
( |
std::vector< std::vector< int > > |
vecs | ) |
|
◆ idMinus()
ideal idMinus |
( |
ideal |
h1, |
|
|
ideal |
h2 |
|
) |
| |
◆ idmodulo()
ideal idmodulo |
( |
ideal |
h1, |
|
|
ideal |
h2 |
|
) |
| |
◆ idsr()
Definition at line 2923 of file cohomo.cc.
2928 ideal h1= (ideal)
h->Data();
2933 poly
p= (poly)
h->Data();
2937 poly q= (poly)
h->Data();
◆ idsrRing()
ideal idsrRing |
( |
ideal |
h | ) |
|
◆ IsinL()
bool IsinL |
( |
int |
a, |
|
|
std::vector< int > |
badset |
|
) |
| |
◆ IsSimplex()
bool IsSimplex |
( |
ideal |
h | ) |
|
Definition at line 379 of file cohomo.cc.
391 id_so=
idAdd(id_so, id_re);
397 PrintS(
"It is not simplex.\n");
398 PrintS(
"This is the simplicial complex:\n");
402 PrintS(
"It is simplex.\n");
◆ Links()
Definition at line 3100 of file cohomo.cc.
3105 poly
p= (poly)
h->Data();
3109 ideal h1= (ideal)
h->Data();
3111 std::vector<std::vector<int> > vecs=
links(
p,h1);
◆ links()
std::vector<std::vector<int> > links |
( |
poly |
a, |
|
|
ideal |
h |
|
) |
| |
Definition at line 1215 of file cohomo.cc.
1218 std::vector<std::vector<int> > lk,X=
supports(
h);
1219 std::vector<int> U,In,av=
support1(a);
1220 for(
i=0;
i<X.size();
i++)
1230 if( In.size()==0 &&
vInvsl(U,X))
◆ listprint()
void listprint |
( |
std::vector< int > |
vec | ) |
|
◆ listsinsertlist()
std::vector<std::vector<int> > listsinsertlist |
( |
std::vector< std::vector< int > > |
gset, |
|
|
int |
a, |
|
|
int |
b |
|
) |
| |
Definition at line 1308 of file cohomo.cc.
1310 std::vector<int> eq;
◆ listsprint()
void listsprint |
( |
std::vector< std::vector< int > > |
posMat | ) |
|
Definition at line 82 of file cohomo.cc.
85 for(
i=0;
i<posMat.size();
i++)
◆ lpprint()
void lpprint |
( |
std::vector< poly > |
pv | ) |
|
◆ lpsprint()
void lpsprint |
( |
std::vector< std::vector< poly > > |
pvs | ) |
|
Definition at line 134 of file cohomo.cc.
136 for(
int i=0;
i<pvs.size();
i++)
◆ mabconditionv()
bool mabconditionv |
( |
std::vector< std::vector< int > > |
hvs, |
|
|
std::vector< int > |
pv, |
|
|
std::vector< int > |
av, |
|
|
std::vector< int > |
bv |
|
) |
| |
◆ mabtv()
std::vector<std::vector<int> > mabtv |
( |
std::vector< std::vector< int > > |
hvs, |
|
|
std::vector< std::vector< int > > |
Mv, |
|
|
std::vector< int > |
av, |
|
|
std::vector< int > |
bv |
|
) |
| |
Definition at line 1897 of file cohomo.cc.
1899 std::vector<int> v1,var;
1900 std::vector<std::vector<int> > vars;
1901 for(
int i=0;
i<Mv.size();
i++)
1903 for(
int j=
i+1;
j<Mv.size();
j++)
1911 vars.push_back(var);
◆ Mabv()
std::vector<std::vector<int> > Mabv |
( |
ideal |
h, |
|
|
poly |
a, |
|
|
poly |
b |
|
) |
| |
Definition at line 732 of file cohomo.cc.
735 std::vector<std::vector<int> > vecs;
745 std::vector<std::vector<int> > hvs=
supports(
h);
746 std::vector<std::vector<int> > h2v=
supports(h2);
747 std::vector<int>
vec;
748 for(
int i=0;
i<h2v.size();
i++)
◆ make0()
std::vector<int> make0 |
( |
int |
n | ) |
|
◆ make1()
std::vector<int> make1 |
( |
int |
n | ) |
|
◆ makeequation()
std::vector<int> makeequation |
( |
int |
i, |
|
|
int |
j, |
|
|
int |
t |
|
) |
| |
Definition at line 1321 of file cohomo.cc.
1323 std::vector<int> equation;
1324 equation.push_back(
i);
1325 equation.push_back(
j);
1326 equation.push_back(t);
◆ makemab()
ideal makemab |
( |
ideal |
h, |
|
|
poly |
a, |
|
|
poly |
b |
|
) |
| |
◆ mingens()
ideal mingens |
( |
ideal |
h, |
|
|
poly |
a, |
|
|
poly |
b |
|
) |
| |
◆ minisolve()
std::vector<std::vector<int> > minisolve |
( |
std::vector< std::vector< int > > |
solve, |
|
|
std::vector< int > |
index |
|
) |
| |
Definition at line 2336 of file cohomo.cc.
2339 std::vector<int>
vec;
2340 std::vector<std::vector<int> > solsm;
2341 std::vector<int> solm;
2345 for(
j=0;
j<
vec.size();
j++)
2348 solm.push_back(
vec[
j]);
2350 solsm.push_back(solm);
◆ nabconditionv()
bool nabconditionv |
( |
std::vector< std::vector< int > > |
hvs, |
|
|
std::vector< int > |
pv, |
|
|
std::vector< int > |
av, |
|
|
std::vector< int > |
bv |
|
) |
| |
◆ nabtconditionv()
bool nabtconditionv |
( |
std::vector< std::vector< int > > |
hvs, |
|
|
std::vector< int > |
pv, |
|
|
std::vector< int > |
qv, |
|
|
std::vector< int > |
av, |
|
|
std::vector< int > |
bv |
|
) |
| |
Definition at line 2094 of file cohomo.cc.
2096 std::vector<int> v1;
◆ nabtv()
std::vector<std::vector<int> > nabtv |
( |
std::vector< std::vector< int > > |
hvs, |
|
|
std::vector< std::vector< int > > |
Nv, |
|
|
std::vector< int > |
av, |
|
|
std::vector< int > |
bv |
|
) |
| |
Definition at line 2109 of file cohomo.cc.
2111 std::vector<int> v1,var;
2112 std::vector<std::vector<int> > vars;
2113 for(
int i=0;
i<Nv.size();
i++)
2115 for(
int j=
i+1;
j<Nv.size();
j++)
2122 vars.push_back(var);
◆ Nabv()
std::vector<std::vector<int> > Nabv |
( |
std::vector< std::vector< int > > |
hvs, |
|
|
std::vector< int > |
av, |
|
|
std::vector< int > |
bv |
|
) |
| |
Definition at line 2075 of file cohomo.cc.
2077 std::vector<std::vector<int> > vecs;
2082 vecs.push_back(hvs[
i]);
◆ numfree()
std::vector<int> numfree |
( |
ideal |
h | ) |
|
Definition at line 1698 of file cohomo.cc.
1701 std::vector<int> fvar;
◆ ofindbases()
std::vector<std::vector<int> > ofindbases |
( |
int |
num, |
|
|
std::vector< int > |
bset, |
|
|
std::vector< std::vector< int > > |
gset |
|
) |
| |
Definition at line 999 of file cohomo.cc.
1002 std::vector<int> base1;
1003 std::vector<std::vector<int> > bases;
1005 if (fvars.size()==0)
1008 bases.push_back(base1);
1012 for(
i=0;
i<fvars.size();
i++)
1016 bases.push_back(base1);
◆ ofindbases1()
std::vector<int> ofindbases1 |
( |
int |
num, |
|
|
int |
vnum, |
|
|
std::vector< int > |
bset, |
|
|
std::vector< std::vector< int > > |
gset |
|
) |
| |
Definition at line 967 of file cohomo.cc.
969 int i,
j,
m;std::vector<std::vector<int> > goodset;
971 std::vector<int> zset=
fvarsvalue(vnum, fvars);
973 std::vector<int> oset;
974 oset.push_back(vnum);
976 oset=goodset[goodset.size()-1];
977 goodset.erase(goodset.end());
◆ p_Ifsfree()
◆ pcoef()
int pcoef |
( |
poly |
p, |
|
|
int |
m |
|
) |
| |
◆ phimage()
std::vector<int> phimage |
( |
std::vector< int > |
pv, |
|
|
std::vector< int > |
av, |
|
|
std::vector< int > |
bv |
|
) |
| |
◆ pMake()
poly pMake |
( |
std::vector< int > |
vbase | ) |
|
Definition at line 1075 of file cohomo.cc.
1077 int n=vbase.size();poly
p,q=0;
1078 for(
int i=0;
i<n;
i++)
◆ pMake3()
poly pMake3 |
( |
std::vector< int > |
vbase | ) |
|
Definition at line 1338 of file cohomo.cc.
1340 int n=vbase.size();poly
p,q=0;
1343 for(
int i=0;
i<3;
i++)
◆ pMakei()
std::vector<poly> pMakei |
( |
std::vector< std::vector< int > > |
mv, |
|
|
std::vector< int > |
vbase |
|
) |
| |
Definition at line 1483 of file cohomo.cc.
1486 std::vector<poly> h1;
1488 for(
int i=0;
i<n;
i++)
◆ pMaken()
poly pMaken |
( |
std::vector< int > |
vbase | ) |
|
◆ psubset()
◆ qringadd()
ideal qringadd |
( |
ideal |
h1, |
|
|
ideal |
h2, |
|
|
int |
deg |
|
) |
| |
◆ sfreemon()
ideal sfreemon |
( |
ideal |
h, |
|
|
int |
deg |
|
) |
| |
◆ sgp()
Definition at line 3077 of file cohomo.cc.
3082 ideal h1= (ideal)
h->Data();
3086 poly
p= (poly)
h->Data();
3090 poly q= (poly)
h->Data();
◆ SimFacset()
ideal SimFacset |
( |
poly |
p | ) |
|
◆ soleli1()
std::vector<std::vector<int> > soleli1 |
( |
std::vector< std::vector< int > > |
eqs | ) |
|
Definition at line 795 of file cohomo.cc.
797 int i,
j;std::vector<std::vector<int> > re;
798 std::vector<std::vector<int> > pre=eqs,ppre;
801 re.push_back(eqs[0]);
802 pre.erase(pre.begin());
805 std::vector<int> yaya;
806 for(
i=0;(
i<re.size()) && (pre.size()>0);
i++)
808 yaya=
eli1(re[
i],pre[0]);
811 for(
j=1;
j<pre.size();
j++)
814 ppre.push_back(
eli1(re[
i],pre[
j]));
◆ subspace1()
std::vector<int> subspace1 |
( |
std::vector< std::vector< int > > |
mv, |
|
|
std::vector< int > |
bv |
|
) |
| |
Definition at line 1410 of file cohomo.cc.
1414 std::vector<int>
base;
1415 std::vector<int> pv;
◆ subspacet()
std::vector<std::vector<int> > subspacet |
( |
std::vector< std::vector< int > > |
mv, |
|
|
std::vector< int > |
bv, |
|
|
std::vector< std::vector< int > > |
ntvs |
|
) |
| |
Definition at line 1877 of file cohomo.cc.
1880 std::vector<int> alset=
findalpha(mv,bv);
1881 std::vector<int> subase;
1882 std::vector<std::vector<int> > subases;
1883 for(
i=0;
i<alset.size();
i++)
1886 subases.push_back(subase);
◆ subspacet1()
std::vector<int> subspacet1 |
( |
int |
num, |
|
|
std::vector< std::vector< int > > |
ntvs |
|
) |
| |
Definition at line 1846 of file cohomo.cc.
1850 std::vector<int> subase;
1857 subase.push_back(1);
1861 subase.push_back(-1);
1865 subase.push_back(0);
◆ subspacetn()
std::vector<std::vector<int> > subspacetn |
( |
std::vector< std::vector< int > > |
N, |
|
|
std::vector< int > |
tN, |
|
|
std::vector< std::vector< int > > |
ntvs |
|
) |
| |
Definition at line 2547 of file cohomo.cc.
2551 std::vector<int> subase;
2552 std::vector<std::vector<int> > subases;
2553 for(
i=0;
i<alset.size();
i++)
2556 subases.push_back(subase);
◆ support1()
std::vector<int> support1 |
( |
poly |
p | ) |
|
Definition at line 608 of file cohomo.cc.
611 std::vector<int> supset;
◆ supports()
std::vector<std::vector<int> > supports |
( |
ideal |
h | ) |
|
Definition at line 623 of file cohomo.cc.
625 std::vector<std::vector<int> > vecs;
626 std::vector<int>
vec;
◆ T1()
Definition at line 2473 of file cohomo.cc.
2479 std::vector<std::vector<int> >
solve;
2482 PrintS(
"This is aset according to:");
2501 Print(
"Finished %d!\n",mm);
◆ T2()
Definition at line 2754 of file cohomo.cc.
2760 std::vector<int> bv,av;
2761 std::vector<std::vector<int> >
solve;
2773 PrintS(
"This is a set according to current b:\n");
2790 Print(
"There are %d graded pieces in total.\n",
gp);
◆ Tlink()
void Tlink |
( |
ideal |
h, |
|
|
poly |
a, |
|
|
poly |
b, |
|
|
int |
n |
|
) |
| |
Definition at line 2798 of file cohomo.cc.
2800 std::vector<std::vector<int> > hvs=
supports(
h);
2803 std::vector<std::vector<int> >
vec=
links(a,
h);
2804 PrintS(
"This is the links of a:\n");
2807 PrintS(
"This is the links of a(ideal version):\n");
2810 PrintS(
"1************************************************\n");
2811 PrintS(
"This is T_1 (m):\n");
2813 PrintS(
"2************************************************\n");
2814 PrintS(
"This is T_2 (m):\n");
2816 PrintS(
"3************************************************\n");
2817 PrintS(
"This is T_1 (n):\n");
2819 PrintS(
"4************************************************\n");
2820 PrintS(
"This is T_2 (n):\n");
◆ Tmat()
intvec* Tmat |
( |
std::vector< std::vector< int > > |
vecs | ) |
|
◆ tNab()
bool tNab |
( |
std::vector< std::vector< int > > |
hvs, |
|
|
std::vector< int > |
pv, |
|
|
std::vector< std::vector< int > > |
bvs |
|
) |
| |
Definition at line 2140 of file cohomo.cc.
2142 std::vector<int> sv;
2143 if(bvs.size()<=1)
return false;
2144 for(
int i=0;
i<bvs.size();
i++)
◆ tnab()
std::vector<int> tnab |
( |
std::vector< std::vector< int > > |
hvs, |
|
|
std::vector< std::vector< int > > |
nvs, |
|
|
std::vector< std::vector< int > > |
bvs |
|
) |
| |
Definition at line 2163 of file cohomo.cc.
2165 std::vector<int> pv;
2166 std::vector<int>
vec;
2167 for(
int j=0;
j<nvs.size();
j++)
2170 if(
tNab(hvs, pv, bvs))
◆ v_minus()
std::vector<int> v_minus |
( |
std::vector< int > |
v1, |
|
|
std::vector< int > |
v2 |
|
) |
| |
Definition at line 2849 of file cohomo.cc.
2851 std::vector<int>
vec;
2852 for(
int i=0;
i<v1.size();
i++)
2854 vec.push_back(v1[
i]-v2[
i]);
◆ vAbsorb()
std::vector<std::vector<int> > vAbsorb |
( |
std::vector< int > |
bset, |
|
|
std::vector< std::vector< int > > |
gset |
|
) |
| |
Definition at line 869 of file cohomo.cc.
872 std::vector<int> badset=bset;
873 int bl=badset.size();
880 if(gset[
j][0]==
m && !
IsinL(gset[
j][1],badset))
882 badset.push_back(gset[
j][1]);
883 gset.erase(gset.begin()+
j);
888 else if(!
IsinL(gset[
j][0],badset) && gset[
j][1]==
m)
890 badset.push_back(gset[
j][0]);
891 gset.erase(gset.begin()+
j);
896 else if(
IsinL(gset[
j][0],badset) &&
IsinL(gset[
j][1],badset))
898 gset.erase(gset.begin()+
j);
908 if(badset.size()==0) badset.push_back(0);
909 gset.push_back(badset);
◆ value1()
std::vector<std::vector<int> > value1 |
( |
std::vector< std::vector< int > > |
mvs, |
|
|
std::vector< std::vector< int > > |
nvs, |
|
|
std::vector< std::vector< int > > |
vecs, |
|
|
std::vector< int > |
av, |
|
|
std::vector< int > |
bv |
|
) |
| |
Definition at line 2197 of file cohomo.cc.
2199 std::vector<int> pv;
2200 std::vector<int>
base;
2201 std::vector<std::vector<int> > bases;
2202 for(
int t=0;t<vecs.size();t++)
2204 for(
int i=0;
i<mvs.size();
i++)
2207 for(
int j=0;
j<nvs.size();
j++)
2210 base.push_back(vecs[t][
j]);
2213 if(
base.size()!=mvs.size())
2215 WerrorS(
"!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!1");
2218 WerrorS(
"Errors in Nab set!");
2221 bases.push_back(
base);
◆ value2()
std::vector<std::vector<int> > value2 |
( |
std::vector< std::vector< int > > |
mvs, |
|
|
std::vector< std::vector< int > > |
nvs, |
|
|
std::vector< std::vector< int > > |
mts, |
|
|
std::vector< std::vector< int > > |
nts, |
|
|
std::vector< std::vector< int > > |
vecs, |
|
|
std::vector< int > |
av, |
|
|
std::vector< int > |
bv |
|
) |
| |
Definition at line 2569 of file cohomo.cc.
2571 std::vector<int> pv,qv;
2572 std::vector<int>
base;
2574 std::vector<std::vector<int> > bases;
2582 for(
int t=0;t<vecs.size();t++)
2584 for(
int i=0;
i<mts.size();
i++)
2597 for(
int j=0;
j<nts.size();
j++)
2604 if(
vEvl(pv,nvs[row])&&
vEvl(qv,nvs[col]))
2606 base.push_back(vecs[t][
j]);
break;
2613 base.push_back(-vecs[t][
j]);
break;
2621 if(
base.size()!=mts.size())
2623 WerrorS(
"Errors in Nab set!");
2628 bases.push_back(
base);
◆ vecbase1()
std::vector<int> vecbase1 |
( |
int |
num, |
|
|
std::vector< int > |
oset |
|
) |
| |
◆ vecIntersection()
std::vector<int> vecIntersection |
( |
std::vector< int > |
p, |
|
|
std::vector< int > |
q |
|
) |
| |
Definition at line 460 of file cohomo.cc.
463 std::vector<int> inte;
464 for(
i=0;
i<
p.size();
i++)
467 inte.push_back(
p[
i]);
◆ vecMinus()
std::vector<int> vecMinus |
( |
std::vector< int > |
vec1, |
|
|
std::vector< int > |
vec2 |
|
) |
| |
Definition at line 581 of file cohomo.cc.
583 std::vector<int>
vec;
584 for(
int i=0;
i<vec1.size();
i++)
588 vec.push_back(vec1[
i]);
◆ vecqring()
std::vector<std::vector<int> > vecqring |
( |
std::vector< std::vector< int > > |
vec1, |
|
|
std::vector< std::vector< int > > |
vec2 |
|
) |
| |
◆ vecUnion()
std::vector<int> vecUnion |
( |
std::vector< int > |
vec1, |
|
|
std::vector< int > |
vec2 |
|
) |
| |
Definition at line 567 of file cohomo.cc.
569 std::vector<int>
vec=vec1;
571 for(
i=0;
i<vec2.size();
i++)
574 vec.push_back(vec2[
i]);
◆ vEv()
bool vEv |
( |
std::vector< int > |
vec1, |
|
|
std::vector< int > |
vec2 |
|
) |
| |
Definition at line 482 of file cohomo.cc.
485 int lg1=vec1.size(),lg2=vec2.size();
492 for(
j=0;
j<vec1.size();
j++)
◆ vEvl()
bool vEvl |
( |
std::vector< int > |
vec1, |
|
|
std::vector< int > |
vec2 |
|
) |
| |
Definition at line 519 of file cohomo.cc.
521 if(vec1.size()==0 && vec2.size()==0)
◆ vInp()
bool vInp |
( |
int |
m, |
|
|
poly |
p |
|
) |
| |
◆ vInvs()
int vInvs |
( |
std::vector< int > |
vec, |
|
|
std::vector< std::vector< int > > |
vecs |
|
) |
| |
◆ vInvsl()
bool vInvsl |
( |
std::vector< int > |
vec, |
|
|
std::vector< std::vector< int > > |
vecs |
|
) |
| |
◆ vMake()
std::vector<int> vMake |
( |
poly |
p | ) |
|
Definition at line 1161 of file cohomo.cc.
1164 std::vector<int> vbase;
◆ vsMake()
std::vector<std::vector<int> > vsMake |
( |
ideal |
h | ) |
|
Definition at line 1181 of file cohomo.cc.
1183 std::vector<int>
vec;
1184 std::vector<std::vector<int> > vecs;
1189 vecs.push_back(
vec);
◆ vsubset()
bool vsubset |
( |
std::vector< int > |
vec1, |
|
|
std::vector< int > |
vec2 |
|
) |
| |
Definition at line 505 of file cohomo.cc.
508 if(vec1.size()>vec2.size())
510 for(
i=0;
i<vec1.size();
i++)
std::vector< int > subspacet1(int num, std::vector< std::vector< int > > ntvs)
ideal idMake(std::vector< std::vector< int > > vecs)
bool vEv(std::vector< int > vec1, std::vector< int > vec2)
poly p_Subst(poly p, int n, poly e, 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:
intvec * gradedpiece2n(ideal h, poly a, poly b)
void listprint(std::vector< int > vec)
BOOLEAN idcomplement(leftv res, leftv args)
void rChangeCurrRing(ring r)
std::vector< int > v_minus(std::vector< int > v1, std::vector< int > v2)
BOOLEAN iiMake_proc(idhdl pn, package pack, leftv sl)
#define pGetExp(p, i)
Exponent.
ideal idAdd(ideal h1, ideal h2)
h1 + h2
poly pMaken(std::vector< int > vbase)
idhdl enterid(const char *s, int lev, int t, idhdl *root, BOOLEAN init, BOOLEAN search)
intvec * Tmat(std::vector< std::vector< int > > vecs)
ideal scKBase(int deg, ideal s, ideal Q, intvec *mv)
std::vector< std::vector< int > > ofindbases(int num, std::vector< int > bset, std::vector< std::vector< int > > gset)
ideal getpresolve(ideal h)
ideal id_MaxIdeal(const ring r)
initialise the maximal ideal (at 0)
std::vector< std::vector< int > > vecqring(std::vector< std::vector< int > > vec1, std::vector< std::vector< int > > vec2)
std::vector< int > phimage(std::vector< int > pv, std::vector< int > av, std::vector< int > bv)
std::vector< int > gensindex(ideal M, ideal ids)
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 genst(ideal h, poly a, poly b)
std::vector< std::vector< int > > eli2(int num, std::vector< int > bset, std::vector< std::vector< int > > gset)
void lpsprint(std::vector< std::vector< poly > > pvs)
std::vector< int > vecUnion(std::vector< int > vec1, std::vector< int > vec2)
static poly pp_Mult_mm(poly p, poly m, const ring r)
const CanonicalForm CFMap CFMap & N
std::vector< int > makeequation(int i, int j, int t)
poly pMake3(std::vector< int > vbase)
BOOLEAN Links(leftv res, leftv args)
BOOLEAN idIs0(ideal h)
returns true if h is the zero ideal
std::vector< int > eli1(std::vector< int > eq1, std::vector< int > eq2)
Class used for (list of) interpreter objects.
intvec * dmat(poly a, poly b)
bool IsinL(int a, std::vector< int > badset)
bool nabconditionv(std::vector< std::vector< int > > hvs, std::vector< int > pv, std::vector< int > av, std::vector< int > bv)
static long pTotaldegree(poly p)
bool condition3for2(std::vector< std::vector< int > > hvs, std::vector< int > pv, std::vector< int > qv, std::vector< int > av, std::vector< int > bv)
bool condition1for2(std::vector< int > pv, std::vector< int > qv, std::vector< int > bv)
std::vector< poly > pMakei(std::vector< std::vector< int > > mv, std::vector< int > vbase)
ideal finda(ideal h, poly S, int ddeg)
std::vector< std::vector< poly > > idMakei(std::vector< std::vector< int > > mv, std::vector< std::vector< int > > vecs)
std::vector< int > make1(int n)
std::vector< int > vecIntersection(std::vector< int > p, std::vector< int > q)
ring rDefault(const coeffs cf, int N, char **n, int ord_size, rRingOrder_t *ord, int *block0, int *block1, int **wvhdl, unsigned long bitmask)
std::vector< std::vector< int > > links(poly a, ideal h)
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
static short rVar(const ring r)
#define rVar(r) (r->N)
std::vector< int > fvarsvalue(int vnum, std::vector< int > fvars)
BOOLEAN gd(leftv res, leftv args)
void PrintS(const char *s)
void firstorderdef_setup(SModulFunctions *p)
std::vector< std::vector< int > > Mabv(ideal h, poly a, poly b)
bool condition2for2(std::vector< std::vector< int > > hvs, std::vector< int > pv, std::vector< int > qv, std::vector< int > sv, std::vector< int > av, std::vector< int > bv)
std::vector< std::vector< int > > subspacetn(std::vector< std::vector< int > > N, std::vector< int > tN, std::vector< std::vector< int > > ntvs)
void gradedpiece1(ideal h, poly a, poly b)
ideal id_complement(ideal h)
std::vector< std::vector< int > > nabtv(std::vector< std::vector< int > > hvs, std::vector< std::vector< int > > Nv, std::vector< int > av, std::vector< int > bv)
std::vector< std::vector< int > > listsinsertlist(std::vector< std::vector< int > > gset, int a, int b)
void idSkipZeroes(ideal ide)
gives an ideal/module the minimal possible size
ideal idMinus(ideal h1, ideal h2)
ideal sfreemon(ideal h, int deg)
ideal idMake3(std::vector< std::vector< int > > vecs)
static int max(int a, int b)
BOOLEAN sgp(leftv res, leftv args)
poly pMake(std::vector< int > vbase)
std::vector< std::vector< int > > vsMake(ideal h)
BOOLEAN fa(leftv res, leftv args)
std::vector< int > subspace1(std::vector< std::vector< int > > mv, std::vector< int > bv)
bool mabconditionv(std::vector< std::vector< int > > hvs, std::vector< int > pv, std::vector< int > av, std::vector< int > bv)
static BOOLEAN p_DivisibleBy(poly a, poly b, const ring r)
std::vector< int > vecMinus(std::vector< int > vec1, std::vector< int > vec2)
std::vector< std::vector< int > > subspacet(std::vector< std::vector< int > > mv, std::vector< int > bv, std::vector< std::vector< int > > ntvs)
void lpprint(std::vector< poly > pv)
BOOLEAN genstt(leftv res, leftv args)
bool vsubset(std::vector< int > vec1, std::vector< int > vec2)
std::vector< int > support1(poly p)
bool tNab(std::vector< std::vector< int > > hvs, std::vector< int > pv, std::vector< std::vector< int > > bvs)
poly kNF(ideal F, ideal Q, poly p, int syzComp, int lazyReduce)
std::vector< std::vector< int > > soleli1(std::vector< std::vector< int > > eqs)
std::vector< int > freevars(int n, std::vector< int > bset, std::vector< std::vector< int > > gset)
BOOLEAN fgp(leftv res, leftv args)
#define pSetCoeff(p, n)
deletes old coeff before setting the new one
#define IMATELEM(M, I, J)
bool vInvsl(std::vector< int > vec, std::vector< std::vector< int > > vecs)
std::vector< std::vector< int > > minisolve(std::vector< std::vector< int > > solve, std::vector< int > index)
std::vector< std::vector< int > > canonicalbase(int n)
static FORCE_INLINE coeffs nCopyCoeff(const coeffs r)
"copy" coeffs, i.e. increment ref
BOOLEAN p_EqualPolys(poly p1, poly p2, const ring r)
std::vector< std::vector< int > > supports(ideal h)
ideal idmodulo(ideal h1, ideal h2)
std::vector< int > make0(int n)
std::vector< std::vector< int > > mabtv(std::vector< std::vector< int > > hvs, std::vector< std::vector< int > > Mv, std::vector< int > av, std::vector< int > bv)
ideal idInit(int idsize, int rank)
initialise an ideal / module
void listsprint(std::vector< std::vector< int > > posMat)
bool solve(int **extmat, int nrows, int ncols)
void WerrorS(const char *s)
bool nabtconditionv(std::vector< std::vector< int > > hvs, std::vector< int > pv, std::vector< int > qv, std::vector< int > av, std::vector< int > bv)
void gradedpiece2(ideal h, poly a, poly b)
std::vector< std::vector< int > > getvector(ideal h, int n)
BOOLEAN idsr(leftv res, leftv args)
std::vector< int > tnab(std::vector< std::vector< int > > hvs, std::vector< std::vector< int > > nvs, std::vector< std::vector< int > > bvs)
static FORCE_INLINE long n_Int(number &n, const coeffs r)
conversion of n to an int; 0 if not possible in Z/pZ: the representing int lying in (-p/2 ....
bool condition2for2nv(std::vector< std::vector< int > > hvs, std::vector< int > pv, std::vector< int > qv, std::vector< int > fv)
const Variable & v
< [in] a sqrfree bivariate poly
ideal idMaken(std::vector< std::vector< int > > vecs)
idhdl ggetid(const char *n)
const CanonicalForm int s
std::vector< int > vecbase1(int num, std::vector< int > oset)
ideal qringadd(ideal h1, ideal h2, int deg)
std::vector< int > findalpha(std::vector< std::vector< int > > mv, std::vector< int > bv)
std::vector< int > numfree(ideal h)
#define pCopy(p)
return a copy of the poly
std::vector< int > vMake(poly p)
ideal kStd(ideal F, ideal Q, tHomog h, intvec **w, intvec *hilb, int syzComp, int newIdeal, intvec *vw, s_poly_proc_t sp)
std::vector< std::vector< int > > value2(std::vector< std::vector< int > > mvs, std::vector< std::vector< int > > nvs, std::vector< std::vector< int > > mts, std::vector< std::vector< int > > nts, std::vector< std::vector< int > > vecs, std::vector< int > av, std::vector< int > bv)
ideal id_Add(ideal h1, ideal h2, const ring r)
h1 + h2
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
std::vector< int > gdegree(poly a, poly b)
bool vEvl(std::vector< int > vec1, std::vector< int > vec2)
std::vector< std::vector< int > > Nabv(std::vector< std::vector< int > > hvs, std::vector< int > av, std::vector< int > bv)
static int index(p_Length length, p_Ord ord)
std::vector< int > ofindbases1(int num, int vnum, std::vector< int > bset, std::vector< std::vector< int > > gset)
std::vector< int > findalphan(std::vector< std::vector< int > > N, std::vector< int > tN)
ideal mingens(ideal h, poly a, poly b)
std::vector< std::vector< int > > vAbsorb(std::vector< int > bset, std::vector< std::vector< int > > gset)
intvec * gradedpiece1n(ideal h, poly a, poly b)
BOOLEAN fb(leftv res, leftv args)
std::vector< std::vector< int > > value1(std::vector< std::vector< int > > mvs, std::vector< std::vector< int > > nvs, std::vector< std::vector< int > > vecs, std::vector< int > av, std::vector< int > bv)