15
15
IntegerMatrix vertices;
16
16
map<IntegerVector,int> indexMap;
18
IntegerVector dimensionsAtInfinity()const;
19
class Cone : public set<int>
22
bool isKnownToBeNonMaximalFlag;
23
// bool ignoreSymmetry; //useful when computing faces and extracting symmetries
25
vector<int> indices;//always sorted
26
Cone(set<int> const &indices_, int dimension_, int multiplicity_, bool sortWithSymmetry, SymmetricComplex const &complex);
27
set<int> indexSet()const;
30
bool isKnownToBeNonMaximal()const{return isKnownToBeNonMaximalFlag;}
31
void setKnownToBeNonMaximal(){isKnownToBeNonMaximalFlag=true;}
24
32
bool isSubsetOf(Cone const &c)const;
25
SymmetricComplex::Cone permuted(IntegerVector const &permutation, SymmetricComplex const &complex)const;
33
SymmetricComplex::Cone permuted(IntegerVector const &permutation, SymmetricComplex const &complex, bool withSymmetry)const;
34
// bool operator<(Cone const & b)const;
35
/* IntegerVector relativeInteriorPoint;
36
IntegerVector smallestRepresentative;
37
IntegerVector summary;*/
38
IntegerVector sortKey;
39
IntegerVector sortKeyPermutation;
40
// void computeRelativeInteriorPoint(SymmetricComplex const &complex);
41
// void computeSmallestRepresentative(SymmetricComplex const &complex);
42
bool operator<(const Cone & b)const;
43
// void setIgnoreSymmetry(bool b){ignoreSymmetry=b;}
44
bool isSimplicial(int linealityDim)const;
45
void remap(SymmetricComplex &complex);
47
* This routine computes a basis for the orthogonal complement of the cone.
48
* Notice that the lineality space, which is unknown at the time, is ignored.
49
* This routine is deterministic and used for orienting the faces when computing homology.
51
IntegerVectorList orthogonalComplement(SymmetricComplex &complex)const;
53
typedef set<Cone> ConeContainer;
28
56
SymmetricComplex(int n_, IntegerVectorList const &v, SymmetryGroup const &sym_);
58
* Returns a reference to the matrix of vertices on which the complex is build.
59
* The reference is valid as the Symmetric complex object exists.
61
IntegerMatrix const &getVertices()const{return vertices;}
29
62
bool contains(Cone const &c)const;
30
63
void insert(Cone const &c);
31
64
int getMaxDim()const;
32
65
int getMinDim()const;
33
66
bool isMaximal(Cone const &c)const;
34
67
bool isPure()const;
35
IntegerVector fvector()const;
36
string toString(int dimLow, int dimHigh, bool onlyMaximal, bool group, ostream *multiplicities=0)const;
68
IntegerVector fvector(bool boundedPart=false)const;
69
string toString(int dimLow, int dimHigh, bool onlyMaximal, bool group, ostream *multiplicities=0, bool compressed=false, bool tPlaneSort=false, bool xml=false)const;
70
bool isSimplicial()const;
72
Calling this function will change the representative of each cone
73
orbit by "applying" the permutation which will give the sortkey to
74
the set of indices of the cone.
78
* Looks up the index of the vector among the vertices.
80
int indexOfVertex(IntegerVector const &v)const;
81
int numberOfConesOfDimension(int d)const;
83
* Given a cone this returns its index among all cones of that dimension.
84
* Used for assigning "names" to cones.
86
int dimensionIndex(Cone const &c);
88
* This routine is used for constructing the boundary map for homology computations.
90
void boundary(Cone const &c, vector<int> &indices, vector<int> &signs);
92
* This routine computes the ith boundary map for homology as a matrix.
94
IntegerMatrix boundaryMap(int i);