C - coefficient typepublic interface SolvableSyzygy<C extends RingElem<C>> extends java.io.Serializable
| Modifier and Type | Method and Description |
|---|---|
boolean |
isLeftOreCond(GenSolvablePolynomial<C> a,
GenSolvablePolynomial<C> b,
GenSolvablePolynomial<C>[] oc)
Test left Ore condition.
|
boolean |
isLeftZeroRelation(java.util.List<java.util.List<GenSolvablePolynomial<C>>> Z,
java.util.List<GenSolvablePolynomial<C>> F)
Test if left syzygy.
|
boolean |
isLeftZeroRelation(ModuleList<C> Z,
ModuleList<C> F)
Test if left sysygy of modules
|
boolean |
isRightOreCond(GenSolvablePolynomial<C> a,
GenSolvablePolynomial<C> b,
GenSolvablePolynomial<C>[] oc)
Test right Ore condition.
|
boolean |
isRightZeroRelation(java.util.List<java.util.List<GenSolvablePolynomial<C>>> Z,
java.util.List<GenSolvablePolynomial<C>> F)
Test if right syzygy.
|
boolean |
isRightZeroRelation(ModuleList<C> Z,
ModuleList<C> F)
Test if right sysygy of modules
|
GenSolvablePolynomial<C>[] |
leftOreCond(GenSolvablePolynomial<C> a,
GenSolvablePolynomial<C> b)
Left Ore condition.
|
java.util.List<java.util.List<GenSolvablePolynomial<C>>> |
leftZeroRelations(int modv,
java.util.List<GenSolvablePolynomial<C>> F)
Left syzygy for left Groebner base.
|
java.util.List<java.util.List<GenSolvablePolynomial<C>>> |
leftZeroRelations(java.util.List<GenSolvablePolynomial<C>> F)
Left syzygy for left Groebner base.
|
ModuleList<C> |
leftZeroRelations(ModuleList<C> M)
Left syzygy for left module Groebner base.
|
java.util.List<java.util.List<GenSolvablePolynomial<C>>> |
leftZeroRelationsArbitrary(int modv,
java.util.List<GenSolvablePolynomial<C>> F)
Left syzygy module from arbitrary base.
|
java.util.List<java.util.List<GenSolvablePolynomial<C>>> |
leftZeroRelationsArbitrary(java.util.List<GenSolvablePolynomial<C>> F)
Left syzygy module from arbitrary base.
|
ModuleList<C> |
leftZeroRelationsArbitrary(ModuleList<C> M)
Left syzygy for arbitrary left module base.
|
java.util.List<edu.jas.gbufd.SolvResPart<C>> |
resolution(ModuleList<C> M)
Resolution of a module.
|
java.util.List |
resolution(PolynomialList<C> F)
Resolution of a polynomial list.
|
java.util.List<edu.jas.gbufd.SolvResPart<C>> |
resolutionArbitrary(ModuleList<C> M)
Resolution of a module.
|
java.util.List |
resolutionArbitrary(PolynomialList<C> F)
Resolution of a polynomial list.
|
GenSolvablePolynomial<C>[] |
rightOreCond(GenSolvablePolynomial<C> a,
GenSolvablePolynomial<C> b)
Right Ore condition.
|
java.util.List<java.util.List<GenSolvablePolynomial<C>>> |
rightZeroRelationsArbitrary(int modv,
java.util.List<GenSolvablePolynomial<C>> F)
Right syzygy module from arbitrary base.
|
java.util.List<java.util.List<GenSolvablePolynomial<C>>> |
rightZeroRelationsArbitrary(java.util.List<GenSolvablePolynomial<C>> F)
Right syzygy module from arbitrary base.
|
java.util.List<java.util.List<GenSolvablePolynomial<C>>> leftZeroRelations(java.util.List<GenSolvablePolynomial<C>> F)
F - a Groebner base.java.util.List<java.util.List<GenSolvablePolynomial<C>>> leftZeroRelations(int modv, java.util.List<GenSolvablePolynomial<C>> F)
modv - number of module variables.F - a Groebner base.ModuleList<C> leftZeroRelations(ModuleList<C> M)
M - a Groebner base.boolean isLeftZeroRelation(java.util.List<java.util.List<GenSolvablePolynomial<C>>> Z, java.util.List<GenSolvablePolynomial<C>> F)
Z - list of sysygies.F - a polynomial list.boolean isRightZeroRelation(java.util.List<java.util.List<GenSolvablePolynomial<C>>> Z, java.util.List<GenSolvablePolynomial<C>> F)
Z - list of sysygies.F - a polynomial list.boolean isLeftZeroRelation(ModuleList<C> Z, ModuleList<C> F)
Z - list of sysygies.F - a module list.boolean isRightZeroRelation(ModuleList<C> Z, ModuleList<C> F)
Z - list of sysygies.F - a module list.java.util.List<edu.jas.gbufd.SolvResPart<C>> resolution(ModuleList<C> M)
M - a module list of a Groebner basis.java.util.List resolution(PolynomialList<C> F)
F - a polynomial list of a Groebner basis.java.util.List<edu.jas.gbufd.SolvResPart<C>> resolutionArbitrary(ModuleList<C> M)
M - a module list of an arbitrary basis.java.util.List resolutionArbitrary(PolynomialList<C> F)
F - a polynomial list of an arbitrary basis.java.util.List<java.util.List<GenSolvablePolynomial<C>>> leftZeroRelationsArbitrary(java.util.List<GenSolvablePolynomial<C>> F)
F - a solvable polynomial list.java.util.List<java.util.List<GenSolvablePolynomial<C>>> leftZeroRelationsArbitrary(int modv, java.util.List<GenSolvablePolynomial<C>> F)
modv - number of module variables.F - a solvable polynomial list.ModuleList<C> leftZeroRelationsArbitrary(ModuleList<C> M)
M - an arbitrary base.java.util.List<java.util.List<GenSolvablePolynomial<C>>> rightZeroRelationsArbitrary(java.util.List<GenSolvablePolynomial<C>> F)
F - a solvable polynomial list.java.util.List<java.util.List<GenSolvablePolynomial<C>>> rightZeroRelationsArbitrary(int modv, java.util.List<GenSolvablePolynomial<C>> F)
modv - number of module variables.F - a solvable polynomial list.boolean isLeftOreCond(GenSolvablePolynomial<C> a, GenSolvablePolynomial<C> b, GenSolvablePolynomial<C>[] oc)
a - solvable polynomialb - solvable polynomialoc - = [p,q] two solvable polynomialsboolean isRightOreCond(GenSolvablePolynomial<C> a, GenSolvablePolynomial<C> b, GenSolvablePolynomial<C>[] oc)
a - solvable polynomialb - solvable polynomialoc - = [p,q] two solvable polynomialsGenSolvablePolynomial<C>[] leftOreCond(GenSolvablePolynomial<C> a, GenSolvablePolynomial<C> b)
a - solvable polynomialb - solvable polynomialGenSolvablePolynomial<C>[] rightOreCond(GenSolvablePolynomial<C> a, GenSolvablePolynomial<C> b)
a - solvable polynomialb - solvable polynomial