Class OrderedMinPairlist<C extends RingElem<C>>
java.lang.Object
edu.jas.gb.OrderedPairlist<C>
edu.jas.gb.OrderedMinPairlist<C>
- All Implemented Interfaces:
PairList<C>, Serializable
Pair list management. The original Buchberger algorithm with criterions using
early pair exclusion. Implemented using GenPolynomial, TreeMap and BitSet.
- See Also:
-
Field Summary
FieldsFields inherited from class OrderedPairlist
moduleVars, oneInGB, P, pairlist, putCount, red, reduction, remCount, ring, useCriterion4 -
Constructor Summary
ConstructorsConstructorDescriptionConstructor.OrderedMinPairlist(int m, GenPolynomialRing<C> r) Constructor.Constructor. -
Method Summary
Modifier and TypeMethodDescriptioncreate(int m, GenPolynomialRing<C> r) Create a new PairList.create(GenPolynomialRing<C> r) Create a new PairList.booleancriterion3(int i, int j, ExpVector eij) GB criterium 3.intput(GenPolynomial<C> p) Put one Polynomial to the pairlist and reduction matrix.Remove the next required pair from the pairlist and reduction matrix.
-
Field Details
-
logger
private static final org.apache.logging.log4j.Logger logger
-
-
Constructor Details
-
OrderedMinPairlist
public OrderedMinPairlist()Constructor. -
OrderedMinPairlist
-
OrderedMinPairlist
Constructor.- Parameters:
m- number of module variables.r- polynomial factory.
-
-
Method Details
-
create
-
create
-
put
-
removeNext
Remove the next required pair from the pairlist and reduction matrix. Apply the criterions 3 and 4 to see if the S-polynomial is required.- Specified by:
removeNextin interfacePairList<C extends RingElem<C>>- Overrides:
removeNextin classOrderedPairlist<C extends RingElem<C>>- Returns:
- the next pair if one exists, otherwise null.
-
criterion3
GB criterium 3.- Specified by:
criterion3in interfacePairList<C extends RingElem<C>>- Overrides:
criterion3in classOrderedPairlist<C extends RingElem<C>>- Returns:
- true if the S-polynomial(i,j) is required.
-