|
Frobby 0.10.0
|
#include <SliceFacade.h>


Public Member Functions | |
| SliceFacade (const SliceParams ¶ms, const DataType &output) | |
| SliceFacade (const SliceParams ¶ms, const BigIdeal &ideal, BigTermConsumer &consumer) | |
| SliceFacade (const SliceParams ¶ms, const BigIdeal &ideal, CoefBigTermConsumer &consumer) | |
| void | computeMultigradedHilbertSeries () |
| void | computeUnivariateHilbertSeries () |
| void | computeIrreducibleDecomposition (bool encode) |
| mpz_class | computeDimension (bool codimension=false) |
| void | computeDimension (mpz_class &dimension) |
| void | computePrimaryDecomposition () |
| void | computeMaximalStaircaseMonomials () |
| void | computeMaximalStandardMonomials () |
| void | computeAlexanderDual (const vector< mpz_class > &point) |
| void | computeAlexanderDual () |
| void | computeAssociatedPrimes () |
| bool | solveStandardProgram (const vector< mpz_class > &grading, mpz_class &value, bool reportAllSolutions) |
| bool | solveIrreducibleDecompositionProgram (const vector< mpz_class > &grading, mpz_class &optimalValue, bool reportAllSolutions) |
Additional Inherited Members | |
| Protected Member Functions inherited from Facade | |
| Facade (bool printActions) | |
| void | printMessage (const char *message) |
| void | beginAction (const char *message) |
| void | endAction () |
| bool | isPrintingActions () const |
A facade for operations on monomial ideals using the Slice Algorithm.
| void SliceFacade::computeAlexanderDual | ( | ) |
Compute the Alexander dual of the ideal. The point to dualize on is the least common multiple of the minimal generators of the ideal.
The output monomials are provided in arbitrary order.
| void SliceFacade::computeAlexanderDual | ( | const vector< mpz_class > & | point | ) |
Compute the Alexander dual of the ideal. The output monomials are provided in arbitrary order.
It is an error if any minimal generator of ideal does not divide point. It is acceptable for a non-minimal generator to not divide point.
| point | The point to dualize on. |
| void SliceFacade::computeAssociatedPrimes | ( | ) |
Compute the associated primes of the ideal. These are represented as generators of an ideal and are provided in arbitrary order.
| mpz_class SliceFacade::computeDimension | ( | bool | codimension = false | ) |
Compute the Krull dimension of ideal. By convention, this is -1 if ideal is generated by the identity. Compute the codimension if the codimension is true, which is the number of variables in the ambient ring minus the dimension.
| void SliceFacade::computeDimension | ( | mpz_class & | dimension | ) |
Compute the dimension of ideal. This is defined as the dimension of the zero set of the ideal. The ideal generated by the identity has the special property of having an empty zero set, and we define that to have dimension -1.
Nope, it is the Krull dimension. although that may be the same. Fix this doc.
why are there two dimension methods?
| void SliceFacade::computeIrreducibleDecomposition | ( | bool | encode | ) |
Compute the unique irredundant set of irreducible ideals whose intersection equals ideal.
If encode is false, then each irreducible component is output as a separate ideal, which is only supported when writing to a file. If encode is true, then each irreducible component is provided as a term, where missing pure powers are encoded as a zero exponent.
The irreducible components are provided in arbitrary order.
| encode | Specifies whether to encode the irreducible component as monomials. |
| void SliceFacade::computeMaximalStaircaseMonomials | ( | ) |
Compute the maximal staircase monomials of the ideal. A monomial m is a staircase monomial if it belongs to the ideal, while the monomial m : (x_1 ... x_n) does not. A monomial m is a maximal staircase monomial if m is a staircase monomial and m * x_i is not for every variable x_i.
The output monomials are provided in arbitrary order.
| void SliceFacade::computeMaximalStandardMonomials | ( | ) |
Compute the maximal standard monomials of the ideal. A monomial m is a standard monomial if it does not belong to the ideal. A monomial m is a maximal standard monomial if it is standard and m * x_i is not standard for every variable x_i. The output monomials are provided in arbitrary order.
| void SliceFacade::computeMultigradedHilbertSeries | ( | ) |
Compute the numerator of the multigraded Hilbert-Poincare series.
This series is the sum of all monomials not in the ideal.
The multigraded Hilbert-Poincare series can be written as a single fraction with a polynomial as the numerator and the product of (1-x) as the denominator where x varies over all the variable in the ambient ring. It is this numerator that is computed.
| void SliceFacade::computePrimaryDecomposition | ( | ) |
Compute the unique "nicest" primary decomposition of the ideal.
This is defined as the primary decomposition where each primary component is the intersection of the irreducible components with that same support.
Each primary component is provided as a separate ideal in arbitrary order.
| void SliceFacade::computeUnivariateHilbertSeries | ( | ) |
Compute the numerator of the univariate Hilbert-Poincare series.
This is defined as the multivariate Hilbert-Poincare series where every variable has been substituted with the same single variable t. See the documentation for computeMultigradedHilbertSeries() for more information.
The terms of the output polynomial are provided in ascending order according to exponent.
| bool SliceFacade::solveIrreducibleDecompositionProgram | ( | const vector< mpz_class > & | grading, |
| mpz_class & | optimalValue, | ||
| bool | reportAllSolutions ) |
Solve an optimization program over irreducible components. The optimization program being solved is
maximize 
v encoding an irreducible component of the ideal.
| grading | The vector to optimize. |
| optimalValue | Will be set to the value of the program, if any. |
| reportAllSolutions | Output all optimal solutions if true, otherwise report some single optimal solution if there is one. |
| bool SliceFacade::solveStandardProgram | ( | const vector< mpz_class > & | grading, |
| mpz_class & | value, | ||
| bool | reportAllSolutions ) |
Solve an optimization program over maximal standard monomials. The optimization program being solved is
maximize 

| grading | The vector to optimize. |
| value | Will be set to the value of the program, if any. |
| reportAllSolutions | Output all optimal solutions if true, otherwise report some optimal solution if there are any. |