 |
My Project
debian-1:4.1.1-p2+ds-4build2
|
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 2974 of file cohomo.cc.
2979 poly
p= (poly)
h->Data();
2983 poly q= (poly)
h->Data();
◆ 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!");
◆ 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 | ) |
|
◆ 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");
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)
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)
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)
void gradedpiece1(ideal h, poly a, poly b)
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)
void gradedpiece2(ideal h, poly a, poly b)
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)
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)