/usr/include/libnormaliz/cone.h is in libnormaliz0-dev-common 3.1.1+ds-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 | /*
* Normaliz
* Copyright (C) 2007-2014 Winfried Bruns, Bogdan Ichim, Christof Soeger
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
* As an exception, when this program is distributed through (i) the App Store
* by Apple Inc.; (ii) the Mac App Store by Apple Inc.; or (iii) Google Play
* by Google Inc., then that store may impose any digital rights management,
* device limits and/or redistribution restrictions that are required by its
* terms of service.
*/
#ifndef CONE_H_
#define CONE_H_
#include <vector>
#include <map>
#include <utility> //for pair
//#include <boost/dynamic_bitset.hpp>
#include <libnormaliz/libnormaliz.h>
#include <libnormaliz/cone_property.h>
#include <libnormaliz/sublattice_representation.h>
#include <libnormaliz/matrix.h>
#include <libnormaliz/HilbertSeries.h>
namespace libnormaliz {
using std::vector;
using std::map;
using std::pair;
template<typename Integer> class Full_Cone;
//template<typename Integer> class Matrix;
// type for simplex, short in contrast to class Simplex
template<typename Integer> struct SHORTSIMPLEX {
vector<key_t> key; // full key of simplex
Integer height; // height of last vertex over opposite facet
Integer vol; // volume if computed, 0 else
vector<bool> Excluded; // for disjoint decomposition of cone
// true in position i indictate sthat the facet
// opposite of generator i must be excluded
};
template<typename Integer> struct STANLEYDATA {
vector<key_t> key;
Matrix<Integer> offsets;
};
template<typename Integer>
class Cone {
//---------------------------------------------------------------------------
// public methods
//---------------------------------------------------------------------------
public:
//---------------------------------------------------------------------------
// Constructors, they preprocess the input
//---------------------------------------------------------------------------
/* give up to 3 matrices as input
* the types must be pairwise different
*/
Cone(InputType type, const vector< vector<Integer> >& input_data);
Cone(InputType type1, const vector< vector<Integer> >& input_data1,
InputType type2, const vector< vector<Integer> >& input_data2);
Cone(InputType type1, const vector< vector<Integer> >& input_data1,
InputType type2, const vector< vector<Integer> >& input_data2,
InputType type3, const vector< vector<Integer> >& input_data3);
/* give multiple input */
Cone(const map< InputType , vector< vector<Integer> > >& multi_input_data);
//---------------------------------------------------------------------------
// Destructor
//---------------------------------------------------------------------------
~Cone();
//---------------------------------------------------------------------------
// give additional data
//---------------------------------------------------------------------------
/* Sets if the Cone prints verbose output.
* The default value for the Cone is the global verbose.
* returns the old value
*/
bool setVerbose (bool v);
void deactivateChangeOfPrecision();
//---------------------------------------------------------------------------
// make computations
//---------------------------------------------------------------------------
// return what was NOT computed
// ConeProperties compute(ComputationMode mode = Mode::hilbertBasisSeries); //default: everything
ConeProperties compute(ConeProperties ToCompute);
// special case for up to 3 CPs
ConeProperties compute(ConeProperty::Enum);
ConeProperties compute(ConeProperty::Enum, ConeProperty::Enum);
ConeProperties compute(ConeProperty::Enum, ConeProperty::Enum, ConeProperty::Enum);
//---------------------------------------------------------------------------
// check what is computed
//---------------------------------------------------------------------------
bool isComputed(ConeProperty::Enum prop) const;
//returns true, when ALL properties in CheckComputed are computed
bool isComputed(ConeProperties CheckComputed) const;
//---------------------------------------------------------------------------
// get the results, these methods will start a computation if necessary
// throws an NotComputableException if not succesful
//---------------------------------------------------------------------------
// dimension and rank invariants
size_t getEmbeddingDim() const { return dim; }; // is always known
size_t getRank(); // depends on ExtremeRays
Integer getIndex(); // depends on OriginalMonoidGenerators
Integer getUnitGroupIndex(); // ditto
// only for inhomogeneous case:
size_t getRecessionRank();
long getAffineDim();
size_t getModuleRank();
Cone<Integer>& getIntegerHullCone() const;
const Matrix<Integer>& getGeneratorsMatrix();
const vector< vector<Integer> >& getGenerators();
size_t getNrGenerators();
const Matrix<Integer>& getExtremeRaysMatrix();
const vector< vector<Integer> >& getExtremeRays();
size_t getNrExtremeRays();
const Matrix<Integer>& getVerticesOfPolyhedronMatrix();
const vector< vector<Integer> >& getVerticesOfPolyhedron();
size_t getNrVerticesOfPolyhedron();
const Matrix<Integer>& getSupportHyperplanesMatrix();
const vector< vector<Integer> >& getSupportHyperplanes();
size_t getNrSupportHyperplanes();
const Matrix<Integer>& getMaximalSubspaceMatrix();
const vector< vector<Integer> >& getMaximalSubspace();
size_t getDimMaximalSubspace();
// depends on the ConeProperty::s SupportHyperplanes and Sublattice
map< InputType, vector< vector<Integer> > > getConstraints();
const Matrix<Integer>& getExcludedFacesMatrix();
const vector< vector<Integer> >& getExcludedFaces();
size_t getNrExcludedFaces();
size_t getTriangulationSize();
Integer getTriangulationDetSum();
vector<Integer> getWitnessNotIntegrallyClosed();
const Matrix<Integer>& getHilbertBasisMatrix();
const vector< vector<Integer> >& getHilbertBasis();
size_t getNrHilbertBasis();
const Matrix<Integer>& getModuleGeneratorsOverOriginalMonoidMatrix();
const vector< vector<Integer> >& getModuleGeneratorsOverOriginalMonoid();
size_t getNrModuleGeneratorsOverOriginalMonoid();
const Matrix<Integer>& getModuleGeneratorsMatrix();
const vector< vector<Integer> >& getModuleGenerators();
size_t getNrModuleGenerators();
const Matrix<Integer>& getDeg1ElementsMatrix();
const vector< vector<Integer> >& getDeg1Elements();
size_t getNrDeg1Elements();
// the actual grading is Grading/GradingDenom
vector<Integer> getGrading();
Integer getGradingDenom();
vector<Integer> getDehomogenization();
vector<Integer> getClassGroup();
mpq_class getMultiplicity();
bool isPointed();
bool isInhomogeneous();
bool isDeg1ExtremeRays();
bool isDeg1HilbertBasis();
bool isIntegrallyClosed();
bool isReesPrimary();
Integer getReesPrimaryMultiplicity();
const Matrix<Integer>& getOriginalMonoidGeneratorsMatrix();
const vector< vector<Integer> >& getOriginalMonoidGenerators();
size_t getNrOriginalMonoidGenerators();
const Sublattice_Representation<Integer>& getSublattice();
const HilbertSeries& getHilbertSeries(); //general purpose object
// the following 2 methods give information about the last used triangulation
// if no triangulation was computed so far they return false
bool isTriangulationNested();
bool isTriangulationPartial();
const vector< pair<vector<key_t>, Integer> >& getTriangulation();
const vector< vector<bool> >& getOpenFacets();
const vector< pair<vector<key_t>, long> >& getInclusionExclusionData();
const list< STANLEYDATA<Integer> >& getStanleyDec();
//---------------------------------------------------------------------------
// private part
//---------------------------------------------------------------------------
private:
size_t dim;
Sublattice_Representation<Integer> BasisChange; //always use compose_basis_change() !
Sublattice_Representation<Integer> BasisChangePointed; // to the pointed cone
bool BC_set;
bool verbose;
ConeProperties is_Computed;
// Matrix<Integer> GeneratorsOfToricRing;
Matrix<Integer> OriginalMonoidGenerators;
Matrix<Integer> Generators;
Matrix<Integer> ExtremeRays;
vector<bool> ExtremeRaysIndicator;
Matrix<Integer> VerticesOfPolyhedron;
Matrix<Integer> SupportHyperplanes;
Matrix<Integer> ExcludedFaces;
Matrix<Integer> PreComputedSupportHyperplanes;
size_t TriangulationSize;
Integer TriangulationDetSum;
bool triangulation_is_nested;
bool triangulation_is_partial;
vector< pair<vector<key_t>, Integer> > Triangulation;
vector<vector<bool> > OpenFacets;
vector< pair<vector<key_t>, long> > InExData;
list< STANLEYDATA<Integer> > StanleyDec;
mpq_class multiplicity;
vector<Integer> WitnessNotIntegrallyClosed;
Matrix<Integer> HilbertBasis;
Matrix<Integer> BasisMaxSubspace;
Matrix<Integer> ModuleGeneratorsOverOriginalMonoid;
Matrix<Integer> Deg1Elements;
HilbertSeries HSeries;
vector<Integer> Grading;
vector<Integer> Dehomogenization;
Integer GradingDenom;
Integer index; // the internal index
Integer unit_group_index;
bool pointed;
bool inhomogeneous;
bool deg1_extreme_rays;
bool deg1_hilbert_basis;
bool integrally_closed;
bool rees_primary;
Integer ReesPrimaryMultiplicity;
int affine_dim; //dimension of polyhedron
size_t recession_rank; // rank of recession monoid
size_t module_rank; // for the inhomogeneous case
Matrix<Integer> ModuleGenerators;
vector<Integer> ClassGroup;
Matrix<Integer> WeightsGrad;
vector<bool> GradAbs;
bool no_lattice_restriction; // true if cine generators are known to be in the relevant lattice
bool normalization; // true if input type normalization is used
// if this is true we allow to change to a smaller integer type in the computation
bool change_integer_type;
Cone<Integer>* IntHullCone;
void compose_basis_change(const Sublattice_Representation<Integer>& SR); // composes SR
// main input processing
void process_multi_input(const map< InputType, vector< vector<Integer> > >& multi_input_data);
void prepare_input_lattice_ideal(map< InputType, vector< vector<Integer> > >& multi_input_data);
void prepare_input_constraints(const map< InputType, vector< vector<Integer> > >& multi_input_data,
Matrix<Integer>& equations, Matrix<Integer>& congruence, Matrix<Integer>& Inequalities);
void prepare_input_generators(map< InputType, vector< vector<Integer> > >& multi_input_data,
Matrix<Integer>& LatticeGenerators);
void homogenize_input(map< InputType, vector< vector<Integer> > >& multi_input_data);
void check_precomputed_support_hyperplanes();
void check_excluded_faces();
void setGrading (const vector<Integer>& lf);
void setWeights ();
void setDehomogenization (const vector<Integer>& lf);
void checkGrading();
void checkDehomogenization();
void check_vanishing_of_grading_and_dehom();
void process_lattice_data(const Matrix<Integer>& LatticeGenerators, Matrix<Integer>& Congruences, Matrix<Integer>& Equations);
Matrix<Integer> prepare_input_type_2(const vector< vector<Integer> >& Input);
Matrix<Integer> prepare_input_type_3(const vector< vector<Integer> >& Input);
void prepare_input_type_4(Matrix<Integer>& Inequalities);
/* only used by the constructors */
void initialize();
template<typename IntegerFC>
void compute_inner(ConeProperties& ToCompute);
/* compute the generators using the support hyperplanes */
void compute_generators();
template<typename IntegerFC>
void compute_generators_inner();
/* compute method for the dual_mode, used in compute(mode) */
void compute_dual(ConeProperties& ToCompute);
template<typename IntegerFC>
void compute_dual_inner(ConeProperties& ToCompute);
/* extract the data from Full_Cone, this may remove data from Full_Cone!*/
template<typename IntegerFC>
void extract_data(Full_Cone<IntegerFC>& FC);
/* set OriginalMonoidGenerators */
void set_original_monoid_generators(const Matrix<Integer>&);
/* set ExtremeRays, in inhomogeneous case also VerticesOfPolyhedron */
void set_extreme_rays(const vector<bool>&);
/* If the Hilbert basis and the original monoid generators are computed,
* use them to check whether the original monoid is integrally closed. */
void check_integrally_closed();
void compute_unit_group_index();
/* try to find a witness for not integrally closed in the Hilbert basis */
void find_witness();
Integer compute_primary_multiplicity();
template<typename IntegerFC>
Integer compute_primary_multiplicity_inner();
void compute_integer_hull();
};
// helpers
template<typename Integer>
vector<vector<Integer> > find_input_matrix(const map< InputType, vector< vector<Integer> > >& multi_input_data,
const InputType type);
template<typename Integer>
void insert_zero_column(vector< vector<Integer> >& mat, size_t col);
template<typename Integer>
void insert_column(vector< vector<Integer> >& mat, size_t col, Integer entry);
} //end namespace libnormaliz
#endif /* CONE_H_ */
|