![]() |
My Project
UNKNOWN_GIT_VERSION
|
#include "kernel/mod2.h"
#include "omalloc/omalloc.h"
#include "misc/mylimits.h"
#include "libpolys/misc/intvec.h"
#include <assert.h>
#include <unistd.h>
#include "kernel/combinatorics/hilb.h"
#include "kernel/combinatorics/stairc.h"
#include "kernel/combinatorics/hutil.h"
#include "cohomo.h"
#include "kernel/GBEngine/tgb.h"
#include "Singular/ipid.h"
#include "polys/monomials/ring.h"
#include "polys/monomials/p_polys.h"
#include "polys/simpleideals.h"
#include "Singular/lists.h"
#include "kernel/linear_algebra/linearAlgebra.h"
#include "kernel/GBEngine/kstd1.h"
#include <kernel/ideals.h>
#include <libpolys/polys/ext_fields/transext.h>
#include <libpolys/coeffs/coeffs.h>
#include <coeffs/numbers.h>
#include <vector>
#include <Singular/ipshell.h>
#include <Singular/libsingular.h>
Go to the source code of this file.
Functions | |
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) |
int SI_MOD_INIT() cohomo | ( | SModulFunctions * | p | ) |
ideal complementsimplex | ( | ideal | h | ) |
Definition at line 409 of file cohomo.cc.
bool condition1for2 | ( | std::vector< int > | pv, |
std::vector< int > | qv, | ||
std::vector< int > | bv | ||
) |
Definition at line 1607 of file cohomo.cc.
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 | ||
) |
Definition at line 1622 of file cohomo.cc.
bool condition2for2nv | ( | std::vector< std::vector< int > > | hvs, |
std::vector< int > | pv, | ||
std::vector< int > | qv, | ||
std::vector< int > | fv | ||
) |
Definition at line 2510 of file cohomo.cc.
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.
intvec* dmat | ( | poly | a, |
poly | b | ||
) |
Definition at line 2946 of file cohomo.cc.
std::vector<int> eli1 | ( | std::vector< int > | eq1, |
std::vector< int > | eq2 | ||
) |
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.
void equmab | ( | int | num | ) |
Definition at line 1386 of file cohomo.cc.
Definition at line 3007 of file cohomo.cc.
Definition at line 2993 of file cohomo.cc.
ideal finda | ( | ideal | h, |
poly | S, | ||
int | ddeg | ||
) |
Definition at line 676 of file cohomo.cc.
std::vector<int> findalpha | ( | std::vector< std::vector< int > > | mv, |
std::vector< int > | bv | ||
) |
std::vector<int> findalphan | ( | std::vector< std::vector< int > > | N, |
std::vector< int > | tN | ||
) |
ideal findb | ( | ideal | h | ) |
Definition at line 645 of file cohomo.cc.
void firstorderdef_setup | ( | SModulFunctions * | p | ) |
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 | ||
) |
Definition at line 2974 of file cohomo.cc.
std::vector<int> gdegree | ( | poly | a, |
poly | b | ||
) |
Definition at line 2860 of file cohomo.cc.
std::vector<int> gensindex | ( | ideal | M, |
ideal | ids | ||
) |
Definition at line 2292 of file cohomo.cc.
ideal genst | ( | ideal | h, |
poly | a, | ||
poly | b | ||
) |
Definition at line 2637 of file cohomo.cc.
Definition at line 3054 of file cohomo.cc.
ideal getpresolve | ( | ideal | h | ) |
std::vector<std::vector<int> > getvector | ( | ideal | h, |
int | n | ||
) |
Definition at line 1745 of file cohomo.cc.
void gradedpiece1 | ( | ideal | h, |
poly | a, | ||
poly | b | ||
) |
Definition at line 1523 of file cohomo.cc.
intvec* gradedpiece1n | ( | ideal | h, |
poly | a, | ||
poly | b | ||
) |
Definition at line 2359 of file cohomo.cc.
void gradedpiece2 | ( | ideal | h, |
poly | a, | ||
poly | b | ||
) |
Definition at line 1922 of file cohomo.cc.
intvec* gradedpiece2n | ( | ideal | h, |
poly | a, | ||
poly | b | ||
) |
Definition at line 2663 of file cohomo.cc.
ideal id_sfmon | ( | ) |
Definition at line 239 of file cohomo.cc.
Definition at line 2908 of file cohomo.cc.
ideal idMake | ( | std::vector< std::vector< int > > | vecs | ) |
Definition at line 1094 of file cohomo.cc.
ideal idMake3 | ( | std::vector< std::vector< int > > | vecs | ) |
Definition at line 1362 of file cohomo.cc.
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.
ideal idMaken | ( | std::vector< std::vector< int > > | vecs | ) |
Definition at line 1452 of file cohomo.cc.
ideal idMinus | ( | ideal | h1, |
ideal | h2 | ||
) |
Definition at line 167 of file cohomo.cc.
ideal idmodulo | ( | ideal | h1, |
ideal | h2 | ||
) |
Definition at line 1113 of file cohomo.cc.
Definition at line 2923 of file cohomo.cc.
ideal idsrRing | ( | ideal | h | ) |
Definition at line 312 of file cohomo.cc.
bool IsinL | ( | int | a, |
std::vector< int > | badset | ||
) |
bool IsSimplex | ( | ideal | h | ) |
Definition at line 379 of file cohomo.cc.
std::vector<std::vector<int> > links | ( | poly | a, |
ideal | h | ||
) |
Definition at line 1215 of file cohomo.cc.
Definition at line 3100 of file cohomo.cc.
std::vector<std::vector<int> > listsinsertlist | ( | std::vector< std::vector< int > > | gset, |
int | a, | ||
int | b | ||
) |
void listsprint | ( | std::vector< std::vector< int > > | posMat | ) |
bool mabconditionv | ( | std::vector< std::vector< int > > | hvs, |
std::vector< int > | pv, | ||
std::vector< int > | av, | ||
std::vector< int > | bv | ||
) |
Definition at line 716 of file cohomo.cc.
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.
std::vector<std::vector<int> > Mabv | ( | ideal | h, |
poly | a, | ||
poly | b | ||
) |
Definition at line 732 of file cohomo.cc.
std::vector<int> make0 | ( | int | n | ) |
std::vector<int> make1 | ( | int | n | ) |
ideal mingens | ( | ideal | h, |
poly | a, | ||
poly | b | ||
) |
Definition at line 2311 of file cohomo.cc.
std::vector<std::vector<int> > minisolve | ( | std::vector< std::vector< int > > | solve, |
std::vector< int > | index | ||
) |
bool nabconditionv | ( | std::vector< std::vector< int > > | hvs, |
std::vector< int > | pv, | ||
std::vector< int > | av, | ||
std::vector< int > | bv | ||
) |
Definition at line 2055 of file cohomo.cc.
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.
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.
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.
std::vector<int> numfree | ( | ideal | h | ) |
Definition at line 1698 of file cohomo.cc.
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.
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.
bool p_Ifsfree | ( | poly | P | ) |
Definition at line 195 of file cohomo.cc.
int pcoef | ( | poly | p, |
int | m | ||
) |
Definition at line 1124 of file cohomo.cc.
std::vector<int> phimage | ( | std::vector< int > | pv, |
std::vector< int > | av, | ||
std::vector< int > | bv | ||
) |
Definition at line 2186 of file cohomo.cc.
std::vector<poly> pMakei | ( | std::vector< std::vector< int > > | mv, |
std::vector< int > | vbase | ||
) |
poly pMaken | ( | std::vector< int > | vbase | ) |
Definition at line 1434 of file cohomo.cc.
ideal psubset | ( | poly | p | ) |
Definition at line 1282 of file cohomo.cc.
ideal sfreemon | ( | ideal | h, |
int | deg | ||
) |
Definition at line 210 of file cohomo.cc.
ideal SimFacset | ( | poly | p | ) |
Definition at line 355 of file cohomo.cc.
std::vector<std::vector<int> > soleli1 | ( | std::vector< std::vector< int > > | eqs | ) |
Definition at line 795 of file cohomo.cc.
std::vector<int> subspace1 | ( | std::vector< std::vector< int > > | mv, |
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 | ||
) |
Definition at line 1877 of file cohomo.cc.
std::vector<int> subspacet1 | ( | int | num, |
std::vector< std::vector< int > > | ntvs | ||
) |
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.
std::vector<int> support1 | ( | poly | p | ) |
Definition at line 608 of file cohomo.cc.
void T1 | ( | ideal | h | ) |
Definition at line 2473 of file cohomo.cc.
void T2 | ( | ideal | h | ) |
Definition at line 2754 of file cohomo.cc.
intvec* Tmat | ( | std::vector< std::vector< int > > | vecs | ) |
Definition at line 2235 of file cohomo.cc.
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.
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.
std::vector<int> v_minus | ( | std::vector< int > | v1, |
std::vector< int > | v2 | ||
) |
std::vector<std::vector<int> > vAbsorb | ( | std::vector< int > | bset, |
std::vector< std::vector< int > > | gset | ||
) |
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.
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.
std::vector<int> vecbase1 | ( | int | num, |
std::vector< int > | oset | ||
) |
std::vector<int> vecIntersection | ( | std::vector< int > | p, |
std::vector< int > | q | ||
) |
std::vector<int> vecMinus | ( | std::vector< int > | vec1, |
std::vector< int > | vec2 | ||
) |
std::vector<std::vector<int> > vecqring | ( | std::vector< std::vector< int > > | vec1, |
std::vector< std::vector< int > > | vec2 | ||
) |
std::vector<int> vecUnion | ( | std::vector< int > | vec1, |
std::vector< int > | vec2 | ||
) |
bool vEv | ( | std::vector< int > | vec1, |
std::vector< int > | vec2 | ||
) |
bool vEvl | ( | std::vector< int > | vec1, |
std::vector< int > | vec2 | ||
) |
bool vInp | ( | int | m, |
poly | p | ||
) |
Definition at line 1143 of file cohomo.cc.
int vInvs | ( | std::vector< int > | vec, |
std::vector< std::vector< int > > | vecs | ||
) |
bool vInvsl | ( | std::vector< int > | vec, |
std::vector< std::vector< int > > | vecs | ||
) |
std::vector<int> vMake | ( | poly | p | ) |
Definition at line 1161 of file cohomo.cc.