C
- coefficient typepublic interface RReduction<C extends RegularRingElem<C>> extends Reduction<C>
Modifier and Type | Method and Description |
---|---|
GenPolynomial<C> |
booleanClosure(GenPolynomial<C> A)
Boolean closure, compute idempotent(ldcf(A)) A.
|
GenPolynomial<C> |
booleanRemainder(GenPolynomial<C> A)
Boolean remainder, compute idemComplement(ldcf(A)) A.
|
boolean |
isBooleanClosed(GenPolynomial<C> A)
Is boolean closed, test if A == idempotent(ldcf(A)) A.
|
boolean |
isBooleanClosed(java.util.List<GenPolynomial<C>> F)
Is boolean closed, test if all A in F are boolean closed.
|
boolean |
isStrongTopReducible(java.util.List<GenPolynomial<C>> P,
GenPolynomial<C> A)
Is strong top reducible.
|
java.util.List<GenPolynomial<C>> |
reducedBooleanClosure(java.util.List<GenPolynomial<C>> F)
Reduced boolean closure, compute BC(A) for all A in F.
|
java.util.List<GenPolynomial<C>> |
reducedBooleanClosure(java.util.List<GenPolynomial<C>> F,
GenPolynomial<C> A)
Reduced boolean closure, compute BC(A) modulo F.
|
criterion4, criterion4, criterion4, irreducibleSet, isNormalform, isNormalform, isReducible, isReductionNF, isTopReducible, moduleCriterion, moduleCriterion, normalform, normalform, normalform, SPolynomial, SPolynomial
boolean isStrongTopReducible(java.util.List<GenPolynomial<C>> P, GenPolynomial<C> A)
A
- polynomial.P
- polynomial list.boolean isBooleanClosed(GenPolynomial<C> A)
A
- polynomial.boolean isBooleanClosed(java.util.List<GenPolynomial<C>> F)
F
- polynomial list.GenPolynomial<C> booleanClosure(GenPolynomial<C> A)
A
- polynomial.GenPolynomial<C> booleanRemainder(GenPolynomial<C> A)
A
- polynomial.java.util.List<GenPolynomial<C>> reducedBooleanClosure(java.util.List<GenPolynomial<C>> F)
F
- polynomial list.java.util.List<GenPolynomial<C>> reducedBooleanClosure(java.util.List<GenPolynomial<C>> F, GenPolynomial<C> A)
A
- polynomial.F
- polynomial list.