C
- coefficient typepublic class DReductionSeq<C extends RingElem<C>> extends ReductionAbstract<C> implements DReduction<C>
Constructor and Description |
---|
DReductionSeq()
Constructor.
|
Modifier and Type | Method and Description |
---|---|
boolean |
criterion4(GenPolynomial<C> A,
GenPolynomial<C> B)
GB criterium 4.
|
boolean |
criterion4(GenPolynomial<C> A,
GenPolynomial<C> B,
ExpVector e)
GB criterium 4.
|
GenPolynomial<C> |
GPolynomial(GenPolynomial<C> Ap,
GenPolynomial<C> Bp)
G-Polynomial.
|
GenPolynomial<C> |
GPolynomial(java.util.List<GenPolynomial<C>> S,
int i,
GenPolynomial<C> Ap,
int j,
GenPolynomial<C> Bp)
D-Polynomial with recording.
|
java.util.List<GenPolynomial<C>> |
irreducibleSet(java.util.List<GenPolynomial<C>> Pp)
Irreducible set.
|
boolean |
isNormalform(java.util.List<GenPolynomial<C>> Pp,
GenPolynomial<C> Ap)
Is in Normalform.
|
boolean |
isTopReducible(java.util.List<GenPolynomial<C>> P,
GenPolynomial<C> A)
Is top reducible.
|
GenPolynomial<C> |
normalform(java.util.List<GenPolynomial<C>> Pp,
GenPolynomial<C> Ap)
Normalform using d-reduction.
|
GenPolynomial<C> |
normalform(java.util.List<GenPolynomial<C>> row,
java.util.List<GenPolynomial<C>> Pp,
GenPolynomial<C> Ap)
Normalform with recording.
|
GenPolynomial<C> |
SPolynomial(GenPolynomial<C> Ap,
GenPolynomial<C> Bp)
S-Polynomial.
|
criterion4, isNormalform, isReducible, isReductionNF, moduleCriterion, moduleCriterion, normalform, normalform, normalform, normalformMarked, SPolynomial
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
criterion4, isNormalform, isReducible, isReductionNF, moduleCriterion, moduleCriterion, normalform, SPolynomial
public DReductionSeq()
public boolean isTopReducible(java.util.List<GenPolynomial<C>> P, GenPolynomial<C> A)
isTopReducible
in interface Reduction<C extends RingElem<C>>
isTopReducible
in class ReductionAbstract<C extends RingElem<C>>
A
- polynomial.P
- polynomial list.public boolean isNormalform(java.util.List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)
isNormalform
in interface Reduction<C extends RingElem<C>>
isNormalform
in class ReductionAbstract<C extends RingElem<C>>
Ap
- polynomial.Pp
- polynomial list.public GenPolynomial<C> normalform(java.util.List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)
normalform
in interface Reduction<C extends RingElem<C>>
Ap
- polynomial.Pp
- polynomial list.public GenPolynomial<C> SPolynomial(GenPolynomial<C> Ap, GenPolynomial<C> Bp)
SPolynomial
in interface Reduction<C extends RingElem<C>>
SPolynomial
in class ReductionAbstract<C extends RingElem<C>>
Ap
- polynomial.Bp
- polynomial.public GenPolynomial<C> GPolynomial(GenPolynomial<C> Ap, GenPolynomial<C> Bp)
GPolynomial
in interface DReduction<C extends RingElem<C>>
Ap
- polynomial.Bp
- polynomial.public GenPolynomial<C> GPolynomial(java.util.List<GenPolynomial<C>> S, int i, GenPolynomial<C> Ap, int j, GenPolynomial<C> Bp)
GPolynomial
in interface DReduction<C extends RingElem<C>>
S
- recording matrix, is modified.i
- index of Ap in basis list.Ap
- a polynomial.j
- index of Bp in basis list.Bp
- a polynomial.public boolean criterion4(GenPolynomial<C> A, GenPolynomial<C> B, ExpVector e)
criterion4
in interface Reduction<C extends RingElem<C>>
criterion4
in class ReductionAbstract<C extends RingElem<C>>
A
- polynomial.B
- polynomial.e
- = lcm(ht(A),ht(B))public boolean criterion4(GenPolynomial<C> A, GenPolynomial<C> B)
criterion4
in interface Reduction<C extends RingElem<C>>
criterion4
in class ReductionAbstract<C extends RingElem<C>>
A
- polynomial.B
- polynomial.public GenPolynomial<C> normalform(java.util.List<GenPolynomial<C>> row, java.util.List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)
normalform
in interface Reduction<C extends RingElem<C>>
row
- recording matrix, is modified.Pp
- a polynomial list for reduction.Ap
- a polynomial.public java.util.List<GenPolynomial<C>> irreducibleSet(java.util.List<GenPolynomial<C>> Pp)
irreducibleSet
in interface Reduction<C extends RingElem<C>>
irreducibleSet
in class ReductionAbstract<C extends RingElem<C>>
Pp
- polynomial list.