Represents a JAS sub-module over a solvable polynomial ring.
Methods to compute left, right and two-sided Groebner bases.
|
|
__init__(self,
module,
modstr="",
list=None)
Constructor for sub-module over 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
|
|
|
|
isLeftSyzygy(self,
g)
Test if this is a syzygy of the vectors in g. |
source code
|
|
|
|
leftSyzygy(self)
Compute left syzygys of this module. |
source code
|
|
|
|
isRightSyzygy(self,
g)
Test if this is a syzygy of the vectors in g. |
source code
|
|
|
|
rightSyzygy(self)
Compute right syzygys of this module. |
source code
|
|