Frobby 0.10.0
Loading...
Searching...
No Matches
IdealFacade Class Reference

#include <IdealFacade.h>

Inheritance diagram for IdealFacade:
Collaboration diagram for IdealFacade:

Public Member Functions

 IdealFacade (bool printActions)
void deform (BigIdeal &ideal)
void takeRadical (BigIdeal &ideal)
void swap01 (BigIdeal &ideal)
mpz_class computeDimension (const BigIdeal &ideal, bool codimension=false, bool squareFreeAndMinimal=false)
void takeProducts (const vector< BigIdeal * > &ideals, BigIdeal &ideal)
void sortAllAndMinimize (BigIdeal &bigIdeal)
void projectVar (BigIdeal &bigIdeal, size_t var)
void trimVariables (const vector< BigIdeal * > &ideals, VarNames &names)
void addPurePowers (BigIdeal &bigIdeal)
void sortGeneratorsUnique (BigIdeal &ideal)
void sortGenerators (BigIdeal &ideal)
void sortVariables (BigIdeal &ideal)
void printAnalysis (FILE *out, BigIdeal &ideal)
void printLcm (BigIdeal &ideal, IOHandler *handler, FILE *out)

Detailed Description

A facade for performing operations on BigIdeal. These operations should not fit somewhere else, such as on SliceFacade.

Member Function Documentation

◆ addPurePowers()

void IdealFacade::addPurePowers ( BigIdeal & bigIdeal)

Adds x_i^(l_i+1) to the ideal for each i where that will be a minimal generator, where x^l is the lcm of the generators of bigIdeal.

◆ computeDimension()

mpz_class IdealFacade::computeDimension ( const BigIdeal & ideal,
bool codimension = false,
bool squareFreeAndMinimal = false )

Compute the Krull dimension of ideal. By convention, this is -1 if ideal is generated by the identity. The algorithm is lifted from Macaulay 2.

Parameters
squareFreeAndMinimalIf true, then ideal must be square free and minimally generated. This can speed up the computation, but will result in undefined behavior if it is not true.
codimensionIf true, return the codimension instead.

◆ deform()

void IdealFacade::deform ( BigIdeal & ideal)

Applies some generic deformation to the ideal.

◆ printAnalysis()

void IdealFacade::printAnalysis ( FILE * out,
BigIdeal & ideal )
Todo
: describe.

◆ printLcm()

void IdealFacade::printLcm ( BigIdeal & ideal,
IOHandler * handler,
FILE * out )
Todo
: describe.

◆ projectVar()

void IdealFacade::projectVar ( BigIdeal & bigIdeal,
size_t var )

Remove the variable var from the ideal and ring by substituting it by 1

◆ sortAllAndMinimize()

void IdealFacade::sortAllAndMinimize ( BigIdeal & bigIdeal)

Remove redundant generators from ideal.

◆ sortGenerators()

void IdealFacade::sortGenerators ( BigIdeal & ideal)

Sorts the generators of ideal.

◆ sortGeneratorsUnique()

void IdealFacade::sortGeneratorsUnique ( BigIdeal & ideal)

Sorts the generators of ideal and removes duplicates.

◆ sortVariables()

void IdealFacade::sortVariables ( BigIdeal & ideal)

Sorts the variables of ideal.

◆ swap01()

void IdealFacade::swap01 ( BigIdeal & ideal)

Change all 0 exponents to 1 and vice versa.

◆ takeProducts()

void IdealFacade::takeProducts ( const vector< BigIdeal * > & ideals,
BigIdeal & ideal )

Take the product of the minimal generators of each ideal, and add the resulting monomials as generators of ideal. Requires that each ideal have the same names, including ideal.

◆ takeRadical()

void IdealFacade::takeRadical ( BigIdeal & ideal)

Takes the radical of the generators of ideal. Non-minimal generators that may appear due to this are not removed.

◆ trimVariables()

void IdealFacade::trimVariables ( const vector< BigIdeal * > & ideals,
VarNames & names )

Remove those variables that do not appear in any generator.


The documentation for this class was generated from the following files: