Package edu.jas.gbufd
Interface RReduction<C extends RegularRingElem<C>>
- Type Parameters:
C
- coefficient type
- All Superinterfaces:
Reduction<C>
,Serializable
- All Known Subinterfaces:
RPseudoReduction<C>
- All Known Implementing Classes:
RPseudoReductionSeq
,RReductionSeq
Polynomial R Reduction interface. Defines additionally boolean closure
methods.
-
Method Summary
Modifier and TypeMethodDescriptionBoolean closure, compute idempotent(ldcf(A)) A.Boolean remainder, compute idemComplement(ldcf(A)) A.boolean
Is boolean closed, test if A == idempotent(ldcf(A)) A.boolean
Is boolean closed, test if all A in F are boolean closed.boolean
isStrongTopReducible
(List<GenPolynomial<C>> P, GenPolynomial<C> A) Is strong top reducible.Reduced boolean closure, compute BC(A) for all A in F.reducedBooleanClosure
(List<GenPolynomial<C>> F, GenPolynomial<C> A) Reduced boolean closure, compute BC(A) modulo F.Methods inherited from interface edu.jas.gb.Reduction
criterion4, criterion4, criterion4, irreducibleSet, isNormalform, isNormalform, isReducible, isReductionNF, isTopReducible, moduleCriterion, moduleCriterion, normalform, normalform, normalform, SPolynomial, SPolynomial
-
Method Details
-
isStrongTopReducible
Is strong top reducible. Condition is idempotent(a) == idempotent(b), for a=ldcf(A) and b=ldcf(B) and lt(B) | lt(A) for some B in F.- Parameters:
P
- polynomial list.A
- polynomial.- Returns:
- true if A is string top reducible with respect to P.
-
isBooleanClosed
Is boolean closed, test if A == idempotent(ldcf(A)) A.- Parameters:
A
- polynomial.- Returns:
- true if A is boolean closed, else false.
-
isBooleanClosed
Is boolean closed, test if all A in F are boolean closed.- Parameters:
F
- polynomial list.- Returns:
- true if F is boolean closed, else false.
-
booleanClosure
Boolean closure, compute idempotent(ldcf(A)) A.- Parameters:
A
- polynomial.- Returns:
- bc(A).
-
booleanRemainder
Boolean remainder, compute idemComplement(ldcf(A)) A.- Parameters:
A
- polynomial.- Returns:
- br(A) = A - bc(A).
-
reducedBooleanClosure
Reduced boolean closure, compute BC(A) for all A in F.- Parameters:
F
- polynomial list.- Returns:
- red(bc(F)) = bc(red(F)).
-
reducedBooleanClosure
Reduced boolean closure, compute BC(A) modulo F.- Parameters:
F
- polynomial list.A
- polynomial.- Returns:
- red(bc(A)).
-