Represents a JAS solvable polynomial ideal.
Methods for left, right two-sided Groebner basees and others.
|
|
__init__(self,
ring,
ringstr="",
list=None)
Constructor for an ideal in a solvable polynomial ring. |
source code
|
|
|
|
__str__(self)
Create a string representation. |
source code
|
|
|
|
|
|
|
isLeftGB(self)
Test if this is a left Groebner base. |
source code
|
|
|
|
twosidedGB(self)
Compute a two-sided Groebner base. |
source code
|
|
|
|
isTwosidedGB(self)
Test if this is a two-sided Groebner base. |
source code
|
|
|
|
rightGB(self)
Compute a right Groebner base. |
source code
|
|
|
|
isRightGB(self)
Test if this is a right Groebner base. |
source code
|
|
|
|
intersect(self,
ring)
Compute the intersection of this and the polynomial ring. |
source code
|
|
|
|
sum(self,
other)
Compute the sum of this and the other ideal. |
source code
|
|
|
|
parLeftGB(self,
th)
Compute a left Groebner base in parallel. |
source code
|
|
|
|
parTwosidedGB(self,
th)
Compute a two-sided Groebner base in parallel. |
source code
|
|