 |
My Project
debian-1:4.1.2-p1+ds-2
|
Go to the source code of this file.
|
void | gradedpiece1 (ideal h, poly a, poly b) |
|
void | gradedpiece2 (ideal h, poly a, poly b) |
|
intvec * | gradedpiece1n (ideal h, poly a, poly b) |
|
void | Tlink (ideal h, poly a, poly b, int n) |
|
void | T1 (ideal h) |
|
void | T2 (ideal h) |
|
ideal | idsrRing (ideal h) |
|
BOOLEAN | idsr (leftv res, leftv args) |
|
BOOLEAN | gd (leftv res, leftv args) |
|
◆ gd()
Definition at line 4294 of file cohomo.cc.
4299 poly
p= (poly)
h->Data();
4303 poly q= (poly)
h->Data();
◆ gradedpiece1()
void gradedpiece1 |
( |
ideal |
h, |
|
|
poly |
a, |
|
|
poly |
b |
|
) |
| |
Definition at line 1988 of file cohomo.cc.
2032 std::vector<std::vector<int> > suu;
2043 PrintS(
"No element considered!\n");
◆ gradedpiece1n()
intvec* gradedpiece1n |
( |
ideal |
h, |
|
|
poly |
a, |
|
|
poly |
b |
|
) |
| |
Definition at line 2766 of file cohomo.cc.
2780 tnv=
tnab(hvs,nv,sbv);
2781 for(
i=0;
i<tnv.size();
i++)
2784 bad.push_back(co+1);
2808 std::vector<int> su=
make1(n);
2809 std::vector<std::vector<int> > suu;
◆ gradedpiece2()
void gradedpiece2 |
( |
ideal |
h, |
|
|
poly |
a, |
|
|
poly |
b |
|
) |
| |
Definition at line 2373 of file cohomo.cc.
2375 int t0,t1,t2,
i,
j,t,
m;
2378 std::vector<std::vector<int> > hvs=
supports(
h), mv=
Mabv(
h,a,
b), mts, vecs,vars;
2380 mts=
mabtv(hvs,mv,av,bv);
2381 PrintS(
"The homomorphism should map onto:\n");
2386 vars=
mabtv(hvs,mv,av,bv);
2388 for(t0=0;t0<vars.size();t0++)
2399 vecs.push_back(
vec);
2409 vecs.push_back(
vec);
2412 for(t1=t0+1;t1<vars.size();t1++)
2414 for(t2=t1+1;t2<vars.size();t2++)
2416 if(vars[t0][0]==vars[t1][0]&&vars[t1][1]==vars[t2][1]&&vars[t0][1]==vars[t2][0])
2424 vecs.push_back(
vec);
2436 std::vector<std::vector<int> > re=
getvector(id_re,vn);
2437 PrintS(
"this is the solution for ideal :\n");
2440 std::vector<std::vector<int> > sub=
subspacet(mv, bv,vars);
2441 PrintS(
"this is the solution for subspace:\n");
2445 PrintS(
"This is the solution of coefficients:\n");
2451 PrintS(
"No element considered!");
◆ idsr()
Definition at line 4252 of file cohomo.cc.
4257 ideal h1= (ideal)
h->Data();
4261 poly
p= (poly)
h->Data();
4265 poly q= (poly)
h->Data();
◆ idsrRing()
ideal idsrRing |
( |
ideal |
h | ) |
|
◆ T1()
Definition at line 2838 of file cohomo.cc.
2844 std::vector<std::vector<int> >
solve;
2866 Print(
"Finished %d!\n",mm);
◆ T2()
Definition at line 3097 of file cohomo.cc.
3103 std::vector<int> bv,av;
3104 std::vector<std::vector<int> >
solve;
3116 PrintS(
"This is a set according to current b:\n");
3133 Print(
"There are %d graded pieces in total.\n",
gp);
◆ Tlink()
void Tlink |
( |
ideal |
h, |
|
|
poly |
a, |
|
|
poly |
b, |
|
|
int |
n |
|
) |
| |
intvec * gradedpiece2n(ideal h, poly a, poly b)
void rChangeCurrRing(ring r)
ideal idAdd(ideal h1, ideal h2)
h1 + h2
intvec * Tmat(std::vector< std::vector< int > > vecs)
ideal scKBase(int deg, ideal s, ideal Q, intvec *mv)
std::vector< std::vector< int > > vecqring(std::vector< std::vector< int > > vec1, std::vector< std::vector< int > > vec2)
std::vector< int > gensindex(ideal M, ideal ids)
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)
std::vector< int > makeequation(int i, int j, int t)
BOOLEAN idIs0(ideal h)
returns true if h is the zero ideal
Class used for (list of) interpreter objects.
intvec * dmat(poly a, poly b)
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)
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)
static short rVar(const ring r)
#define rVar(r) (r->N)
void PrintS(const char *s)
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 > > listsinsertlist(std::vector< std::vector< int > > gset, int a, int b)
void idSkipZeroes(ideal ide)
gives an ideal/module the minimal possible size
ideal sfreemon(ideal h, int deg)
ideal idMake3(std::vector< std::vector< int > > vecs)
static int max(int a, int b)
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)
std::vector< std::vector< int > > subspacet(std::vector< std::vector< int > > mv, std::vector< int > bv, std::vector< std::vector< int > > ntvs)
bool vsubset(std::vector< int > vec1, std::vector< int > vec2)
std::vector< int > support1(poly p)
#define IMATELEM(M, I, J)
std::vector< std::vector< int > > minisolve(std::vector< std::vector< int > > solve, std::vector< int > index)
std::vector< std::vector< int > > supports(ideal h)
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 listsprint(std::vector< std::vector< int > > posMat)
bool solve(int **extmat, int nrows, int ncols)
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 > > getvector(ideal h, int n)
std::vector< int > tnab(std::vector< std::vector< int > > hvs, std::vector< std::vector< int > > nvs, std::vector< std::vector< int > > bvs)
ideal idMaken(std::vector< std::vector< int > > vecs)
VAR ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
ideal qringadd(ideal h1, ideal h2, int deg)
#define pCopy(p)
return a copy of the poly
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)
ideal mingens(ideal h, poly a, poly b)
intvec * gradedpiece1n(ideal h, poly a, poly b)
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)