 |
My Project
debian-1:4.1.2-p1+ds-2
|
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) |
|
bool | IsinL (int a, std::vector< int > vec) |
|
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< std::vector< int > > | vsMinusv (std::vector< std::vector< int > > vecs, std::vector< int > vec) |
|
std::vector< std::vector< int > > | vsUnion (std::vector< std::vector< int > > vs1, std::vector< std::vector< int > > vs2) |
|
std::vector< std::vector< int > > | vsIntersection (std::vector< std::vector< int > > vs1, std::vector< std::vector< int > > vs2) |
|
std::vector< int > | support1 (poly p) |
|
std::vector< std::vector< int > > | supports (ideal h) |
|
std::vector< int > | support2 (poly p) |
|
std::vector< std::vector< int > > | supports2 (ideal h) |
|
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) |
|
poly | pMaken (std::vector< int > vbase) |
|
ideal | idMaken (std::vector< std::vector< int > > vecs) |
|
std::vector< std::vector< int > > | b_subsets (std::vector< int > vec) |
|
int | idvert (ideal h) |
|
int | pvert (poly p) |
|
ideal | idMinus (ideal h1, ideal h2) |
|
bool | p_Ifsfree (poly P) |
|
ideal | sfreemon (ideal h, int deg) |
|
ideal | id_sfmon (ideal h) |
|
ideal | id_complement (ideal h) |
|
bool | IsInX (poly p, ideal X) |
|
ideal | qringadd (ideal h1, ideal h2, int deg) |
|
int | id_maxdeg (ideal h) |
|
ideal | idsrRing (ideal h) |
|
ideal | SimFacset (poly p) |
|
ideal | idadda (ideal h1, ideal h2) |
|
ideal | IsSimplex (ideal h) |
|
ideal | complementsimplex (ideal h) |
|
int | dim_sim (ideal h) |
|
int | num4dim (ideal h, int n) |
|
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< int > | keeporder (std::vector< int > vec) |
|
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) |
|
std::vector< std::vector< int > > | links (poly a, ideal h) |
|
int | redefinedeg (poly p, int num) |
|
ideal | p_a (ideal h) |
|
std::vector< std::vector< int > > | id_subsets (std::vector< std::vector< int > > vecs) |
|
std::vector< int > | vertset (std::vector< std::vector< int > > vecs) |
|
ideal | p_b (ideal h, poly a) |
|
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) |
|
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) |
|
std::vector< int > | phimagel (std::vector< int > fv, std::vector< int > av, std::vector< int > bv) |
|
std::vector< std::vector< int > > | value1l (std::vector< std::vector< int > > mvs, std::vector< std::vector< int > > lks, std::vector< std::vector< int > > vecs, std::vector< int > av, std::vector< int > bv) |
|
static void | TimeShow (clock_t t_construct, clock_t t_solve, clock_t t_value, clock_t t_total) |
|
std::vector< std::vector< int > > | gpl (ideal h, poly a, poly b) |
|
intvec * | gradedpiece1nl (ideal h, poly a, poly b, int set) |
|
std::vector< std::vector< int > > | value2l (std::vector< std::vector< int > > mvs, std::vector< std::vector< int > > lks, std::vector< std::vector< int > > mts, std::vector< std::vector< int > > lkts, std::vector< std::vector< int > > vecs, std::vector< int > av, std::vector< int > bv) |
|
std::vector< std::vector< int > > | gpl2 (ideal h, poly a, poly b) |
|
intvec * | gradedpiece2nl (ideal h, poly a, poly b) |
|
ideal | trisets (ideal h) |
|
std::vector< std::vector< int > > | triface (poly p, int vert) |
|
ideal | triangulations1 (ideal h, poly p, int vert) |
|
std::vector< int > | commonedge (poly p, poly q) |
|
intvec * | edgemat (poly p, poly q) |
|
std::vector< std::vector< int > > | tetraface (poly p, poly q, int vert) |
|
ideal | triangulations2 (ideal h, poly p, poly q, int vert) |
|
std::vector< std::vector< int > > | penface (poly p, poly q, poly g, int vert) |
|
ideal | triangulations3 (ideal h, poly p, poly q, poly g, int vert) |
|
int | valency (ideal h, poly p) |
|
std::vector< std::vector< int > > | vsMinusvs (std::vector< std::vector< int > > vs1, std::vector< std::vector< int > > vs2) |
|
std::vector< std::vector< int > > | vs_subsets (std::vector< std::vector< int > > vs) |
|
std::vector< std::vector< int > > | p_constant (ideal Xo, ideal Sigma) |
|
std::vector< std::vector< int > > | p_change (ideal Sigma) |
|
std::vector< std::vector< int > > | p_new (ideal Xo, ideal Sigma) |
|
ideal | c_New (ideal Io, ideal sig) |
|
std::vector< std::vector< int > > | phi1 (poly a, ideal Sigma) |
|
std::vector< std::vector< int > > | phi2 (poly a, ideal Xo, ideal Sigma, int vert) |
|
std::vector< std::vector< int > > | links_new (poly a, ideal Xo, ideal Sigma, int vert, int ord) |
|
int | existIn (poly b, ideal Xs) |
|
int | isoNum (poly p, ideal I, poly a, poly b) |
|
int | ifIso (poly p, poly q, poly f, poly g, poly a, poly b) |
|
ideal | idMinusp (ideal I, poly p) |
|
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) |
|
std::vector< std::vector< int > > | star (poly a, ideal h) |
|
std::vector< std::vector< int > > | boundary (poly a) |
|
std::vector< std::vector< int > > | stellarsub (poly a, ideal h) |
|
std::vector< std::vector< int > > | bsubsets_1 (poly b) |
|
ideal | T_1h (ideal h) |
|
BOOLEAN | SRideal (leftv res, leftv args) |
|
BOOLEAN | idcomplement (leftv res, leftv args) |
|
BOOLEAN | t1h (leftv res, leftv args) |
|
BOOLEAN | idsr (leftv res, leftv args) |
|
intvec * | dmat (poly a, poly b) |
|
BOOLEAN | gd (leftv res, leftv args) |
|
BOOLEAN | comedg (leftv res, leftv args) |
|
BOOLEAN | fb (leftv res, leftv args) |
|
BOOLEAN | pa (leftv res, leftv args) |
|
BOOLEAN | makeSimplex (leftv res, leftv args) |
|
BOOLEAN | pb (leftv res, leftv args) |
|
BOOLEAN | fa (leftv res, leftv args) |
|
BOOLEAN | fgp (leftv res, leftv args) |
|
BOOLEAN | fgpl (leftv res, leftv args) |
|
BOOLEAN | genstt (leftv res, leftv args) |
|
BOOLEAN | sgp (leftv res, leftv args) |
|
BOOLEAN | sgpl (leftv res, leftv args) |
|
BOOLEAN | Links (leftv res, leftv args) |
|
BOOLEAN | isSim (leftv res, leftv args) |
|
BOOLEAN | nfaces1 (leftv res, leftv args) |
|
BOOLEAN | nfaces2 (leftv res, leftv args) |
|
BOOLEAN | nfaces3 (leftv res, leftv args) |
|
BOOLEAN | eqsolve1 (leftv res, leftv args) |
|
BOOLEAN | tsets (leftv res, leftv args) |
|
BOOLEAN | Valency (leftv res, leftv args) |
|
BOOLEAN | nabvl (leftv res, leftv args) |
|
BOOLEAN | tnabvl (leftv res, leftv args) |
|
BOOLEAN | vsIntersec (leftv res, leftv args) |
|
BOOLEAN | mabvl (leftv res, leftv args) |
|
BOOLEAN | nabtvl (leftv res, leftv args) |
|
BOOLEAN | linkn (leftv res, leftv args) |
|
BOOLEAN | existsub (leftv res, leftv args) |
|
BOOLEAN | pConstant (leftv res, leftv args) |
|
BOOLEAN | pChange (leftv res, leftv args) |
|
BOOLEAN | p_New (leftv res, leftv args) |
|
BOOLEAN | support (leftv res, leftv args) |
|
BOOLEAN | bprime (leftv res, leftv args) |
|
BOOLEAN | psMinusp (leftv res, leftv args) |
|
BOOLEAN | stellarremain (leftv res, leftv args) |
|
BOOLEAN | cNew (leftv res, leftv args) |
|
BOOLEAN | stars (leftv res, leftv args) |
|
BOOLEAN | stellarsubdivision (leftv res, leftv args) |
|
BOOLEAN | idModulo (leftv res, leftv args) |
|
BOOLEAN | idminus (leftv res, leftv args) |
|
BOOLEAN | isoNumber (leftv res, leftv args) |
|
BOOLEAN | ifIsomorphism (leftv res, leftv args) |
|
BOOLEAN | newDegree (leftv res, leftv args) |
|
BOOLEAN | nonf2f (leftv res, leftv args) |
|
BOOLEAN | dimsim (leftv res, leftv args) |
|
BOOLEAN | numdim (leftv res, leftv args) |
|
void | firstorderdef_setup (SModulFunctions *p) |
|
int SI_MOD_INIT0() | cohomo (SModulFunctions *p) |
|
◆ b_subsets()
std::vector<std::vector<int> > b_subsets |
( |
std::vector< int > |
vec | ) |
|
Definition at line 610 of file cohomo.cc.
614 std::vector<std::vector<int> > vecs;
617 bv.push_back(
vec[
i]);
622 for(
i=0;
i<vecs.size();
i++)
624 for(
j=
i+1;
j<vecs.size();
j++)
◆ boundary()
std::vector<std::vector<int> > boundary |
( |
poly |
a | ) |
|
Definition at line 4082 of file cohomo.cc.
4085 std::vector<std::vector<int> > vecs;
4087 vecs.push_back(
vec);
◆ bprime()
◆ bsubsets_1()
std::vector<std::vector<int> > bsubsets_1 |
( |
poly |
b | ) |
|
Definition at line 4131 of file cohomo.cc.
4134 std::vector<std::vector<int> > bset;
4135 for(
int i=0;
i<bvs.size();
i++)
4137 for(
int j=0;
j<bvs.size(),
j!=
i;
j++)
4139 vs.push_back(bvs[
j]);
◆ c_New()
ideal c_New |
( |
ideal |
Io, |
|
|
ideal |
sig |
|
) |
| |
Definition at line 3851 of file cohomo.cc.
3855 std::vector<int> ev;
3856 int ednum=vsig.size();
3859 vsig.push_back(
commonedge(sig->m[0], sig->m[1]));
◆ canonicalbase()
std::vector<std::vector<int> > canonicalbase |
( |
int |
n | ) |
|
Definition at line 2178 of file cohomo.cc.
2180 std::vector<std::vector<int> > vecs;
2181 std::vector<int>
vec;
2192 vecs.push_back(
vec);
◆ cNew()
Definition at line 5043 of file cohomo.cc.
5048 ideal h1= (ideal)
h->Data();
5052 ideal h2= (ideal)
h->Data();
◆ cohomo()
◆ comedg()
Definition at line 4313 of file cohomo.cc.
4318 poly
p= (poly)
h->Data();
4322 poly q= (poly)
h->Data();
◆ commonedge()
std::vector<int> commonedge |
( |
poly |
p, |
|
|
poly |
q |
|
) |
| |
Definition at line 3576 of file cohomo.cc.
3580 for(
i=0;
i<fv1.size();
i++)
3583 ev.push_back(fv1[
i]);
◆ complementsimplex()
ideal complementsimplex |
( |
ideal |
h | ) |
|
◆ 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 2097 of file cohomo.cc.
2099 std::vector<int> v1,v2,v3;
◆ dim_sim()
◆ dimsim()
Definition at line 5239 of file cohomo.cc.
5244 ideal h1= (ideal)
h->Data();
◆ dmat()
intvec* dmat |
( |
poly |
a, |
|
|
poly |
b |
|
) |
| |
◆ edgemat()
intvec* edgemat |
( |
poly |
p, |
|
|
poly |
q |
|
) |
| |
◆ eli1()
std::vector<int> eli1 |
( |
std::vector< int > |
eq1, |
|
|
std::vector< int > |
eq2 |
|
) |
| |
Definition at line 1190 of file cohomo.cc.
1193 std::vector<int> eq;
◆ eli2()
std::vector<std::vector<int> > eli2 |
( |
int |
num, |
|
|
std::vector< int > |
bset, |
|
|
std::vector< std::vector< int > > |
gset |
|
) |
| |
Definition at line 1480 of file cohomo.cc.
1483 std::vector<int> badset;
1484 std::vector<std::vector<int> > goodset,
solve;
1494 int m=goodset.size();
1495 badset=goodset[
m-1];
1496 goodset.erase(goodset.end());
◆ eqsolve1()
Definition at line 4654 of file cohomo.cc.
4657 std::vector<int> bset,bs;
4658 std::vector<std::vector<int> > gset;
4661 int n= (int)(
long)
h->Data();
4665 ideal bi= (ideal)
h->Data();
4669 ideal gi= (ideal)
h->Data();
4674 bset.push_back(bs[0]);
4675 else if(bs.size()==0)
4679 WerrorS(
"Errors in T^1 Equations Solving!");
4687 std::vector<std::vector<int> > vecs=
eli2(n,bset,gset);
◆ equmab()
Definition at line 1896 of file cohomo.cc.
1907 sprintf (tt[
i],
"t(%d)",
i+1);
◆ existIn()
int existIn |
( |
poly |
b, |
|
|
ideal |
Xs |
|
) |
| |
◆ existsub()
Definition at line 4903 of file cohomo.cc.
4908 poly
p= (poly)
h->Data();
4912 ideal h1= (ideal)
h->Data();
◆ fa()
Definition at line 4392 of file cohomo.cc.
4397 ideal h1= (ideal)
h->Data();
4401 poly q= (poly)
h->Data();
4405 int d= (int)(
long)
h->Data();
◆ fb()
Definition at line 4333 of file cohomo.cc.
4338 ideal h1= (ideal)
h->Data();
◆ fgp()
Definition at line 4415 of file cohomo.cc.
4420 ideal h1= (ideal)
h->Data();
4424 poly
p= (poly)
h->Data();
4428 poly q= (poly)
h->Data();
◆ fgpl()
Definition at line 4438 of file cohomo.cc.
4443 ideal h1= (ideal)
h->Data();
4447 poly
p= (poly)
h->Data();
4451 poly q= (poly)
h->Data();
4455 int d= (int)(
long)
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 2276 of file cohomo.cc.
2278 std::vector<int> alset;
2279 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 2893 of file cohomo.cc.
2895 int i;std::vector<int> alset,
vec;
2896 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 1282 of file cohomo.cc.
1284 int ql=gset.size(), bl=bset.size(),
i;
1285 std::vector<int>
mvar, fvar;
1288 mvar.push_back(bset[
i]);
1292 mvar.push_back(gset[
i][0]);
◆ fvarsvalue()
std::vector<int> fvarsvalue |
( |
int |
vnum, |
|
|
std::vector< int > |
fvars |
|
) |
| |
Definition at line 1306 of file cohomo.cc.
1309 std::vector<int> fset=fvars;
1310 for(
i=0;
i<fset.size();
i++)
1314 fset.erase(fset.begin()+
i);
◆ gd()
Definition at line 4294 of file cohomo.cc.
4299 poly
p= (poly)
h->Data();
4303 poly q= (poly)
h->Data();
◆ gdegree()
std::vector<int> gdegree |
( |
poly |
a, |
|
|
poly |
b |
|
) |
| |
Definition at line 4042 of file cohomo.cc.
4045 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 2988 of file cohomo.cc.
2991 std::vector<std::vector<int> > hvs=
supports(
h),mv,mts;
2994 mts=
mabtv(hvs,mv,av,bv);
2995 std::vector<std::vector<poly> > pvs=
idMakei(mv,mts);
2997 for(
i=0;
i<pvs.size();
i++)
◆ genstt()
Definition at line 4467 of file cohomo.cc.
4472 ideal h1= (ideal)
h->Data();
4476 poly
p= (poly)
h->Data();
4480 poly q= (poly)
h->Data();
◆ getpresolve()
ideal getpresolve |
( |
ideal |
h | ) |
|
◆ getvector()
std::vector<std::vector<int> > getvector |
( |
ideal |
h, |
|
|
int |
n |
|
) |
| |
Definition at line 2202 of file cohomo.cc.
2204 std::vector<int>
vec;
2205 std::vector<std::vector<int> > vecs;
2212 std::vector<int> fvar=
numfree(h1);
2253 vecs.push_back(
vec);
◆ gpl()
std::vector<std::vector<int> > gpl |
( |
ideal |
h, |
|
|
poly |
a, |
|
|
poly |
b |
|
) |
| |
Definition at line 3204 of file cohomo.cc.
3207 std::vector<std::vector<int> > hvs=
supports(
h),sbv,nv,mv,good,
solve;
3220 tnv=
tnab(hvs,nv,sbv);
3221 for(
i=0;
i<tnv.size();
i++)
3224 bad.push_back(co+1);
3249 std::vector<int> su=
make1(n);
3250 std::vector<std::vector<int> > suu;
◆ gpl2()
std::vector<std::vector<int> > gpl2 |
( |
ideal |
h, |
|
|
poly |
a, |
|
|
poly |
b |
|
) |
| |
Definition at line 3351 of file cohomo.cc.
3354 std::vector<std::vector<int> > hvs=
supports(
h),sbv,nv,mv,mts,vecs,vars,ntvs,
solve;
3360 tnv=
tnab(hvs,nv,sbv);
3363 mts=
mabtv(hvs,mv,av,bv);
3366 ntvs=
nabtv( hvs, nv, av, bv);
3370 for(
int t0=0;t0<
l;t0++)
3377 vecs.push_back(
vec);
3380 for(
int t1=t0+1;t1<ntvs.size();t1++)
3382 for(
int t2=t1+1;t2<ntvs.size();t2++)
3384 if(ntvs[t0][0]==ntvs[t1][0]&&ntvs[t1][1]==ntvs[t2][1]&&ntvs[t0][1]==ntvs[t2][0])
3392 vecs.push_back(
vec);
3402 std::vector<std::vector<int> > re=
getvector(id_re,
l);
3404 std::vector<std::vector<int> > sub=
subspacetn(nv, tnv,ntvs);
◆ 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;
◆ gradedpiece1nl()
intvec* gradedpiece1nl |
( |
ideal |
h, |
|
|
poly |
a, |
|
|
poly |
b, |
|
|
int |
set |
|
) |
| |
◆ 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!");
◆ gradedpiece2n()
intvec* gradedpiece2n |
( |
ideal |
h, |
|
|
poly |
a, |
|
|
poly |
b |
|
) |
| |
Definition at line 3013 of file cohomo.cc.
3016 std::vector<std::vector<int> > hvs=
supports(
h),nv,mv,mts,sbv,vecs,vars,ntvs,
solve;
3022 tnv=
tnab(hvs,nv,sbv);
3025 mts=
mabtv(hvs,mv,av,bv);
3032 ntvs=
nabtv( hvs, nv, av, bv);
3036 for(
int t0=0;t0<
l;t0++)
3043 vecs.push_back(
vec);
3046 for(
int t1=t0+1;t1<ntvs.size();t1++)
3048 for(
int t2=t1+1;t2<ntvs.size();t2++)
3050 if(ntvs[t0][0]==ntvs[t1][0]&&ntvs[t1][1]==ntvs[t2][1]&&ntvs[t0][1]==ntvs[t2][0])
3058 vecs.push_back(
vec);
3071 std::vector<std::vector<int> > re=
getvector(id_re,
l);
3075 std::vector<std::vector<int> > sub=
subspacetn(nv, tnv,ntvs);
◆ gradedpiece2nl()
intvec* gradedpiece2nl |
( |
ideal |
h, |
|
|
poly |
a, |
|
|
poly |
b |
|
) |
| |
◆ id_complement()
ideal id_complement |
( |
ideal |
h | ) |
|
◆ id_maxdeg()
◆ id_print()
◆ id_sfmon()
ideal id_sfmon |
( |
ideal |
h | ) |
|
Definition at line 811 of file cohomo.cc.
813 ideal asfmons,sfmons,mons,
p;
◆ id_subsets()
std::vector<std::vector<int> > id_subsets |
( |
std::vector< std::vector< int > > |
vecs | ) |
|
Definition at line 1647 of file cohomo.cc.
1650 std::vector<std::vector<int> > vvs,
res;
1651 for(
i=0;
i<vecs.size();
i++)
1655 for(
j=0;
j<vvs.size();
j++)
1658 res.push_back(vvs[
j]);
◆ idadda()
ideal idadda |
( |
ideal |
h1, |
|
|
ideal |
h2 |
|
) |
| |
◆ idcomplement()
Definition at line 4222 of file cohomo.cc.
4227 ideal hh=(ideal)
h->Data();
◆ idMake()
ideal idMake |
( |
std::vector< std::vector< int > > |
vecs | ) |
|
Definition at line 458 of file cohomo.cc.
460 int lv=vecs.size(),
i,
j;
◆ 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 1961 of file cohomo.cc.
1963 int i,lv=vecs.size();
1964 std::vector<std::vector<poly> > re;
1965 std::vector<poly>
h;
◆ idMaken()
ideal idMaken |
( |
std::vector< std::vector< int > > |
vecs | ) |
|
Definition at line 590 of file cohomo.cc.
594 int i,lv=vecs.size();
◆ idMinus()
ideal idMinus |
( |
ideal |
h1, |
|
|
ideal |
h2 |
|
) |
| |
◆ idminus()
Definition at line 5120 of file cohomo.cc.
5125 ideal h1= (ideal)
h->Data();
5129 ideal h2= (ideal)
h->Data();
◆ idMinusp()
ideal idMinusp |
( |
ideal |
I, |
|
|
poly |
p |
|
) |
| |
◆ idmodulo()
ideal idmodulo |
( |
ideal |
h1, |
|
|
ideal |
h2 |
|
) |
| |
◆ idModulo()
Definition at line 5102 of file cohomo.cc.
5107 ideal h1= (ideal)
h->Data();
5111 ideal h2= (ideal)
h->Data();
◆ 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 | ) |
|
◆ idvert()
◆ ifIso()
int ifIso |
( |
poly |
p, |
|
|
poly |
q, |
|
|
poly |
f, |
|
|
poly |
g, |
|
|
poly |
a, |
|
|
poly |
b |
|
) |
| |
Definition at line 3990 of file cohomo.cc.
3994 std::vector<int> v1=
phimagel(vp, va, vb), v2=
phimagel(vq, va, vb), v3=
phimagel(vf, va, vb), v4=
phimagel(vg, va, vb);
◆ ifIsomorphism()
Definition at line 5168 of file cohomo.cc.
5173 poly
p= (poly)
h->Data();
5177 poly q= (poly)
h->Data();
5181 poly
f= (poly)
h->Data();
5185 poly
g= (poly)
h->Data();
5189 poly a= (poly)
h->Data();
5193 poly
b= (poly)
h->Data();
◆ IsinL()
bool IsinL |
( |
int |
a, |
|
|
std::vector< int > |
vec |
|
) |
| |
◆ IsInX()
bool IsInX |
( |
poly |
p, |
|
|
ideal |
X |
|
) |
| |
◆ isoNum()
int isoNum |
( |
poly |
p, |
|
|
ideal |
I, |
|
|
poly |
a, |
|
|
poly |
b |
|
) |
| |
◆ isoNumber()
Definition at line 5139 of file cohomo.cc.
5144 poly
p= (poly)
h->Data();
5148 ideal h1= (ideal)
h->Data();
5152 poly a= (poly)
h->Data();
5156 poly
b= (poly)
h->Data();
◆ isSim()
Definition at line 4554 of file cohomo.cc.
4559 ideal h1= (ideal)
h->Data();
◆ IsSimplex()
ideal IsSimplex |
( |
ideal |
h | ) |
|
◆ keeporder()
std::vector<int> keeporder |
( |
std::vector< int > |
vec | ) |
|
Definition at line 1233 of file cohomo.cc.
1235 std::vector<int> yaya;
◆ linkn()
Definition at line 4869 of file cohomo.cc.
4874 poly a= (poly)
h->Data();
4878 ideal Xo= (ideal)
h->Data();
4882 ideal Sigma= (ideal)
h->Data();
4886 int vert= (int)(
long)
h->Data();
4890 int ord= (int)(
long)
h->Data();
◆ Links()
Definition at line 4536 of file cohomo.cc.
4541 poly
p= (poly)
h->Data();
4545 ideal h1= (ideal)
h->Data();
4547 std::vector<std::vector<int> > vecs=
links(
p,h1);
◆ links()
std::vector<std::vector<int> > links |
( |
poly |
a, |
|
|
ideal |
h |
|
) |
| |
Definition at line 1529 of file cohomo.cc.
1532 std::vector<std::vector<int> > lk,X=
supports(
h);
1533 std::vector<int> U,In,av=
support1(a);
1534 for(
i=0;
i<X.size();
i++)
1538 if( In.size()==0 &&
vInvsl(U,X))
◆ links_new()
std::vector<std::vector<int> > links_new |
( |
poly |
a, |
|
|
ideal |
Xo, |
|
|
ideal |
Sigma, |
|
|
int |
vert, |
|
|
int |
ord |
|
) |
| |
Definition at line 3926 of file cohomo.cc.
3929 std::vector<std::vector<int> > lko, lkn, lk1, lk2;
3937 lk2=
phi2(a, Xo, Sigma, vert);
3944 lkn=
phi2(a, Xo, Sigma, vert);
3947 WerrorS(
"Cannot find the links smartly!");
◆ 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 1830 of file cohomo.cc.
1832 std::vector<int> eq;
◆ listsprint()
void listsprint |
( |
std::vector< std::vector< int > > |
posMat | ) |
|
Definition at line 65 of file cohomo.cc.
68 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 117 of file cohomo.cc.
119 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 2347 of file cohomo.cc.
2349 std::vector<int> v1,var;
2350 std::vector<std::vector<int> > vars;
2351 for(
int i=0;
i<Mv.size();
i++)
2353 for(
int j=
i+1;
j<Mv.size();
j++)
2361 vars.push_back(var);
◆ Mabv()
std::vector<std::vector<int> > Mabv |
( |
ideal |
h, |
|
|
poly |
a, |
|
|
poly |
b |
|
) |
| |
◆ mabvl()
Definition at line 4810 of file cohomo.cc.
4815 ideal h1= (ideal)
h->Data();
4819 poly
p= (poly)
h->Data();
4823 poly q= (poly)
h->Data();
◆ 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 1843 of file cohomo.cc.
1845 std::vector<int> equation;
1846 equation.push_back(
i);
1847 equation.push_back(
j);
1848 equation.push_back(t);
◆ makemab()
ideal makemab |
( |
ideal |
h, |
|
|
poly |
a, |
|
|
poly |
b |
|
) |
| |
◆ makeSimplex()
Definition at line 4360 of file cohomo.cc.
4365 ideal h1= (ideal)
h->Data();
◆ 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 2742 of file cohomo.cc.
2745 std::vector<int>
vec,solm;
2746 std::vector<std::vector<int> > solsm;
2750 for(
j=0;
j<
vec.size();
j++)
2753 solm.push_back(
vec[
j]);
2755 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 2528 of file cohomo.cc.
2530 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 2541 of file cohomo.cc.
2543 std::vector<int> v1,var;
2544 std::vector<std::vector<int> > vars;
2545 for(
int i=0;
i<Nv.size();
i++)
2547 for(
int j=
i+1;
j<Nv.size();
j++)
2554 vars.push_back(var);
◆ nabtvl()
Definition at line 4834 of file cohomo.cc.
4839 ideal h1= (ideal)
h->Data();
4843 poly
p= (poly)
h->Data();
4847 poly q= (poly)
h->Data();
4848 std::vector<std::vector<int> > hvs=
supports(h1), nv, ntvs;
4851 ntvs=
nabtv( hvs, nv, av, bv);
4852 std::vector<std::vector<poly> > pvs=
idMakei(nv,ntvs);
4854 for(
int i=0;
i<pvs.size();
i++)
◆ Nabv()
std::vector<std::vector<int> > Nabv |
( |
std::vector< std::vector< int > > |
hvs, |
|
|
std::vector< int > |
av, |
|
|
std::vector< int > |
bv |
|
) |
| |
Definition at line 2506 of file cohomo.cc.
2508 std::vector<std::vector<int> > vecs;
2515 vecs.push_back(hvs[
i]);
◆ nabvl()
Definition at line 4732 of file cohomo.cc.
4737 ideal h1= (ideal)
h->Data();
4741 poly
p= (poly)
h->Data();
4745 poly q= (poly)
h->Data();
4747 std::vector<std::vector<int> > vecs=
supports(h1);
◆ newDegree()
Definition at line 5206 of file cohomo.cc.
5211 poly
p= (poly)
h->Data();
5215 int num= (int)(
long)
h->Data();
◆ nfaces1()
Definition at line 4567 of file cohomo.cc.
4572 ideal h1= (ideal)
h->Data();
4576 poly
p= (poly)
h->Data();
4580 int d= (int)(
long)
h->Data();
◆ nfaces2()
Definition at line 4590 of file cohomo.cc.
4595 ideal h1= (ideal)
h->Data();
4599 poly
p= (poly)
h->Data();
4603 poly q= (poly)
h->Data();
4607 int d= (int)(
long)
h->Data();
◆ nfaces3()
Definition at line 4618 of file cohomo.cc.
4623 ideal h1= (ideal)
h->Data();
4627 poly
p= (poly)
h->Data();
4631 poly q= (poly)
h->Data();
4635 poly
g= (poly)
h->Data();
4639 int d= (int)(
long)
h->Data();
◆ nonf2f()
Definition at line 5225 of file cohomo.cc.
5230 ideal h1= (ideal)
h->Data();
◆ num4dim()
int num4dim |
( |
ideal |
h, |
|
|
int |
n |
|
) |
| |
◆ numdim()
Definition at line 5253 of file cohomo.cc.
5258 ideal h1= (ideal)
h->Data();
5262 int num= (int)(
long)
h->Data();
◆ numfree()
std::vector<int> numfree |
( |
ideal |
h | ) |
|
Definition at line 2155 of file cohomo.cc.
2158 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 1446 of file cohomo.cc.
1449 std::vector<std::vector<int> > bases;
1450 std::vector<int> fvars=
freevars(
num, bset, gset), base1;
1451 if (fvars.size()==0)
1454 bases.push_back(base1);
1458 for(
i=0;
i<fvars.size();
i++)
1462 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 1422 of file cohomo.cc.
1425 std::vector<std::vector<int> > goodset;
1427 std::vector<int> zset=
fvarsvalue(vnum, fvars);
1429 oset.push_back(vnum);
1431 oset=goodset[goodset.size()-1];
1432 goodset.erase(goodset.end());
◆ p_a()
Definition at line 1574 of file cohomo.cc.
1580 std::vector<int> as;
1581 std::vector<std::vector<int> > hvs=
supports(
h);
◆ p_b()
ideal p_b |
( |
ideal |
h, |
|
|
poly |
a |
|
) |
| |
Definition at line 1691 of file cohomo.cc.
1693 std::vector<std::vector<int> > pbv,lk=
links(a,
h),
res;
1694 std::vector<int> vert=
vertset(lk), bv;
1699 for(
i=0;
i<
res.size();
i++)
1702 pbv.push_back(
res[
i]);
◆ p_change()
std::vector<std::vector<int> > p_change |
( |
ideal |
Sigma | ) |
|
◆ p_constant()
std::vector<std::vector<int> > p_constant |
( |
ideal |
Xo, |
|
|
ideal |
Sigma |
|
) |
| |
◆ p_Ifsfree()
◆ p_new()
std::vector<std::vector<int> > p_new |
( |
ideal |
Xo, |
|
|
ideal |
Sigma |
|
) |
| |
Definition at line 3817 of file cohomo.cc.
3835 fvs=
triface(Sigma->m[0], vert);
3839 fvs=
tetraface(Sigma->m[0], Sigma->m[1], vert);
3843 fvs=
penface(Sigma->m[0], Sigma->m[1], Sigma->m[2], vert);
◆ p_New()
Definition at line 4952 of file cohomo.cc.
4957 ideal h1= (ideal)
h->Data();
4961 ideal h2= (ideal)
h->Data();
◆ pa()
Definition at line 4346 of file cohomo.cc.
4351 ideal h1= (ideal)
h->Data();
◆ pb()
Definition at line 4373 of file cohomo.cc.
4378 ideal h1= (ideal)
h->Data();
4382 poly
p= (poly)
h->Data();
◆ pChange()
Definition at line 4938 of file cohomo.cc.
4943 ideal h1= (ideal)
h->Data();
◆ pcoef()
int pcoef |
( |
poly |
p, |
|
|
int |
m |
|
) |
| |
◆ pConstant()
Definition at line 4921 of file cohomo.cc.
4926 ideal h1= (ideal)
h->Data();
4930 ideal h2= (ideal)
h->Data();
◆ penface()
std::vector<std::vector<int> > penface |
( |
poly |
p, |
|
|
poly |
q, |
|
|
poly |
g, |
|
|
int |
vert |
|
) |
| |
Definition at line 3651 of file cohomo.cc.
3654 std::vector<int> ev1=
commonedge(
p, q), ev2=
commonedge(
p,
g), ev3=
commonedge(q,
g), ind,
vec, fv1=
support1(
p), fv2=
support1(q), fv3=
support1(
g);
3655 std::vector<std::vector<int> > fvs1, fvs2, fvs3, fvs, evec;
3656 evec.push_back(ev1);
3657 evec.push_back(ev2);
3658 evec.push_back(ev3);
3659 for(
i=0;
i<evec.size();
i++)
3661 if(evec[
i].
size()==2)
3668 vec.push_back(vert);
3678 for(
i=0;
i<evec.size();
i++)
3680 if(evec[
i].
size()==2)
3685 for(
i=0;
i<fvs3.size();
i++)
3688 vec.push_back(vert);
◆ phi1()
std::vector<std::vector<int> > phi1 |
( |
poly |
a, |
|
|
ideal |
Sigma |
|
) |
| |
Definition at line 3890 of file cohomo.cc.
3894 for(
int i=0;
i<ss.size();
i++)
3897 if(
intvec.size()==av.size())
◆ phi2()
std::vector<std::vector<int> > phi2 |
( |
poly |
a, |
|
|
ideal |
Xo, |
|
|
ideal |
Sigma, |
|
|
int |
vert |
|
) |
| |
Definition at line 3908 of file cohomo.cc.
3911 std::vector<std::vector<int> > ss=
p_new(Sigma, Xo), fvs;
3913 for(
int i=0;
i<ss.size();
i++)
3916 if(
intvec.size()==av.size())
◆ phimage()
std::vector<int> phimage |
( |
std::vector< int > |
pv, |
|
|
std::vector< int > |
av, |
|
|
std::vector< int > |
bv |
|
) |
| |
◆ phimagel()
std::vector<int> phimagel |
( |
std::vector< int > |
fv, |
|
|
std::vector< int > |
av, |
|
|
std::vector< int > |
bv |
|
) |
| |
Definition at line 3142 of file cohomo.cc.
3144 std::vector<int> nv;
◆ pMake()
poly pMake |
( |
std::vector< int > |
vbase | ) |
|
Definition at line 439 of file cohomo.cc.
441 int n=vbase.size(); poly
p,q=0;
◆ pMake3()
poly pMake3 |
( |
std::vector< int > |
vbase | ) |
|
Definition at line 1860 of file cohomo.cc.
1862 int n=vbase.size(),co=1;
1864 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 1945 of file cohomo.cc.
1948 std::vector<poly> h1;
1950 for(
int i=0;
i<n;
i++)
◆ pMaken()
poly pMaken |
( |
std::vector< int > |
vbase | ) |
|
◆ psMinusp()
Definition at line 5003 of file cohomo.cc.
5008 ideal h1= (ideal)
h->Data();
5012 poly
p= (poly)
h->Data();
◆ psubset()
◆ pvert()
◆ qringadd()
ideal qringadd |
( |
ideal |
h1, |
|
|
ideal |
h2, |
|
|
int |
deg |
|
) |
| |
◆ redefinedeg()
int redefinedeg |
( |
poly |
p, |
|
|
int |
num |
|
) |
| |
◆ sfreemon()
ideal sfreemon |
( |
ideal |
h, |
|
|
int |
deg |
|
) |
| |
◆ sgp()
Definition at line 4490 of file cohomo.cc.
4495 ideal h1= (ideal)
h->Data();
4499 poly
p= (poly)
h->Data();
4503 poly q= (poly)
h->Data();
◆ sgpl()
Definition at line 4513 of file cohomo.cc.
4518 ideal h1= (ideal)
h->Data();
4522 poly
p= (poly)
h->Data();
4526 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 1247 of file cohomo.cc.
1250 std::vector<int> yaya;
1251 std::vector<std::vector<int> > pre=eqs, ppre, re;
1254 re.push_back(eqs[0]);
1255 pre.erase(pre.begin());
1260 for(
i=1;
i<re.size();
i++)
1264 yaya=
eli1(re[
i],yaya);
1272 pre.erase(pre.begin());
◆ SRideal()
Definition at line 4205 of file cohomo.cc.
4210 ideal hh=(ideal)
h->Data();
◆ star()
std::vector<std::vector<int> > star |
( |
poly |
a, |
|
|
ideal |
h |
|
) |
| |
Definition at line 4065 of file cohomo.cc.
4068 std::vector<std::vector<int> > st,X=
supports(
h);
4070 for(
i=0;
i<X.size();
i++)
◆ stars()
Definition at line 5063 of file cohomo.cc.
5068 poly
p= (poly)
h->Data();
5072 ideal h1= (ideal)
h->Data();
◆ stellarremain()
Definition at line 5022 of file cohomo.cc.
5027 ideal h1= (ideal)
h->Data();
5031 poly
p= (poly)
h->Data();
5032 std::vector<std::vector<int> > st=
star(
p, h1);
5033 std::vector<std::vector<int> > hvs=
supports(h1);
5034 std::vector<std::vector<int> > re=
vsMinusvs(hvs, st);
◆ stellarsub()
std::vector<std::vector<int> > stellarsub |
( |
poly |
a, |
|
|
ideal |
h |
|
) |
| |
Definition at line 4097 of file cohomo.cc.
4113 vec_n.push_back(vert);
4114 for(
i=0;
i<lk.size();
i++)
4117 vecs_minus.push_back(
vec);
4118 for(
j=0;
j<bys.size();
j++)
4122 vecs_plus.push_back(
vec);
◆ stellarsubdivision()
Definition at line 5083 of file cohomo.cc.
5088 ideal h2= (ideal)
h->Data();
5092 poly
p= (poly)
h->Data();
◆ subspace1()
std::vector<int> subspace1 |
( |
std::vector< std::vector< int > > |
mv, |
|
|
std::vector< int > |
bv |
|
) |
| |
◆ 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 2328 of file cohomo.cc.
2331 std::vector<int> alset=
findalpha(mv,bv), subase;
2332 std::vector<std::vector<int> > subases;
2333 for(
i=0;
i<alset.size();
i++)
2336 subases.push_back(subase);
◆ subspacet1()
std::vector<int> subspacet1 |
( |
int |
num, |
|
|
std::vector< std::vector< int > > |
ntvs |
|
) |
| |
Definition at line 2298 of file cohomo.cc.
2300 int i,
j, t, n=ntvs.size();
2301 std::vector<int> subase;
2308 subase.push_back(1);
2312 subase.push_back(-1);
2316 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 2912 of file cohomo.cc.
2916 std::vector<std::vector<int> > subases;
2917 for(
i=0;
i<alset.size();
i++)
2920 subases.push_back(subase);
◆ support()
◆ support1()
std::vector<int> support1 |
( |
poly |
p | ) |
|
Definition at line 358 of file cohomo.cc.
361 std::vector<int> supset;
362 if(
p==0)
return supset;
◆ support2()
std::vector<int> support2 |
( |
poly |
p | ) |
|
Definition at line 399 of file cohomo.cc.
403 std::vector<int> supset;
◆ supports()
std::vector<std::vector<int> > supports |
( |
ideal |
h | ) |
|
Definition at line 379 of file cohomo.cc.
381 std::vector<std::vector<int> > vecs;
382 std::vector<int>
vec;
◆ supports2()
std::vector<std::vector<int> > supports2 |
( |
ideal |
h | ) |
|
Definition at line 423 of file cohomo.cc.
425 std::vector<std::vector<int> > vecs;
426 std::vector<int>
vec;
◆ T1()
Definition at line 2838 of file cohomo.cc.
2844 std::vector<std::vector<int> >
solve;
2866 Print(
"Finished %d!\n",mm);
◆ t1h()
Definition at line 4239 of file cohomo.cc.
4244 ideal hh=(ideal)
h->Data();
◆ 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);
◆ T_1h()
◆ tetraface()
std::vector<std::vector<int> > tetraface |
( |
poly |
p, |
|
|
poly |
q, |
|
|
int |
vert |
|
) |
| |
Definition at line 3608 of file cohomo.cc.
3612 std::vector<std::vector<int> > fvs1, fvs2, fvs;
3613 vec.push_back(vert);
3621 for(
i=0;
i<fvs2.size();
i++)
3624 vec.push_back(vert);
◆ TimeShow()
static void TimeShow |
( |
clock_t |
t_construct, |
|
|
clock_t |
t_solve, |
|
|
clock_t |
t_value, |
|
|
clock_t |
t_total |
|
) |
| |
|
static |
Definition at line 3193 of file cohomo.cc.
3195 Print(
"The time of value matching for first order deformation: %.2f sec ;\n", ((
double)
t_value)/CLOCKS_PER_SEC);
3196 Print(
"The total time of fpiece: %.2f sec ;\n", ((
double)
t_total)/CLOCKS_PER_SEC);
3197 Print(
"The time of equations construction for fpiece: %.2f sec ;\n", ((
double)
t_construct)/CLOCKS_PER_SEC);
3198 Print(
"The total time of equations solving for fpiece: %.2f sec ;\n", ((
double)
t_solve)/CLOCKS_PER_SEC);
3199 PrintS(
"__________________________________________________________\n");
◆ Tmat()
intvec* Tmat |
( |
std::vector< std::vector< int > > |
vecs | ) |
|
Definition at line 2672 of file cohomo.cc.
2678 int i,
j, a=vecs.size();
2685 int b=vecs[0].size();
◆ tNab()
bool tNab |
( |
std::vector< std::vector< int > > |
hvs, |
|
|
std::vector< int > |
pv, |
|
|
std::vector< std::vector< int > > |
bvs |
|
) |
| |
Definition at line 2572 of file cohomo.cc.
2574 std::vector<int> sv;
2575 if(bvs.size()<=1)
return false;
2576 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 2593 of file cohomo.cc.
2595 std::vector<int> pv,
vec;
2596 for(
int j=0;
j<nvs.size();
j++)
2599 if(
tNab(hvs, pv, bvs))
◆ tnabvl()
Definition at line 4758 of file cohomo.cc.
4763 ideal h1= (ideal)
h->Data();
4767 poly
p= (poly)
h->Data();
4771 poly q= (poly)
h->Data();
4773 std::vector<std::vector<int> > vecs=
supports(h1), sbv,tnbr;
4775 std::vector<std::vector<int> > nvs=
Nabv(vecs, pv, qv);
4778 std::vector<int> tnv =
tnab(vecs,nvs,sbv);
4779 for(
int i=0;
i<tnv.size();
i++)
4781 tnbr.push_back(nvs[tnv[
i]]);
◆ triangulations1()
ideal triangulations1 |
( |
ideal |
h, |
|
|
poly |
p, |
|
|
int |
vert |
|
) |
| |
◆ triangulations2()
ideal triangulations2 |
( |
ideal |
h, |
|
|
poly |
p, |
|
|
poly |
q, |
|
|
int |
vert |
|
) |
| |
◆ triangulations3()
ideal triangulations3 |
( |
ideal |
h, |
|
|
poly |
p, |
|
|
poly |
q, |
|
|
poly |
g, |
|
|
int |
vert |
|
) |
| |
Definition at line 3697 of file cohomo.cc.
3701 std::vector<std::vector<int> > vecs=
supports(
h), vs1, evec;
3702 evec.push_back(ev1);
3703 evec.push_back(ev2);
3704 evec.push_back(ev3);
3705 for(
i=0;
i<evec.size();
i++)
3707 if(evec[
i].
size()==2)
◆ triface()
std::vector<std::vector<int> > triface |
( |
poly |
p, |
|
|
int |
vert |
|
) |
| |
Definition at line 3506 of file cohomo.cc.
3510 std::vector<std::vector<int> > fvs0, fvs;
3511 vec.push_back(vert);
3515 for(
i=0;
i<fvs0.size();
i++)
3518 vec.push_back(vert);
◆ trisets()
Definition at line 3487 of file cohomo.cc.
3491 std::vector<int> pv;
◆ tsets()
Definition at line 4696 of file cohomo.cc.
4701 ideal h1= (ideal)
h->Data();
◆ v_minus()
std::vector<int> v_minus |
( |
std::vector< int > |
v1, |
|
|
std::vector< int > |
v2 |
|
) |
| |
Definition at line 4031 of file cohomo.cc.
4033 std::vector<int>
vec;
4034 for(
int i=0;
i<v1.size();
i++)
4036 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 1325 of file cohomo.cc.
1327 std::vector<int> badset=bset;
1328 int i,
j,
m, bl=bset.size(), gl=gset.size();
1334 if(gset[
j][0]==
m && !
IsinL(gset[
j][1],badset))
1336 badset.push_back(gset[
j][1]);
1337 gset.erase(gset.begin()+
j);
1342 else if(!
IsinL(gset[
j][0],badset) && gset[
j][1]==
m)
1344 badset.push_back(gset[
j][0]);
1345 gset.erase(gset.begin()+
j);
1350 else if(
IsinL(gset[
j][0],badset) &&
IsinL(gset[
j][1],badset))
1352 gset.erase(gset.begin()+
j);
1362 if(badset.size()==0) badset.push_back(0);
1363 gset.push_back(badset);
◆ valency()
int valency |
( |
ideal |
h, |
|
|
poly |
p |
|
) |
| |
◆ Valency()
Definition at line 4712 of file cohomo.cc.
4717 ideal h1= (ideal)
h->Data();
4721 poly
p= (poly)
h->Data();
◆ 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 2626 of file cohomo.cc.
2629 std::vector<int> pv,
base;
2630 std::vector<std::vector<int> > bases;
2631 for(
int t=0;t<vecs.size();t++)
2633 for(
int i=0;
i<mvs.size();
i++)
2636 for(
j=0;
j<nvs.size();
j++)
2640 base.push_back(vecs[t][
j]);
2649 if(
base.size()!=mvs.size())
2652 WerrorS(
"Errors in Equations solving (Values Finding)!");
2658 bases.push_back(
base);
◆ value1l()
std::vector<std::vector<int> > value1l |
( |
std::vector< std::vector< int > > |
mvs, |
|
|
std::vector< std::vector< int > > |
lks, |
|
|
std::vector< std::vector< int > > |
vecs, |
|
|
std::vector< int > |
av, |
|
|
std::vector< int > |
bv |
|
) |
| |
Definition at line 3154 of file cohomo.cc.
3157 std::vector<int> pv;
3158 std::vector<int>
base;
3159 std::vector<std::vector<int> > bases;
3160 for(
int t=0;t<vecs.size();t++)
3162 for(
int i=0;
i<mvs.size();
i++)
3165 for(
j=0;
j<lks.size();
j++)
3169 base.push_back(vecs[t][
j]);
break;
3174 if(
base.size()!=mvs.size())
3176 WerrorS(
"Errors in Values Finding(value1l)!");
3182 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 2933 of file cohomo.cc.
2936 std::vector<int> pv,qv,
base;
2937 std::vector<std::vector<int> > bases;
2944 for(
int t=0;t<vecs.size();t++)
2946 for(
int i=0;
i<mts.size();
i++)
2956 for(
j=0;
j<nts.size();
j++)
2960 if(
vEvl(pv,nvs[row])&&
vEvl(qv,nvs[col]))
2962 base.push_back(vecs[t][
j]);
break;
2964 else if(
vEvl(pv,nvs[col])&&
vEvl(qv,nvs[row]))
2966 base.push_back(-vecs[t][
j]);
break;
2969 if(
j==nts.size()) {
base.push_back(0);}
2972 if(
base.size()!=mts.size())
2974 WerrorS(
"Errors in Values Finding(value2)!");
2979 bases.push_back(
base);
◆ value2l()
std::vector<std::vector<int> > value2l |
( |
std::vector< std::vector< int > > |
mvs, |
|
|
std::vector< std::vector< int > > |
lks, |
|
|
std::vector< std::vector< int > > |
mts, |
|
|
std::vector< std::vector< int > > |
lkts, |
|
|
std::vector< std::vector< int > > |
vecs, |
|
|
std::vector< int > |
av, |
|
|
std::vector< int > |
bv |
|
) |
| |
Definition at line 3297 of file cohomo.cc.
3299 std::vector<int> pv,qv,
base;
3301 std::vector<std::vector<int> > bases;
3306 for(
int t=0;t<vecs.size();t++)
3308 for(
int i=0;
i<mts.size();
i++)
3318 for(
j=0;
j<lkts.size();
j++)
3322 if(
vEvl(pv,lks[row])&&
vEvl(qv,lks[col]))
3324 base.push_back(vecs[t][
j]);
break;
3326 else if(
vEvl(qv,lks[row])&&
vEvl(pv,lks[col]))
3328 base.push_back(-vecs[t][
j]);
break;
3337 if(
base.size()!=mts.size())
3339 WerrorS(
"Errors in Values Finding!");
3344 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 165 of file cohomo.cc.
168 std::vector<int> inte;
169 for(
i=0;
i<
p.size();
i++)
172 inte.push_back(
p[
i]);
◆ vecMinus()
std::vector<int> vecMinus |
( |
std::vector< int > |
vec1, |
|
|
std::vector< int > |
vec2 |
|
) |
| |
Definition at line 284 of file cohomo.cc.
286 std::vector<int>
vec;
287 for(
int i=0;
i<vec1.size();
i++)
291 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 270 of file cohomo.cc.
272 std::vector<int>
vec=vec1;
274 for(
i=0;
i<vec2.size();
i++)
277 vec.push_back(vec2[
i]);
◆ vertset()
std::vector<int> vertset |
( |
std::vector< std::vector< int > > |
vecs | ) |
|
Definition at line 1668 of file cohomo.cc.
1671 std::vector<int> vert;
1672 std::vector<std::vector<int> > vvs;
1675 for(
j=0;
j<vecs.size();
j++)
◆ vEv()
bool vEv |
( |
std::vector< int > |
vec1, |
|
|
std::vector< int > |
vec2 |
|
) |
| |
Definition at line 187 of file cohomo.cc.
189 int i,
j, lg1=vec1.size(),lg2=vec2.size();
196 for(
j=0;
j<vec1.size();
j++)
◆ vEvl()
bool vEvl |
( |
std::vector< int > |
vec1, |
|
|
std::vector< int > |
vec2 |
|
) |
| |
Definition at line 223 of file cohomo.cc.
225 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 526 of file cohomo.cc.
529 std::vector<int> vbase;
◆ vs_subsets()
std::vector<std::vector<int> > vs_subsets |
( |
std::vector< std::vector< int > > |
vs | ) |
|
Definition at line 3786 of file cohomo.cc.
3788 std::vector<std::vector<int> > sset, bv;
3789 for(
int i=0;
i<vs.size();
i++)
◆ vsIntersec()
Definition at line 4791 of file cohomo.cc.
4796 ideal h1= (ideal)
h->Data();
4800 ideal h2= (ideal)
h->Data();
◆ vsIntersection()
std::vector<std::vector<int> > vsIntersection |
( |
std::vector< std::vector< int > > |
vs1, |
|
|
std::vector< std::vector< int > > |
vs2 |
|
) |
| |
Definition at line 336 of file cohomo.cc.
339 std::vector<std::vector<int> > vs;
340 for(
i=0;
i<vs2.size();
i++)
344 vs.push_back(vs2[
i]);
◆ vsMake()
std::vector<std::vector<int> > vsMake |
( |
ideal |
h | ) |
|
Definition at line 546 of file cohomo.cc.
548 std::vector<int>
vec;
549 std::vector<std::vector<int> > vecs;
◆ vsMinusv()
std::vector<std::vector<int> > vsMinusv |
( |
std::vector< std::vector< int > > |
vecs, |
|
|
std::vector< int > |
vec |
|
) |
| |
Definition at line 302 of file cohomo.cc.
305 std::vector<std::vector<int> >
rem;
306 for(
i=0;
i<vecs.size();
i++)
310 rem.push_back(vecs[
i]);
◆ vsMinusvs()
std::vector<std::vector<int> > vsMinusvs |
( |
std::vector< std::vector< int > > |
vs1, |
|
|
std::vector< std::vector< int > > |
vs2 |
|
) |
| |
Definition at line 3774 of file cohomo.cc.
3777 std::vector<std::vector<int> > vs=vs1;
3778 for(
i=0;
i<vs2.size();
i++)
◆ vsubset()
bool vsubset |
( |
std::vector< int > |
vec1, |
|
|
std::vector< int > |
vec2 |
|
) |
| |
Definition at line 209 of file cohomo.cc.
212 if(vec1.size()>vec2.size())
214 for(
i=0;
i<vec1.size();
i++)
◆ vsUnion()
std::vector<std::vector<int> > vsUnion |
( |
std::vector< std::vector< int > > |
vs1, |
|
|
std::vector< std::vector< int > > |
vs2 |
|
) |
| |
Definition at line 317 of file cohomo.cc.
320 std::vector<std::vector<int> > vs=vs1;
321 for(
i=0;
i<vs2.size();
i++)
325 vs.push_back(vs2[
i]);
◆ t_begin
◆ t_construct
VAR clock_t t_construct =0 |
◆ t_mark
◆ t_solve
◆ t_start
◆ t_total
◆ t_value
BOOLEAN ifIsomorphism(leftv res, leftv args)
BOOLEAN sgpl(leftv res, leftv args)
BOOLEAN cNew(leftv res, leftv args)
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)
bool IsInX(poly p, ideal X)
std::vector< int > commonedge(poly p, poly q)
poly p_Subst(poly p, int n, poly e, const ring r)
std::vector< int > keeporder(std::vector< int > vec)
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)
BOOLEAN fgpl(leftv res, leftv args)
BOOLEAN eqsolve1(leftv res, leftv args)
std::vector< int > phimagel(std::vector< int > fv, std::vector< int > av, std::vector< int > bv)
BOOLEAN SRideal(leftv res, leftv args)
BOOLEAN t1h(leftv res, leftv args)
BOOLEAN idModulo(leftv res, leftv args)
void rChangeCurrRing(ring r)
std::vector< int > v_minus(std::vector< int > v1, std::vector< int > v2)
BOOLEAN nabvl(leftv res, leftv args)
ideal idMinusp(ideal I, poly p)
BOOLEAN iiMake_proc(idhdl pn, package pack, leftv sl)
#define pGetExp(p, i)
Exponent.
ideal idAdd(ideal h1, ideal h2)
h1 + h2
std::vector< std::vector< int > > boundary(poly a)
poly pMaken(std::vector< int > vbase)
std::vector< std::vector< int > > tetraface(poly p, poly q, int vert)
idhdl enterid(const char *s, int lev, int t, idhdl *root, BOOLEAN init, BOOLEAN search)
std::vector< std::vector< int > > p_new(ideal Xo, ideal Sigma)
BOOLEAN isSim(leftv res, leftv args)
intvec * Tmat(std::vector< std::vector< int > > vecs)
int ifIso(poly p, poly q, poly f, poly g, poly a, poly b)
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)
bool IsinL(int a, std::vector< int > vec)
ideal id_MaxIdeal(const ring r)
initialise the maximal ideal (at 0)
BOOLEAN stars(leftv res, leftv args)
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)
BOOLEAN pChange(leftv res, leftv args)
std::vector< int > vecUnion(std::vector< int > vec1, std::vector< int > vec2)
ideal triangulations1(ideal h, poly p, int vert)
intvec * gradedpiece1nl(ideal h, poly a, poly b, int set)
static poly pp_Mult_mm(poly p, poly m, const ring r)
int isoNum(poly p, ideal I, poly a, poly b)
const CanonicalForm CFMap CFMap & N
std::vector< int > makeequation(int i, int j, int t)
poly pMake3(std::vector< int > vbase)
std::vector< std::vector< int > > value2l(std::vector< std::vector< int > > mvs, std::vector< std::vector< int > > lks, std::vector< std::vector< int > > mts, std::vector< std::vector< int > > lkts, std::vector< std::vector< int > > vecs, std::vector< int > av, std::vector< int > bv)
BOOLEAN Links(leftv res, leftv args)
BOOLEAN Valency(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)
ideal p_b(ideal h, poly a)
Class used for (list of) interpreter objects.
intvec * dmat(poly a, poly b)
BOOLEAN p_New(leftv res, leftv args)
std::vector< std::vector< int > > vsIntersection(std::vector< std::vector< int > > vs1, std::vector< std::vector< int > > vs2)
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)
BOOLEAN pb(leftv res, leftv args)
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< int > > vsUnion(std::vector< std::vector< int > > vs1, std::vector< std::vector< int > > vs2)
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)
std::vector< std::vector< int > > gpl2(ideal h, poly a, poly b)
ring rDefault(const coeffs cf, int N, char **n, int ord_size, rRingOrder_t *ord, int *block0, int *block1, int **wvhdl, unsigned long bitmask)
BOOLEAN idminus(leftv res, leftv args)
ideal triangulations3(ideal h, poly p, poly q, poly g, int vert)
std::vector< std::vector< int > > phi2(poly a, ideal Xo, ideal Sigma, int vert)
std::vector< std::vector< int > > links(poly a, ideal h)
static short rVar(const ring r)
#define rVar(r) (r->N)
std::vector< std::vector< int > > star(poly a, ideal h)
std::vector< int > fvarsvalue(int vnum, std::vector< int > fvars)
BOOLEAN gd(leftv res, leftv args)
std::vector< std::vector< int > > p_constant(ideal Xo, ideal Sigma)
std::vector< std::vector< int > > penface(poly p, poly q, poly g, int vert)
void PrintS(const char *s)
BOOLEAN mabvl(leftv res, leftv args)
void firstorderdef_setup(SModulFunctions *p)
BOOLEAN support(leftv res, leftv args)
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)
std::vector< std::vector< int > > vsMinusvs(std::vector< std::vector< int > > vs1, std::vector< std::vector< int > > vs2)
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
BOOLEAN stellarremain(leftv res, leftv args)
ideal idMinus(ideal h1, ideal h2)
int num4dim(ideal h, int n)
BOOLEAN existsub(leftv res, leftv args)
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)
static void TimeShow(clock_t t_construct, clock_t t_solve, clock_t t_value, clock_t t_total)
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)
std::vector< std::vector< int > > vs_subsets(std::vector< std::vector< int > > vs)
BOOLEAN genstt(leftv res, leftv args)
std::vector< std::vector< int > > triface(poly p, int vert)
BOOLEAN tnabvl(leftv res, leftv args)
bool vsubset(std::vector< int > vec1, std::vector< int > vec2)
ideal complementsimplex(ideal h)
BOOLEAN nfaces2(leftv res, leftv args)
std::vector< int > support1(poly p)
std::vector< std::vector< int > > supports2(ideal h)
BOOLEAN nonf2f(leftv res, leftv args)
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< int > support2(poly p)
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)
intvec * edgemat(poly p, poly q)
BOOLEAN fgp(leftv res, leftv args)
#define pSetCoeff(p, n)
deletes old coeff before setting the new one
INST_VAR sleftv iiRETURNEXPR
std::vector< std::vector< int > > links_new(poly a, ideal Xo, ideal Sigma, int vert, int ord)
ideal idadda(ideal h1, ideal h2)
std::vector< int > vertset(std::vector< std::vector< int > > vecs)
ideal triangulations2(ideal h, poly p, poly q, int vert)
#define IMATELEM(M, I, J)
BOOLEAN bprime(leftv res, leftv args)
std::vector< std::vector< int > > value1l(std::vector< std::vector< int > > mvs, std::vector< std::vector< int > > lks, std::vector< std::vector< int > > vecs, std::vector< int > av, std::vector< int > bv)
bool vInvsl(std::vector< int > vec, std::vector< std::vector< int > > vecs)
BOOLEAN dimsim(leftv res, leftv args)
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)
BOOLEAN makeSimplex(leftv res, leftv args)
int valency(ideal h, poly p)
BOOLEAN vsIntersec(leftv res, leftv args)
BOOLEAN stellarsubdivision(leftv res, leftv args)
ideal idInit(int idsize, int rank)
initialise an ideal / module
void listsprint(std::vector< std::vector< int > > posMat)
BOOLEAN psMinusp(leftv res, leftv args)
bool solve(int **extmat, int nrows, int ncols)
std::vector< std::vector< int > > vsMinusv(std::vector< std::vector< int > > vecs, std::vector< int > vec)
std::vector< std::vector< int > > stellarsub(poly a, ideal h)
void WerrorS(const char *s)
#define pEqualPolys(p1, p2)
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< std::vector< int > > phi1(poly a, ideal Sigma)
BOOLEAN nfaces3(leftv res, leftv args)
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)
BOOLEAN nfaces1(leftv res, leftv args)
std::vector< std::vector< int > > gpl(ideal h, poly a, poly b)
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 ....
BOOLEAN pa(leftv res, leftv args)
bool condition2for2nv(std::vector< std::vector< int > > hvs, std::vector< int > pv, std::vector< int > qv, std::vector< int > fv)
int redefinedeg(poly p, int num)
const Variable & v
< [in] a sqrfree bivariate poly
BOOLEAN linkn(leftv res, leftv args)
std::vector< std::vector< int > > p_change(ideal Sigma)
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 c_New(ideal Io, ideal sig)
idhdl ggetid(const char *n)
const CanonicalForm int s
std::vector< int > vecbase1(int num, std::vector< int > oset)
std::vector< std::vector< int > > b_subsets(std::vector< int > vec)
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)
BOOLEAN newDegree(leftv res, leftv args)
BOOLEAN pConstant(leftv res, leftv args)
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
int existIn(poly b, ideal Xs)
std::vector< int > gdegree(poly a, poly b)
BOOLEAN isoNumber(leftv res, leftv args)
BOOLEAN nabtvl(leftv res, leftv args)
BOOLEAN comedg(leftv res, leftv args)
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)
void rem(unsigned long *a, unsigned long *q, unsigned long p, int °a, int degq)
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 tsets(leftv res, leftv args)
BOOLEAN fb(leftv res, leftv args)
std::vector< std::vector< int > > bsubsets_1(poly b)
intvec * gradedpiece2nl(ideal h, poly a, poly b)
BOOLEAN numdim(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)