Uses of Class
edu.jas.gb.SigPoly

Packages that use SigPoly

Package	Description
edu.jas.gb	Groebner bases package.

Uses of SigPoly in edu.jas.gb

Fields in edu.jas.gb declared as SigPoly

Modifier and Type	Field	Description
final SigPoly<C>	SigPair.pi
final SigPoly<C>	SigPair.pj

Fields in edu.jas.gb with type parameters of type SigPoly

Modifier and Type	Field	Description
final List<SigPoly<C>>	SigPair.Gs

Methods in edu.jas.gb that return SigPoly

Modifier and Type	Method	Description
SigPoly<C>	SigReduction.sigNormalform(List<GenPolynomial<C>> F, List<SigPoly<C>> G, SigPoly<C> A)	Normalform.
SigPoly<C>	SigReductionSeq.sigNormalform(List<GenPolynomial<C>> F, List<SigPoly<C>> G, SigPoly<C> A)	Top normalform.
SigPoly<C>	SigReductionSeq.sigSemiNormalform(List<GenPolynomial<C>> F, List<SigPoly<C>> G, SigPoly<C> A)	Top semi-complete normalform.

Methods in edu.jas.gb with parameters of type SigPoly

Modifier and Type	Method	Description
boolean	SigReduction.isSigNormalform(List<SigPoly<C>> F, List<SigPoly<C>> G, SigPoly<C> A)	Is in Normalform.
boolean	SigReductionSeq.isSigNormalform(List<SigPoly<C>> F, List<SigPoly<C>> G, SigPoly<C> A)	Is in top normalform.
boolean	SigReduction.isSigReducible(List<SigPoly<C>> F, List<SigPoly<C>> G, SigPoly<C> A)	Is top reducible.
boolean	SigReductionSeq.isSigReducible(List<SigPoly<C>> F, List<SigPoly<C>> G, SigPoly<C> A)	Is top reducible.
boolean	SigReductionSeq.isSigRedundant(List<SigPoly<C>> G, SigPoly<C> A)	Is sigma redundant.
boolean	SigReductionSeq.isSigRedundantAlt(List<SigPoly<C>> G, SigPoly<C> A)	Is sigma redundant, alternative algorithm.
SigPoly<C>	SigReduction.sigNormalform(List<GenPolynomial<C>> F, List<SigPoly<C>> G, SigPoly<C> A)	Normalform.
SigPoly<C>	SigReductionSeq.sigNormalform(List<GenPolynomial<C>> F, List<SigPoly<C>> G, SigPoly<C> A)	Top normalform.
SigPoly<C>	SigReductionSeq.sigSemiNormalform(List<GenPolynomial<C>> F, List<SigPoly<C>> G, SigPoly<C> A)	Top semi-complete normalform.
GenPolynomial<C>	SigReduction.SPolynomial(SigPoly<C> Ap, SigPoly<C> Bp)	S-Polynomial.
GenPolynomial<C>	SigReductionSeq.SPolynomial(SigPoly<C> A, SigPoly<C> B)	S-Polynomial.
ExpVector[]	SigReductionSeq.SPolynomialExpVectorFactors(SigPoly<C> A, SigPoly<C> B)	S-Polynomial factors.
GenPolynomial<C>[]	SigReductionSeq.SPolynomialFactors(SigPoly<C> A, SigPoly<C> B)	S-Polynomial polynomial factors.
GenPolynomial<C>	SigReductionSeq.SPolynomialHalf(SigPoly<C> A, SigPoly<C> B)	S-Polynomial half.

Method parameters in edu.jas.gb with type arguments of type SigPoly

Modifier and Type	Method	Description
boolean	SigReduction.isSigNormalform(List<SigPoly<C>> F, List<SigPoly<C>> G, SigPoly<C> A)	Is in Normalform.
boolean	SigReductionSeq.isSigNormalform(List<SigPoly<C>> F, List<SigPoly<C>> G, SigPoly<C> A)	Is in top normalform.
boolean	SigReduction.isSigReducible(List<SigPoly<C>> F, List<SigPoly<C>> G, SigPoly<C> A)	Is top reducible.
boolean	SigReductionSeq.isSigReducible(List<SigPoly<C>> F, List<SigPoly<C>> G, SigPoly<C> A)	Is top reducible.
boolean	SigReductionSeq.isSigRedundant(List<SigPoly<C>> G, SigPoly<C> A)	Is sigma redundant.
boolean	SigReductionSeq.isSigRedundantAlt(List<SigPoly<C>> G, SigPoly<C> A)	Is sigma redundant, alternative algorithm.
List<GenPolynomial<C>>	SigReductionSeq.polys(List<SigPoly<C>> F)	Select polynomials.

Constructors in edu.jas.gb with parameters of type SigPoly

Modifier	Constructor	Description
	SigPair(ExpVector sig, SigPoly<C> a, SigPoly<C> b, List<SigPoly<C>> Gs)	SigPair constructor.
	SigPair(GenPolynomial<C> sig, SigPoly<C> a, SigPoly<C> b, List<SigPoly<C>> Gs)	SigPair constructor.

Constructor parameters in edu.jas.gb with type arguments of type SigPoly

Modifier	Constructor	Description
	SigPair(ExpVector sig, SigPoly<C> a, SigPoly<C> b, List<SigPoly<C>> Gs)	SigPair constructor.
	SigPair(GenPolynomial<C> sig, SigPoly<C> a, SigPoly<C> b, List<SigPoly<C>> Gs)	SigPair constructor.