Represents a JAS polynomial ideal with polynomial coefficients.
Methods to compute comprehensive Groebner bases.
|
__init__(self,
ring,
polystr="",
list=None,
gbsys=None)
Parametric ideal constructor. |
source code
|
|
|
__str__(self)
Create a string representation. |
source code
|
|
|
optimizeCoeff(self)
Optimize the term order on the variables of the coefficients. |
source code
|
|
|
optimizeCoeffQuot(self)
Optimize the term order on the variables of the quotient
coefficients. |
source code
|
|
|
toIntegralCoeff(self)
Convert rational function coefficients to integral function
coefficients. |
source code
|
|
|
toModularCoeff(self,
mf)
Convert integral function coefficients to modular function
coefficients. |
source code
|
|
|
toQuotientCoeff(self)
Convert integral function coefficients to rational function
coefficients. |
source code
|
|
|
|
|
isGB(self)
Test if this is a Groebner base. |
source code
|
|
|
CGB(self)
Compute a comprehensive Groebner base. |
source code
|
|
|
CGBsystem(self)
Compute a comprehensive Groebner system. |
source code
|
|
|
isCGB(self)
Test if this is a comprehensive Groebner base. |
source code
|
|
|
isCGBsystem(self)
Test if this is a comprehensive Groebner system. |
source code
|
|
|
regularRepresentation(self)
Convert Groebner system to a representation with regular ring
coefficents. |
source code
|
|
|
regularRepresentationBC(self)
Convert Groebner system to a boolean closed representation with
regular ring coefficents. |
source code
|
|
|
regularGB(self)
Compute a Groebner base over a regular ring. |
source code
|
|
|
isRegularGB(self)
Test if this is Groebner base over a regular ring. |
source code
|
|
|
stringSlice(self)
Get each component (slice) of regular ring coefficients separate. |
source code
|
|