Uses of Class edu.jas.poly.GenSolvablePolynomial

Packages that use GenSolvablePolynomial
Package	Description
edu.jas.application	Groebner base application package.
edu.jas.fd	Factorization domain package for solvable polynomial rings.
edu.jas.gb	Groebner bases package.
edu.jas.gbmod	Module Groebner base package.
edu.jas.gbufd	Groebner bases using unique factorization package.
edu.jas.poly	Generic coefficients polynomial package.

Uses of GenSolvablePolynomial in edu.jas.application

Subclasses of GenSolvablePolynomial in edu.jas.application
Modifier and Type	Class	Description
`class`	`LocalSolvablePolynomial<C extends GcdRingElem<C>>`	LocalSolvablePolynomial generic recursive solvable polynomials implementing RingElem.
`class`	`ResidueSolvablePolynomial<C extends GcdRingElem<C>>`	ResidueSolvablePolynomial generic solvable polynomials with solvable residue coefficients implementing RingElem.
`class`	`ResidueSolvableWordPolynomial<C extends GcdRingElem<C>>`	ResidueSolvableWordPolynomial solvable polynomials with WordResidue coefficients implementing RingElem.

Fields in edu.jas.application declared as GenSolvablePolynomial
Modifier and Type	Field	Description
`GenSolvablePolynomial<C>`	SolvableLocal.`den`	Denominator part of the element data structure.
`GenSolvablePolynomial<C>`	SolvableLocalResidue.`den`	Denominator part of the element data structure.
`GenSolvablePolynomial<C>`	SolvableLocal.`num`	Numerator part of the element data structure.
`GenSolvablePolynomial<C>`	SolvableLocalResidue.`num`	Numerator part of the element data structure.
`GenSolvablePolynomial<C>`	SolvableResidue.`val`	Value part of the element data structure.

Methods in edu.jas.application that return GenSolvablePolynomial
Modifier and Type	Method	Description
`GenSolvablePolynomial<C>`	SolvableIdeal.`constructUnivariate(int i)`	Construct univariate polynomial of minimal degree in variable i in zero dimensional ideal(G).
`GenSolvablePolynomial<C>`	SolvableLocal.`denominator()`	Denominator.
`GenSolvablePolynomial<C>`	SolvableLocalResidue.`denominator()`	Denominator.
`GenSolvablePolynomial<C>`	SolvableResidue.`denominator()`	Denominator.
`GenSolvablePolynomial<C>`	SolvableIdeal.`inverse(GenSolvablePolynomial<C> h)`	Inverse for element modulo this ideal.
`GenSolvablePolynomial<C>`	SolvableIdeal.`normalform(GenSolvablePolynomial<C> h)`	Normalform for element.
`GenSolvablePolynomial<C>`	SolvableLocal.`numerator()`	Numerator.
`GenSolvablePolynomial<C>`	SolvableLocalResidue.`numerator()`	Numerator.
`GenSolvablePolynomial<C>`	SolvableResidue.`numerator()`	Numerator.
`GenSolvablePolynomial<C>`	SolvableResidue.`value()`	Value.

Methods in edu.jas.application that return types with arguments of type GenSolvablePolynomial
Modifier and Type	Method	Description
`java.util.List<GenSolvablePolynomial<C>>`	SolvableIdeal.`constructUnivariate()`	Construct univariate polynomials of minimal degree in all variables in zero dimensional ideal(G).
`java.util.List<GenSolvablePolynomial<C>>`	SolvableIdeal.`getList()`	Get the List of GenSolvablePolynomials.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableIdeal.`normalform(java.util.List<GenSolvablePolynomial<C>> L)`	Normalform for list of solvable elements.

Methods in edu.jas.application with parameters of type GenSolvablePolynomial
Modifier and Type	Method	Description
`SolvableIdeal<C>`	SolvableIdeal.`annihilator(GenSolvablePolynomial<C> h)`	Annihilator for element modulo this ideal.
`boolean`	SolvableIdeal.`contains(GenSolvablePolynomial<C> b)`	Solvable ideal containment.
`LocalSolvablePolynomial<C>`	LocalSolvablePolynomialRing.`fromPolyCoefficients(GenSolvablePolynomial<GenPolynomial<C>> A)`	Rational function from integral polynomial coefficients.
`ResidueSolvablePolynomial<C>`	ResidueSolvablePolynomialRing.`fromPolyCoefficients(GenSolvablePolynomial<GenPolynomial<C>> A)`	Solvable residue coefficients from integral polynomial coefficients.
`ResidueSolvableWordPolynomial<C>`	ResidueSolvableWordPolynomialRing.`fromPolyCoefficients(GenSolvablePolynomial<GenWordPolynomial<C>> A)`	Word residue coefficients from integral word polynomial coefficients.
`SolvableIdeal<C>`	SolvableIdeal.`infiniteQuotient(GenSolvablePolynomial<C> h)`	Infinite quotient.
`int`	SolvableIdeal.`infiniteQuotientExponent(GenSolvablePolynomial<C> h, SolvableIdeal<C> Q)`	Infinite quotient exponent.
`SolvableIdeal<C>`	SolvableIdeal.`infiniteQuotientRab(GenSolvablePolynomial<C> h)`	Infinite quotient.
`GenSolvablePolynomial<C>`	SolvableIdeal.`inverse(GenSolvablePolynomial<C> h)`	Inverse for element modulo this ideal.
`boolean`	SolvableIdeal.`isAnnihilator(GenSolvablePolynomial<C> h, SolvableIdeal<C> A)`	Test for annihilator of element modulo this ideal.
`boolean`	SolvableIdeal.`isRadicalMember(GenSolvablePolynomial<C> h)`	Radical membership test.
`boolean`	SolvableIdeal.`isUnit(GenSolvablePolynomial<C> h)`	Test if element is a unit modulo this ideal.
`SolvableIdeal<C>`	SolvableIdeal.`leftProduct(GenSolvablePolynomial<C> b)`	Left product.
`SolvableLocal<C>`	SolvableLocal.`multiply(GenSolvablePolynomial<C> b)`	SolvableLocal multiplication by GenSolvablePolynomial.
`SolvableLocalResidue<C>`	SolvableLocalResidue.`multiply(GenSolvablePolynomial<C> b)`	SolvableLocalResidue multiplication by GenSolvablePolynomial.
`SolvableResidue<C>`	SolvableResidue.`multiply(GenSolvablePolynomial<C> S)`	SolvableResidue multiplication.
`GenSolvablePolynomial<C>`	SolvableIdeal.`normalform(GenSolvablePolynomial<C> h)`	Normalform for element.
`SolvableIdeal<C>`	SolvableIdeal.`product(GenSolvablePolynomial<C> b)`	Product.
`SolvableIdeal<C>`	SolvableIdeal.`quotient(GenSolvablePolynomial<C> h)`	Quotient.
`SolvableIdeal<C>`	SolvableIdeal.`sum(GenSolvablePolynomial<C> b)`	Solvable summation.

Method parameters in edu.jas.application with type arguments of type GenSolvablePolynomial
Modifier and Type	Method	Description
`boolean`	SolvableIdeal.`contains(java.util.List<GenSolvablePolynomial<C>> B)`	Solvable ideal containment.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableIdeal.`normalform(java.util.List<GenSolvablePolynomial<C>> L)`	Normalform for list of solvable elements.
`SolvableIdeal<C>`	SolvableIdeal.`sum(java.util.List<GenSolvablePolynomial<C>> L)`	Solvable summation.

Constructors in edu.jas.application with parameters of type GenSolvablePolynomial
Constructor	Description
`LocalSolvablePolynomial(LocalSolvablePolynomialRing<C> r, GenSolvablePolynomial<SolvableLocal<C>> S)`	Constructor for LocalSolvablePolynomial.
`ResidueSolvablePolynomial(ResidueSolvablePolynomialRing<C> r, GenSolvablePolynomial<SolvableResidue<C>> S)`	Constructor for ResidueSolvablePolynomial.
`ResidueSolvableWordPolynomial(ResidueSolvableWordPolynomialRing<C> r, GenSolvablePolynomial<WordResidue<C>> S)`	Constructor for ResidueSolvableWordPolynomial.
`SolvableLocal(SolvableLocalRing<C> r, GenSolvablePolynomial<C> n)`	The constructor creates a SolvableLocal object from a ring factory and a numerator polynomial.
`SolvableLocal(SolvableLocalRing<C> r, GenSolvablePolynomial<C> n, GenSolvablePolynomial<C> d)`	The constructor creates a SolvableLocal object from a ring factory and a numerator and denominator polynomial.
`SolvableLocal(SolvableLocalRing<C> r, GenSolvablePolynomial<C> n, GenSolvablePolynomial<C> d, boolean isred)`	The constructor creates a SolvableLocal object from a ring factory and a numerator and denominator polynomial.
`SolvableLocalResidue(SolvableLocalResidueRing<C> r, GenSolvablePolynomial<C> n)`	The constructor creates a SolvableLocalResidue object from a ring factory and a numerator polynomial.
`SolvableLocalResidue(SolvableLocalResidueRing<C> r, GenSolvablePolynomial<C> n, GenSolvablePolynomial<C> d)`	The constructor creates a SolvableLocalResidue object from a ring factory and a numerator and denominator solvable polynomial.
`SolvableLocalResidue(SolvableLocalResidueRing<C> r, GenSolvablePolynomial<C> n, GenSolvablePolynomial<C> d, boolean isred)`	The constructor creates a SolvableLocalResidue object from a ring factory and a numerator and denominator polynomial.
`SolvableResidue(SolvableResidueRing<C> r, GenSolvablePolynomial<C> a)`	The constructor creates a SolvableResidue object from a ring factory and a polynomial.
`SolvableResidue(SolvableResidueRing<C> r, GenSolvablePolynomial<C> a, int u)`	The constructor creates a SolvableResidue object from a ring factory, a polynomial and an indicator if a is a unit.

Constructor parameters in edu.jas.application with type arguments of type GenSolvablePolynomial
Constructor	Description
`SolvableIdeal(GenSolvablePolynomialRing<C> ring, java.util.List<GenSolvablePolynomial<C>> F)`	Constructor.
`SolvableIdeal(GenSolvablePolynomialRing<C> ring, java.util.List<GenSolvablePolynomial<C>> F, boolean gb)`	Constructor.
`SolvableIdeal(GenSolvablePolynomialRing<C> ring, java.util.List<GenSolvablePolynomial<C>> F, boolean gb, boolean topt)`	Constructor.
`SolvableIdeal(GenSolvablePolynomialRing<C> ring, java.util.List<GenSolvablePolynomial<C>> F, boolean gb, SolvableIdeal.Side s)`	Constructor.
`SolvableIdeal(GenSolvablePolynomialRing<C> ring, java.util.List<GenSolvablePolynomial<C>> F, SolvableIdeal.Side s)`	Constructor.

Uses of GenSolvablePolynomial in edu.jas.fd

Subclasses of GenSolvablePolynomial in edu.jas.fd
Modifier and Type	Class	Description
`class`	`QuotSolvablePolynomial<C extends GcdRingElem<C>>`	QuotSolvablePolynomial generic recursive solvable polynomials implementing RingElem.

Fields in edu.jas.fd declared as GenSolvablePolynomial
Modifier and Type	Field	Description
`GenSolvablePolynomial<C>`	SolvableQuotient.`den`	Denominator part of the element data structure.
`GenSolvablePolynomial<C>`	SolvableQuotient.`num`	Numerator part of the element data structure.

Methods in edu.jas.fd that return GenSolvablePolynomial
Modifier and Type	Method	Description
`GenSolvablePolynomial<C>[]`	GreatestCommonDivisorAbstract.`baseExtendedGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Univariate GenSolvablePolynomial extended greatest common divisor.
`GenSolvablePolynomial<C>[]`	GreatestCommonDivisorAbstract.`baseGcdDiophant(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S, GenSolvablePolynomial<C> c)`	Univariate GenSolvablePolynomial greatest common divisor diophantine version.
`GenSolvablePolynomial<C>[]`	GreatestCommonDivisorAbstract.`baseHalfExtendedGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Univariate GenSolvablePolynomial half extended greatest common divisor.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<C>`	FDUtil.`basePseudoLeftDivide(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial sparse pseudo divide.
`GenSolvablePolynomial<GenPolynomial<C>>`	GreatestCommonDivisorAbstract.`baseRecursivePrimitivePart(GenSolvablePolynomial<GenPolynomial<C>> P)`	GenSolvablePolynomial base recursive primitive part.
`GenSolvablePolynomial<C>`	SolvableQuotient.`denominator()`	Denominator.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`divide(GenSolvablePolynomial<C> a, C b)`	GenSolvablePolynomial division.
`(package private) static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>`	FDUtil.`experimentalRecursiveLeftDivide(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<C> s)`
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>`	FDUtil.`integralFromQuotientCoefficients(GenSolvablePolynomialRing<GenPolynomial<C>> fac, GenSolvablePolynomial<SolvableQuotient<C>> A)`	Integral solvable polynomial from solvable rational function coefficients.
`abstract GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`leftBaseGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Univariate GenSolvablePolynomial greatest common divisor.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorFake.`leftBaseGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Univariate GenSolvablePolynomial greatest common divisor.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorPrimitive.`leftBaseGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Univariate GenSolvablePolynomial greatest common divisor.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorSimple.`leftBaseGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Univariate GenSolvablePolynomial greatest common divisor.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorSyzygy.`leftBaseGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Left univariate GenSolvablePolynomial greatest common divisor.
`GenSolvablePolynomial<C>`	SGCDParallelProxy.`leftBaseGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Left univariate GenSolvablePolynomial greatest common divisor.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`leftBasePrimitivePart(GenSolvablePolynomial<C> P)`	GenSolvablePolynomial base coefficient primitive part.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<C>`	FDUtil.`leftBasePseudoQuotient(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial sparse pseudo quotient for univariate polynomials or exact division.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<C>[]`	FDUtil.`leftBasePseudoQuotientRemainder(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial sparse pseudo quotient and remainder for univariate polynomials or exact division.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<C>`	FDUtil.`leftBaseSparsePseudoRemainder(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial sparse pseudo remainder for univariate polynomials.
`GenSolvablePolynomial<C>`	GreatestCommonDivisor.`leftContent(GenSolvablePolynomial<C> P)`	GenSolvablePolynomial left content.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`leftContent(GenSolvablePolynomial<C> P)`	GenSolvablePolynomial left content.
`GenSolvablePolynomial<C>`	GreatestCommonDivisor.`leftGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial left greatest common divisor.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`leftGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial greatest common divisor.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`leftGcd(java.util.List<GenSolvablePolynomial<C>> A)`	List of GenSolvablePolynomials left greatest common divisor.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorSyzygy.`leftGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Left GenSolvablePolynomial greatest common divisor.
`GenSolvablePolynomial<C>`	SGCDParallelProxy.`leftGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Left GenSolvablePolynomial greatest common divisor.
`GenSolvablePolynomial<C>[]`	GreatestCommonDivisorAbstract.`leftGcdCofactors(GenSolvablePolynomialRing<C> r, GenSolvablePolynomial<C> n, GenSolvablePolynomial<C> d)`	Left greatest common divisor and cofactors.
`GenSolvablePolynomial<C>`	GreatestCommonDivisor.`leftLcm(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial left least common multiple.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`leftLcm(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial left least common multiple.
`GenSolvablePolynomial<C>[]`	GreatestCommonDivisorAbstract.`leftOreCond(GenSolvablePolynomial<C> a, GenSolvablePolynomial<C> b)`	Left Ore condition.
`GenSolvablePolynomial<C>`	GreatestCommonDivisor.`leftPrimitivePart(GenSolvablePolynomial<C> P)`	GenSolvablePolynomial left primitive part.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`leftPrimitivePart(GenSolvablePolynomial<C> P)`	GenSolvablePolynomial left primitive part.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`leftRecursiveContent(GenSolvablePolynomial<GenPolynomial<C>> P)`	GenSolvablePolynomial left recursive content.
`GenSolvablePolynomial<GenPolynomial<C>>`	GreatestCommonDivisorAbstract.`leftRecursiveGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	GenSolvablePolynomial left recursive greatest common divisor.
`GenSolvablePolynomial<GenPolynomial<C>>`	GreatestCommonDivisorAbstract.`leftRecursivePrimitivePart(GenSolvablePolynomial<GenPolynomial<C>> P)`	GenSolvablePolynomial left recursive primitive part.
`abstract GenSolvablePolynomial<GenPolynomial<C>>`	GreatestCommonDivisorAbstract.`leftRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	Univariate GenSolvablePolynomial recursive greatest common divisor.
`GenSolvablePolynomial<GenPolynomial<C>>`	GreatestCommonDivisorFake.`leftRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	Univariate GenSolvablePolynomial left recursive greatest common divisor.
`GenSolvablePolynomial<GenPolynomial<C>>`	GreatestCommonDivisorPrimitive.`leftRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	Univariate GenSolvablePolynomial left recursive greatest common divisor.
`GenSolvablePolynomial<GenPolynomial<C>>`	GreatestCommonDivisorSimple.`leftRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	Univariate GenSolvablePolynomial left recursive greatest common divisor.
`GenSolvablePolynomial<GenPolynomial<C>>`	GreatestCommonDivisorSyzygy.`leftRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	Univariate GenSolvablePolynomial left recursive greatest common divisor.
`GenSolvablePolynomial<GenPolynomial<C>>`	SGCDParallelProxy.`leftRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	left univariate GenSolvablePolynomial recursive greatest common divisor.
`GenSolvablePolynomial<C>`	SolvableQuotient.`numerator()`	Numerator.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<SolvableQuotient<C>>`	FDUtil.`quotientFromIntegralCoefficients(GenSolvablePolynomialRing<SolvableQuotient<C>> fac, GenSolvablePolynomial<GenPolynomial<C>> A)`	Solvable rational function from integral solvable polynomial coefficients.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`recursiveContent(GenSolvablePolynomial<GenPolynomial<C>> P)`	GenSolvablePolynomial commuting recursive content.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>`	FDUtil.`recursiveDivide(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<C> s)`	GenSolvablePolynomial left recursive quotient for recursive polynomials and exact division by coefficient ring element.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>`	FDUtil.`recursiveDivideRightEval(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<C> s)`	GenSolvablePolynomial recursive quotient for recursive polynomials and exact division by coefficient ring element.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>`	FDUtil.`recursiveLeftDivide(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<C> s)`	GenSolvablePolynomial recursive quotient for recursive polynomials and partial left exact division by coefficient ring element.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>`	FDUtil.`recursivePseudoQuotient(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	GenSolvablePolynomial recursive pseudo quotient for recursive polynomials.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>[]`	FDUtil.`recursivePseudoQuotientRemainder(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	GenSolvablePolynomial recursive pseudo quotient and remainder for recursive polynomials.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>`	FDUtil.`recursiveRightDivide(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<C> s)`	GenSolvablePolynomial recursive quotient for recursive polynomials and partial right exact division by coefficient ring element.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>`	FDUtil.`recursiveRightPseudoQuotient(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	GenSolvablePolynomial recursive right pseudo quotient for recursive polynomials.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>[]`	FDUtil.`recursiveRightPseudoQuotientRemainder(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	GenSolvablePolynomial right sparse pseudo quotient and remainder for recursive solvable polynomials.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>`	FDUtil.`recursiveRightSparsePseudoRemainder(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	GenSolvablePolynomial right sparse pseudo remainder for recursive solvable polynomials.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>`	FDUtil.`recursiveSparsePseudoRemainder(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	GenSolvablePolynomial sparse pseudo remainder for recursive solvable polynomials.
`abstract GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`rightBaseGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Univariate GenSolvablePolynomial right greatest common divisor.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorFake.`rightBaseGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Univariate GenSolvablePolynomial right greatest common divisor.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorPrimitive.`rightBaseGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Univariate GenSolvablePolynomial right greatest common divisor.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorSimple.`rightBaseGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Univariate GenSolvablePolynomial right greatest common divisor.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorSyzygy.`rightBaseGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Right univariate GenSolvablePolynomial greatest common divisor.
`GenSolvablePolynomial<C>`	SGCDParallelProxy.`rightBaseGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Right univariate GenSolvablePolynomial greatest common divisor.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`rightBasePrimitivePart(GenSolvablePolynomial<C> P)`	GenSolvablePolynomial right base coefficient primitive part.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<C>`	FDUtil.`rightBasePseudoQuotient(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial right sparse pseudo quotient for univariate polynomials or exact division.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<C>[]`	FDUtil.`rightBasePseudoQuotientRemainder(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial right sparse pseudo quotient and remainder for univariate polynomials or exact division.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<C>`	FDUtil.`rightBaseSparsePseudoRemainder(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial sparse right pseudo remainder for univariate polynomials.
`GenSolvablePolynomial<C>`	GreatestCommonDivisor.`rightContent(GenSolvablePolynomial<C> P)`	GenSolvablePolynomial right content.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`rightContent(GenSolvablePolynomial<C> P)`	GenSolvablePolynomial right content.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`rightDivide(GenSolvablePolynomial<C> a, C b)`	GenSolvablePolynomial right division.
`GenSolvablePolynomial<C>`	GreatestCommonDivisor.`rightGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial right greatest common divisor.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`rightGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial right greatest common divisor.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorSyzygy.`rightGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Right GenSolvablePolynomial right greatest common divisor.
`GenSolvablePolynomial<C>`	SGCDParallelProxy.`rightGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Right GenSolvablePolynomial greatest common divisor.
`GenSolvablePolynomial<C>[]`	GreatestCommonDivisorAbstract.`rightGcdCofactors(GenSolvablePolynomialRing<C> r, GenSolvablePolynomial<C> n, GenSolvablePolynomial<C> d)`	Right greatest common divisor and cofactors.
`GenSolvablePolynomial<C>`	GreatestCommonDivisor.`rightLcm(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial right least common multiple.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`rightLcm(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial right least common multiple.
`GenSolvablePolynomial<C>[]`	GreatestCommonDivisorAbstract.`rightOreCond(GenSolvablePolynomial<C> a, GenSolvablePolynomial<C> b)`	Right Ore condition.
`GenSolvablePolynomial<C>`	GreatestCommonDivisor.`rightPrimitivePart(GenSolvablePolynomial<C> P)`	GenSolvablePolynomial right primitive part.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`rightPrimitivePart(GenSolvablePolynomial<C> P)`	GenSolvablePolynomial right primitive part.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`rightRecursiveContent(GenSolvablePolynomial<GenPolynomial<C>> P)`	GenSolvablePolynomial right recursive content.
`GenSolvablePolynomial<GenPolynomial<C>>`	GreatestCommonDivisorAbstract.`rightRecursiveGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	GenSolvablePolynomial right recursive greatest common divisor.
`GenSolvablePolynomial<GenPolynomial<C>>`	GreatestCommonDivisorAbstract.`rightRecursivePrimitivePart(GenSolvablePolynomial<GenPolynomial<C>> P)`	GenSolvablePolynomial right recursive primitive part.
`abstract GenSolvablePolynomial<GenPolynomial<C>>`	GreatestCommonDivisorAbstract.`rightRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	Univariate GenSolvablePolynomial right recursive greatest common divisor.
`GenSolvablePolynomial<GenPolynomial<C>>`	GreatestCommonDivisorFake.`rightRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	Univariate GenSolvablePolynomial right recursive greatest common divisor.
`GenSolvablePolynomial<GenPolynomial<C>>`	GreatestCommonDivisorPrimitive.`rightRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	Univariate GenSolvablePolynomial right recursive greatest common divisor.
`GenSolvablePolynomial<GenPolynomial<C>>`	GreatestCommonDivisorSimple.`rightRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	Univariate GenSolvablePolynomial right recursive greatest common divisor.
`GenSolvablePolynomial<GenPolynomial<C>>`	GreatestCommonDivisorSyzygy.`rightRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	Univariate GenSolvablePolynomial right recursive greatest common divisor.
`GenSolvablePolynomial<GenPolynomial<C>>`	SGCDParallelProxy.`rightRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	right univariate GenSolvablePolynomial recursive greatest common divisor.

Methods in edu.jas.fd that return types with arguments of type GenSolvablePolynomial
Modifier and Type	Method	Description
`static <C extends GcdRingElem<C>> java.util.List<GenSolvablePolynomial<GenPolynomial<C>>>`	FDUtil.`integralFromQuotientCoefficients(GenSolvablePolynomialRing<GenPolynomial<C>> fac, java.util.Collection<GenSolvablePolynomial<SolvableQuotient<C>>> L)`	Integral solvable polynomial from solvable rational function coefficients.
`java.util.List<GenSolvablePolynomial<C>>`	GreatestCommonDivisor.`leftCoPrime(java.util.List<GenSolvablePolynomial<C>> A)`	GenSolvablePolynomial left co-prime list.
`java.util.List<GenSolvablePolynomial<C>>`	GreatestCommonDivisorAbstract.`leftCoPrime(GenSolvablePolynomial<C> a, java.util.List<GenSolvablePolynomial<C>> P)`	GenSolvablePolynomial left co-prime list.
`java.util.List<GenSolvablePolynomial<C>>`	GreatestCommonDivisorAbstract.`leftCoPrime(java.util.List<GenSolvablePolynomial<C>> A)`	GenSolvablePolynomial co-prime list.
`java.util.List<GenSolvablePolynomial<C>>`	GreatestCommonDivisorAbstract.`leftCoPrimeRec(java.util.List<GenSolvablePolynomial<C>> A)`	GenSolvablePolynomial left co-prime list.
`static <C extends GcdRingElem<C>> java.util.List<GenSolvablePolynomial<SolvableQuotient<C>>>`	FDUtil.`quotientFromIntegralCoefficients(GenSolvablePolynomialRing<SolvableQuotient<C>> fac, java.util.Collection<GenSolvablePolynomial<GenPolynomial<C>>> L)`	Solvable rational function from integral solvable polynomial coefficients.

Methods in edu.jas.fd with parameters of type GenSolvablePolynomial
Modifier and Type	Method	Description
`GenSolvablePolynomial<C>[]`	GreatestCommonDivisorAbstract.`baseExtendedGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Univariate GenSolvablePolynomial extended greatest common divisor.
`GenSolvablePolynomial<C>[]`	GreatestCommonDivisorAbstract.`baseGcdDiophant(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S, GenSolvablePolynomial<C> c)`	Univariate GenSolvablePolynomial greatest common divisor diophantine version.
`GenSolvablePolynomial<C>[]`	GreatestCommonDivisorAbstract.`baseHalfExtendedGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Univariate GenSolvablePolynomial half extended greatest common divisor.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<C>`	FDUtil.`basePseudoLeftDivide(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial sparse pseudo divide.
`C`	GreatestCommonDivisorAbstract.`baseRecursiveContent(GenSolvablePolynomial<GenPolynomial<C>> P)`	GenSolvablePolynomial base recursive content.
`GenSolvablePolynomial<GenPolynomial<C>>`	GreatestCommonDivisorAbstract.`baseRecursivePrimitivePart(GenSolvablePolynomial<GenPolynomial<C>> P)`	GenSolvablePolynomial base recursive primitive part.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`divide(GenSolvablePolynomial<C> a, C b)`	GenSolvablePolynomial division.
`(package private) static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>`	FDUtil.`experimentalRecursiveLeftDivide(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<C> s)`
`QuotSolvablePolynomial<C>`	QuotSolvablePolynomialRing.`fromPolyCoefficients(GenSolvablePolynomial<GenPolynomial<C>> A)`	Rational function from integral polynomial coefficients.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>`	FDUtil.`integralFromQuotientCoefficients(GenSolvablePolynomialRing<GenPolynomial<C>> fac, GenSolvablePolynomial<SolvableQuotient<C>> A)`	Integral solvable polynomial from solvable rational function coefficients.
`boolean`	GreatestCommonDivisorAbstract.`isLeftOreCond(GenSolvablePolynomial<C> a, GenSolvablePolynomial<C> b, GenSolvablePolynomial<C> p, GenSolvablePolynomial<C> q)`	Is left Ore condition.
`static <C extends GcdRingElem<C>> boolean`	FDUtil.`isRecursivePseudoQuotientRemainder(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S, GenSolvablePolynomial<GenPolynomial<C>> q, GenSolvablePolynomial<GenPolynomial<C>> r)`	Is recursive GenSolvablePolynomial pseudo quotient and remainder.
`static <C extends GcdRingElem<C>> boolean`	FDUtil.`isRecursiveRightPseudoQuotientRemainder(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S, GenSolvablePolynomial<GenPolynomial<C>> q, GenSolvablePolynomial<GenPolynomial<C>> r)`	Is recursive GenSolvablePolynomial right pseudo quotient and remainder.
`boolean`	GreatestCommonDivisorAbstract.`isRightOreCond(GenSolvablePolynomial<C> a, GenSolvablePolynomial<C> b, GenSolvablePolynomial<C> p, GenSolvablePolynomial<C> q)`	Is right Ore condition.
`C`	GreatestCommonDivisorAbstract.`leftBaseContent(GenSolvablePolynomial<C> P)`	GenSolvablePolynomial base coefficient content.
`abstract GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`leftBaseGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Univariate GenSolvablePolynomial greatest common divisor.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorFake.`leftBaseGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Univariate GenSolvablePolynomial greatest common divisor.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorPrimitive.`leftBaseGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Univariate GenSolvablePolynomial greatest common divisor.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorSimple.`leftBaseGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Univariate GenSolvablePolynomial greatest common divisor.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorSyzygy.`leftBaseGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Left univariate GenSolvablePolynomial greatest common divisor.
`GenSolvablePolynomial<C>`	SGCDParallelProxy.`leftBaseGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Left univariate GenSolvablePolynomial greatest common divisor.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`leftBasePrimitivePart(GenSolvablePolynomial<C> P)`	GenSolvablePolynomial base coefficient primitive part.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<C>`	FDUtil.`leftBasePseudoQuotient(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial sparse pseudo quotient for univariate polynomials or exact division.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<C>[]`	FDUtil.`leftBasePseudoQuotientRemainder(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial sparse pseudo quotient and remainder for univariate polynomials or exact division.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<C>`	FDUtil.`leftBaseSparsePseudoRemainder(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial sparse pseudo remainder for univariate polynomials.
`GenSolvablePolynomial<C>`	GreatestCommonDivisor.`leftContent(GenSolvablePolynomial<C> P)`	GenSolvablePolynomial left content.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`leftContent(GenSolvablePolynomial<C> P)`	GenSolvablePolynomial left content.
`java.util.List<GenSolvablePolynomial<C>>`	GreatestCommonDivisorAbstract.`leftCoPrime(GenSolvablePolynomial<C> a, java.util.List<GenSolvablePolynomial<C>> P)`	GenSolvablePolynomial left co-prime list.
`GenSolvablePolynomial<C>`	GreatestCommonDivisor.`leftGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial left greatest common divisor.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`leftGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial greatest common divisor.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorSyzygy.`leftGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Left GenSolvablePolynomial greatest common divisor.
`GenSolvablePolynomial<C>`	SGCDParallelProxy.`leftGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Left GenSolvablePolynomial greatest common divisor.
`GenSolvablePolynomial<C>[]`	GreatestCommonDivisorAbstract.`leftGcdCofactors(GenSolvablePolynomialRing<C> r, GenSolvablePolynomial<C> n, GenSolvablePolynomial<C> d)`	Left greatest common divisor and cofactors.
`GenSolvablePolynomial<C>`	GreatestCommonDivisor.`leftLcm(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial left least common multiple.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`leftLcm(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial left least common multiple.
`GenSolvablePolynomial<C>[]`	GreatestCommonDivisorAbstract.`leftOreCond(GenSolvablePolynomial<C> a, GenSolvablePolynomial<C> b)`	Left Ore condition.
`GenSolvablePolynomial<C>`	GreatestCommonDivisor.`leftPrimitivePart(GenSolvablePolynomial<C> P)`	GenSolvablePolynomial left primitive part.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`leftPrimitivePart(GenSolvablePolynomial<C> P)`	GenSolvablePolynomial left primitive part.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`leftRecursiveContent(GenSolvablePolynomial<GenPolynomial<C>> P)`	GenSolvablePolynomial left recursive content.
`GenSolvablePolynomial<GenPolynomial<C>>`	GreatestCommonDivisorAbstract.`leftRecursiveGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	GenSolvablePolynomial left recursive greatest common divisor.
`GenSolvablePolynomial<GenPolynomial<C>>`	GreatestCommonDivisorAbstract.`leftRecursivePrimitivePart(GenSolvablePolynomial<GenPolynomial<C>> P)`	GenSolvablePolynomial left recursive primitive part.
`abstract GenSolvablePolynomial<GenPolynomial<C>>`	GreatestCommonDivisorAbstract.`leftRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	Univariate GenSolvablePolynomial recursive greatest common divisor.
`GenSolvablePolynomial<GenPolynomial<C>>`	GreatestCommonDivisorFake.`leftRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	Univariate GenSolvablePolynomial left recursive greatest common divisor.
`GenSolvablePolynomial<GenPolynomial<C>>`	GreatestCommonDivisorPrimitive.`leftRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	Univariate GenSolvablePolynomial left recursive greatest common divisor.
`GenSolvablePolynomial<GenPolynomial<C>>`	GreatestCommonDivisorSimple.`leftRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	Univariate GenSolvablePolynomial left recursive greatest common divisor.
`GenSolvablePolynomial<GenPolynomial<C>>`	GreatestCommonDivisorSyzygy.`leftRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	Univariate GenSolvablePolynomial left recursive greatest common divisor.
`GenSolvablePolynomial<GenPolynomial<C>>`	SGCDParallelProxy.`leftRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	left univariate GenSolvablePolynomial recursive greatest common divisor.
`SolvableQuotient<C>`	SolvableQuotient.`multiply(GenSolvablePolynomial<C> b)`	SolvableQuotient multiplication by GenSolvablePolynomial.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<SolvableQuotient<C>>`	FDUtil.`quotientFromIntegralCoefficients(GenSolvablePolynomialRing<SolvableQuotient<C>> fac, GenSolvablePolynomial<GenPolynomial<C>> A)`	Solvable rational function from integral solvable polynomial coefficients.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`recursiveContent(GenSolvablePolynomial<GenPolynomial<C>> P)`	GenSolvablePolynomial commuting recursive content.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>`	FDUtil.`recursiveDivide(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<C> s)`	GenSolvablePolynomial left recursive quotient for recursive polynomials and exact division by coefficient ring element.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>`	FDUtil.`recursiveDivideRightEval(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<C> s)`	GenSolvablePolynomial recursive quotient for recursive polynomials and exact division by coefficient ring element.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>`	FDUtil.`recursiveLeftDivide(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<C> s)`	GenSolvablePolynomial recursive quotient for recursive polynomials and partial left exact division by coefficient ring element.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>`	FDUtil.`recursivePseudoQuotient(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	GenSolvablePolynomial recursive pseudo quotient for recursive polynomials.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>[]`	FDUtil.`recursivePseudoQuotientRemainder(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	GenSolvablePolynomial recursive pseudo quotient and remainder for recursive polynomials.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>`	FDUtil.`recursiveRightDivide(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<C> s)`	GenSolvablePolynomial recursive quotient for recursive polynomials and partial right exact division by coefficient ring element.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>`	FDUtil.`recursiveRightPseudoQuotient(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	GenSolvablePolynomial recursive right pseudo quotient for recursive polynomials.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>[]`	FDUtil.`recursiveRightPseudoQuotientRemainder(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	GenSolvablePolynomial right sparse pseudo quotient and remainder for recursive solvable polynomials.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>`	FDUtil.`recursiveRightSparsePseudoRemainder(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	GenSolvablePolynomial right sparse pseudo remainder for recursive solvable polynomials.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>`	FDUtil.`recursiveSparsePseudoRemainder(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	GenSolvablePolynomial sparse pseudo remainder for recursive solvable polynomials.
`C`	GreatestCommonDivisorAbstract.`rightBaseContent(GenSolvablePolynomial<C> P)`	GenSolvablePolynomial right base coefficient content.
`abstract GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`rightBaseGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Univariate GenSolvablePolynomial right greatest common divisor.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorFake.`rightBaseGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Univariate GenSolvablePolynomial right greatest common divisor.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorPrimitive.`rightBaseGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Univariate GenSolvablePolynomial right greatest common divisor.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorSimple.`rightBaseGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Univariate GenSolvablePolynomial right greatest common divisor.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorSyzygy.`rightBaseGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Right univariate GenSolvablePolynomial greatest common divisor.
`GenSolvablePolynomial<C>`	SGCDParallelProxy.`rightBaseGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Right univariate GenSolvablePolynomial greatest common divisor.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`rightBasePrimitivePart(GenSolvablePolynomial<C> P)`	GenSolvablePolynomial right base coefficient primitive part.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<C>`	FDUtil.`rightBasePseudoQuotient(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial right sparse pseudo quotient for univariate polynomials or exact division.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<C>[]`	FDUtil.`rightBasePseudoQuotientRemainder(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial right sparse pseudo quotient and remainder for univariate polynomials or exact division.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<C>`	FDUtil.`rightBaseSparsePseudoRemainder(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial sparse right pseudo remainder for univariate polynomials.
`GenSolvablePolynomial<C>`	GreatestCommonDivisor.`rightContent(GenSolvablePolynomial<C> P)`	GenSolvablePolynomial right content.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`rightContent(GenSolvablePolynomial<C> P)`	GenSolvablePolynomial right content.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`rightDivide(GenSolvablePolynomial<C> a, C b)`	GenSolvablePolynomial right division.
`GenSolvablePolynomial<C>`	GreatestCommonDivisor.`rightGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial right greatest common divisor.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`rightGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial right greatest common divisor.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorSyzygy.`rightGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Right GenSolvablePolynomial right greatest common divisor.
`GenSolvablePolynomial<C>`	SGCDParallelProxy.`rightGcd(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	Right GenSolvablePolynomial greatest common divisor.
`GenSolvablePolynomial<C>[]`	GreatestCommonDivisorAbstract.`rightGcdCofactors(GenSolvablePolynomialRing<C> r, GenSolvablePolynomial<C> n, GenSolvablePolynomial<C> d)`	Right greatest common divisor and cofactors.
`GenSolvablePolynomial<C>`	GreatestCommonDivisor.`rightLcm(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial right least common multiple.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`rightLcm(GenSolvablePolynomial<C> P, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial right least common multiple.
`GenSolvablePolynomial<C>[]`	GreatestCommonDivisorAbstract.`rightOreCond(GenSolvablePolynomial<C> a, GenSolvablePolynomial<C> b)`	Right Ore condition.
`GenSolvablePolynomial<C>`	GreatestCommonDivisor.`rightPrimitivePart(GenSolvablePolynomial<C> P)`	GenSolvablePolynomial right primitive part.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`rightPrimitivePart(GenSolvablePolynomial<C> P)`	GenSolvablePolynomial right primitive part.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`rightRecursiveContent(GenSolvablePolynomial<GenPolynomial<C>> P)`	GenSolvablePolynomial right recursive content.
`GenSolvablePolynomial<GenPolynomial<C>>`	GreatestCommonDivisorAbstract.`rightRecursiveGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	GenSolvablePolynomial right recursive greatest common divisor.
`GenSolvablePolynomial<GenPolynomial<C>>`	GreatestCommonDivisorAbstract.`rightRecursivePrimitivePart(GenSolvablePolynomial<GenPolynomial<C>> P)`	GenSolvablePolynomial right recursive primitive part.
`abstract GenSolvablePolynomial<GenPolynomial<C>>`	GreatestCommonDivisorAbstract.`rightRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	Univariate GenSolvablePolynomial right recursive greatest common divisor.
`GenSolvablePolynomial<GenPolynomial<C>>`	GreatestCommonDivisorFake.`rightRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	Univariate GenSolvablePolynomial right recursive greatest common divisor.
`GenSolvablePolynomial<GenPolynomial<C>>`	GreatestCommonDivisorPrimitive.`rightRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	Univariate GenSolvablePolynomial right recursive greatest common divisor.
`GenSolvablePolynomial<GenPolynomial<C>>`	GreatestCommonDivisorSimple.`rightRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	Univariate GenSolvablePolynomial right recursive greatest common divisor.
`GenSolvablePolynomial<GenPolynomial<C>>`	GreatestCommonDivisorSyzygy.`rightRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	Univariate GenSolvablePolynomial right recursive greatest common divisor.
`GenSolvablePolynomial<GenPolynomial<C>>`	SGCDParallelProxy.`rightRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)`	right univariate GenSolvablePolynomial recursive greatest common divisor.

Method parameters in edu.jas.fd with type arguments of type GenSolvablePolynomial
Modifier and Type	Method	Description
`static <C extends GcdRingElem<C>> java.util.List<GenSolvablePolynomial<GenPolynomial<C>>>`	FDUtil.`integralFromQuotientCoefficients(GenSolvablePolynomialRing<GenPolynomial<C>> fac, java.util.Collection<GenSolvablePolynomial<SolvableQuotient<C>>> L)`	Integral solvable polynomial from solvable rational function coefficients.
`boolean`	GreatestCommonDivisor.`isLeftCoPrime(java.util.List<GenSolvablePolynomial<C>> A)`	GenSolvablePolynomial test for left co-prime list.
`boolean`	GreatestCommonDivisorAbstract.`isLeftCoPrime(java.util.List<GenSolvablePolynomial<C>> A)`	GenSolvablePolynomial test for co-prime list.
`boolean`	GreatestCommonDivisorAbstract.`isLeftCoPrime(java.util.List<GenSolvablePolynomial<C>> P, java.util.List<GenSolvablePolynomial<C>> A)`	GenSolvablePolynomial test for left co-prime list of given list.
`java.util.List<GenSolvablePolynomial<C>>`	GreatestCommonDivisor.`leftCoPrime(java.util.List<GenSolvablePolynomial<C>> A)`	GenSolvablePolynomial left co-prime list.
`java.util.List<GenSolvablePolynomial<C>>`	GreatestCommonDivisorAbstract.`leftCoPrime(GenSolvablePolynomial<C> a, java.util.List<GenSolvablePolynomial<C>> P)`	GenSolvablePolynomial left co-prime list.
`java.util.List<GenSolvablePolynomial<C>>`	GreatestCommonDivisorAbstract.`leftCoPrime(java.util.List<GenSolvablePolynomial<C>> A)`	GenSolvablePolynomial co-prime list.
`java.util.List<GenSolvablePolynomial<C>>`	GreatestCommonDivisorAbstract.`leftCoPrimeRec(java.util.List<GenSolvablePolynomial<C>> A)`	GenSolvablePolynomial left co-prime list.
`GenSolvablePolynomial<C>`	GreatestCommonDivisorAbstract.`leftGcd(java.util.List<GenSolvablePolynomial<C>> A)`	List of GenSolvablePolynomials left greatest common divisor.
`static <C extends GcdRingElem<C>> java.util.List<GenSolvablePolynomial<SolvableQuotient<C>>>`	FDUtil.`quotientFromIntegralCoefficients(GenSolvablePolynomialRing<SolvableQuotient<C>> fac, java.util.Collection<GenSolvablePolynomial<GenPolynomial<C>>> L)`	Solvable rational function from integral solvable polynomial coefficients.

Constructors in edu.jas.fd with parameters of type GenSolvablePolynomial
Constructor	Description
`QuotSolvablePolynomial(QuotSolvablePolynomialRing<C> r, GenSolvablePolynomial<SolvableQuotient<C>> S)`	Constructor for QuotSolvablePolynomial.
`SolvableQuotient(SolvableQuotientRing<C> r, GenSolvablePolynomial<C> n)`	The constructor creates a SolvableQuotient object from a ring factory and a numerator polynomial.
`SolvableQuotient(SolvableQuotientRing<C> r, GenSolvablePolynomial<C> n, GenSolvablePolynomial<C> d)`	The constructor creates a SolvableQuotient object from a ring factory and a numerator and denominator solvable polynomial.
`SolvableQuotient(SolvableQuotientRing<C> r, GenSolvablePolynomial<C> n, GenSolvablePolynomial<C> d, boolean isred)`	The constructor creates a SolvableQuotient object from a ring factory and a numerator and denominator polynomial.

Uses of GenSolvablePolynomial in edu.jas.gb

Fields in edu.jas.gb declared as GenSolvablePolynomial
Modifier and Type	Field	Description
`private GenSolvablePolynomial<C>`	SolvableMiReducer.`H`
`private GenSolvablePolynomial<C>`	SolvableMiReducerSeqPair.`H`

Fields in edu.jas.gb with type parameters of type GenSolvablePolynomial
Modifier and Type	Field	Description
`java.util.List<GenSolvablePolynomial<C>>`	SolvableExtendedGB.`F`
`java.util.List<java.util.List<GenSolvablePolynomial<C>>>`	SolvableExtendedGB.`F2G`
`private java.util.List<GenSolvablePolynomial<C>>`	LeftSolvableReducer.`G`
`private java.util.List<GenSolvablePolynomial<C>>`	LeftSolvableReducerSeqPair.`G`
`java.util.List<GenSolvablePolynomial<C>>`	SolvableExtendedGB.`G`
`private java.util.List<GenSolvablePolynomial<C>>`	SolvableMiReducer.`G`
`private java.util.List<GenSolvablePolynomial<C>>`	SolvableMiReducerSeqPair.`G`
`private java.util.List<GenSolvablePolynomial<C>>`	TwosidedSolvableReducer.`G`
`private java.util.List<GenSolvablePolynomial<C>>`	TwosidedSolvableReducerSeqPair.`G`
`java.util.List<java.util.List<GenSolvablePolynomial<C>>>`	SolvableExtendedGB.`G2F`
`private java.util.List<GenSolvablePolynomial<C>>`	TwosidedSolvableReducer.`X`
`private java.util.List<GenSolvablePolynomial<C>>`	TwosidedSolvableReducerSeqPair.`X`

Methods in edu.jas.gb that return GenSolvablePolynomial
Modifier and Type	Method	Description
`GenSolvablePolynomial<C>`	SolvableGroebnerBaseAbstract.`constructUnivariate(int i, java.util.List<GenSolvablePolynomial<C>> G)`	Construct univariate solvable polynomial of minimal degree in variable i of a zero dimensional ideal(G).
`GenSolvablePolynomial<C>`	SolvableMiReducer.`getNF()`	getNF.
`GenSolvablePolynomial<C>`	SolvableMiReducerSeqPair.`getNF()`	getNF.
`GenSolvablePolynomial<C>`	SolvableReduction.`leftNormalform(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Left Normalform.
`GenSolvablePolynomial<C>`	SolvableReduction.`leftNormalform(java.util.List<GenSolvablePolynomial<C>> row, java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	LeftNormalform with recording.
`GenSolvablePolynomial<C>`	SolvableReductionPar.`leftNormalform(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Left Normalform.
`GenSolvablePolynomial<C>`	SolvableReductionPar.`leftNormalform(java.util.List<GenSolvablePolynomial<C>> row, java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	LeftNormalform with recording.
`GenSolvablePolynomial<C>`	SolvableReductionSeq.`leftNormalform(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Left Normalform.
`GenSolvablePolynomial<C>`	SolvableReductionSeq.`leftNormalform(java.util.List<GenSolvablePolynomial<C>> row, java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	LeftNormalform with recording.
`GenSolvablePolynomial<C>`	SolvableReduction.`leftSPolynomial(GenSolvablePolynomial<C> Ap, GenSolvablePolynomial<C> Bp)`	Left S-Polynomial.
`GenSolvablePolynomial<C>`	SolvableReduction.`leftSPolynomial(java.util.List<GenSolvablePolynomial<C>> S, int i, GenSolvablePolynomial<C> Ap, int j, GenSolvablePolynomial<C> Bp)`	S-Polynomial with recording.
`GenSolvablePolynomial<C>`	SolvableReductionAbstract.`leftSPolynomial(GenSolvablePolynomial<C> Ap, GenSolvablePolynomial<C> Bp)`	Left S-Polynomial.
`GenSolvablePolynomial<C>`	SolvableReductionAbstract.`leftSPolynomial(java.util.List<GenSolvablePolynomial<C>> S, int i, GenSolvablePolynomial<C> Ap, int j, GenSolvablePolynomial<C> Bp)`	S-Polynomial with recording.
`GenSolvablePolynomial<C>`	SolvableReduction.`normalform(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Two-sided Normalform.
`GenSolvablePolynomial<C>`	SolvableReductionAbstract.`normalform(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Two-sided Normalform.
`GenSolvablePolynomial<C>`	SolvableReduction.`rightNormalform(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Right Normalform.
`GenSolvablePolynomial<C>`	SolvableReduction.`rightNormalform(java.util.List<GenSolvablePolynomial<C>> row, java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	RightNormalform with recording.
`GenSolvablePolynomial<C>`	SolvableReductionPar.`rightNormalform(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Right Normalform.
`GenSolvablePolynomial<C>`	SolvableReductionPar.`rightNormalform(java.util.List<GenSolvablePolynomial<C>> row, java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	RightNormalform with recording.
`GenSolvablePolynomial<C>`	SolvableReductionSeq.`rightNormalform(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Right Normalform.
`GenSolvablePolynomial<C>`	SolvableReductionSeq.`rightNormalform(java.util.List<GenSolvablePolynomial<C>> row, java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	RightNormalform with recording.
`GenSolvablePolynomial<C>`	SolvableReduction.`rightSPolynomial(GenSolvablePolynomial<C> Ap, GenSolvablePolynomial<C> Bp)`	Right S-Polynomial.
`GenSolvablePolynomial<C>`	SolvableReductionAbstract.`rightSPolynomial(GenSolvablePolynomial<C> Ap, GenSolvablePolynomial<C> Bp)`	Right S-Polynomial.
`GenSolvablePolynomial<C>`	SolvableReductionAbstract.`rightSPolynomial(java.util.List<GenSolvablePolynomial<C>> S, int i, GenSolvablePolynomial<C> Ap, int j, GenSolvablePolynomial<C> Bp)`	S-Polynomial with recording.

Methods in edu.jas.gb with parameters of type GenSolvablePolynomial
Modifier and Type	Method	Description
`boolean`	SolvableReduction.`isLeftReductionNF(java.util.List<GenSolvablePolynomial<C>> row, java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap, GenSolvablePolynomial<C> Np)`	Is reduction of normal form.
`boolean`	SolvableReductionAbstract.`isLeftReductionNF(java.util.List<GenSolvablePolynomial<C>> row, java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap, GenSolvablePolynomial<C> Np)`	Is reduction of normal form.
`boolean`	SolvableReduction.`isNormalform(java.util.List<GenSolvablePolynomial<C>> P, GenSolvablePolynomial<C> A)`	Is in normalform.
`boolean`	SolvableReductionAbstract.`isNormalform(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Is in Normalform.
`boolean`	SolvableReduction.`isReducible(java.util.List<GenSolvablePolynomial<C>> P, GenSolvablePolynomial<C> A)`	Is reducible.
`boolean`	SolvableReductionAbstract.`isReducible(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Is reducible.
`boolean`	SolvableReduction.`isRightReductionNF(java.util.List<GenSolvablePolynomial<C>> row, java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap, GenSolvablePolynomial<C> Np)`	Is right reduction of normal form.
`boolean`	SolvableReductionAbstract.`isRightReductionNF(java.util.List<GenSolvablePolynomial<C>> row, java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap, GenSolvablePolynomial<C> Np)`	Is right reduction of normal form.
`boolean`	SolvableReduction.`isTopReducible(java.util.List<GenSolvablePolynomial<C>> P, GenSolvablePolynomial<C> A)`	Is top reducible.
`boolean`	SolvableReductionAbstract.`isTopReducible(java.util.List<GenSolvablePolynomial<C>> P, GenSolvablePolynomial<C> A)`	Is top reducible.
`GenSolvablePolynomial<C>`	SolvableReduction.`leftNormalform(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Left Normalform.
`GenSolvablePolynomial<C>`	SolvableReduction.`leftNormalform(java.util.List<GenSolvablePolynomial<C>> row, java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	LeftNormalform with recording.
`GenSolvablePolynomial<C>`	SolvableReductionPar.`leftNormalform(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Left Normalform.
`GenSolvablePolynomial<C>`	SolvableReductionPar.`leftNormalform(java.util.List<GenSolvablePolynomial<C>> row, java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	LeftNormalform with recording.
`GenSolvablePolynomial<C>`	SolvableReductionSeq.`leftNormalform(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Left Normalform.
`GenSolvablePolynomial<C>`	SolvableReductionSeq.`leftNormalform(java.util.List<GenSolvablePolynomial<C>> row, java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	LeftNormalform with recording.
`GenSolvablePolynomial<C>`	SolvableReduction.`leftSPolynomial(GenSolvablePolynomial<C> Ap, GenSolvablePolynomial<C> Bp)`	Left S-Polynomial.
`GenSolvablePolynomial<C>`	SolvableReduction.`leftSPolynomial(java.util.List<GenSolvablePolynomial<C>> S, int i, GenSolvablePolynomial<C> Ap, int j, GenSolvablePolynomial<C> Bp)`	S-Polynomial with recording.
`GenSolvablePolynomial<C>`	SolvableReductionAbstract.`leftSPolynomial(GenSolvablePolynomial<C> Ap, GenSolvablePolynomial<C> Bp)`	Left S-Polynomial.
`GenSolvablePolynomial<C>`	SolvableReductionAbstract.`leftSPolynomial(java.util.List<GenSolvablePolynomial<C>> S, int i, GenSolvablePolynomial<C> Ap, int j, GenSolvablePolynomial<C> Bp)`	S-Polynomial with recording.
`GenSolvablePolynomial<C>`	SolvableReduction.`normalform(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Two-sided Normalform.
`GenSolvablePolynomial<C>`	SolvableReductionAbstract.`normalform(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Two-sided Normalform.
`GenSolvablePolynomial<C>`	SolvableReduction.`rightNormalform(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Right Normalform.
`GenSolvablePolynomial<C>`	SolvableReduction.`rightNormalform(java.util.List<GenSolvablePolynomial<C>> row, java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	RightNormalform with recording.
`GenSolvablePolynomial<C>`	SolvableReductionPar.`rightNormalform(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Right Normalform.
`GenSolvablePolynomial<C>`	SolvableReductionPar.`rightNormalform(java.util.List<GenSolvablePolynomial<C>> row, java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	RightNormalform with recording.
`GenSolvablePolynomial<C>`	SolvableReductionSeq.`rightNormalform(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Right Normalform.
`GenSolvablePolynomial<C>`	SolvableReductionSeq.`rightNormalform(java.util.List<GenSolvablePolynomial<C>> row, java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	RightNormalform with recording.
`GenSolvablePolynomial<C>`	SolvableReduction.`rightSPolynomial(GenSolvablePolynomial<C> Ap, GenSolvablePolynomial<C> Bp)`	Right S-Polynomial.
`GenSolvablePolynomial<C>`	SolvableReductionAbstract.`rightSPolynomial(GenSolvablePolynomial<C> Ap, GenSolvablePolynomial<C> Bp)`	Right S-Polynomial.
`GenSolvablePolynomial<C>`	SolvableReductionAbstract.`rightSPolynomial(java.util.List<GenSolvablePolynomial<C>> S, int i, GenSolvablePolynomial<C> Ap, int j, GenSolvablePolynomial<C> Bp)`	S-Polynomial with recording.

Method parameters in edu.jas.gb with type arguments of type GenSolvablePolynomial
Modifier and Type	Method	Description
`int`	SolvableGroebnerBaseAbstract.`commonZeroTest(java.util.List<GenSolvablePolynomial<C>> A)`	Ideal common zero test.
`GenSolvablePolynomial<C>`	SolvableGroebnerBaseAbstract.`constructUnivariate(int i, java.util.List<GenSolvablePolynomial<C>> G)`	Construct univariate solvable polynomial of minimal degree in variable i of a zero dimensional ideal(G).
`java.util.List<GenSolvablePolynomial<C>>`	SolvableGroebnerBaseAbstract.`constructUnivariate(java.util.List<GenSolvablePolynomial<C>> G)`	Construct univariate solvable polynomials of minimal degree in all variables in zero dimensional left ideal(G).
`SolvableExtendedGB<C>`	SolvableGroebnerBase.`extLeftGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Solvable Extended Groebner base using critical pair class.
`SolvableExtendedGB<C>`	SolvableGroebnerBase.`extLeftGB(java.util.List<GenSolvablePolynomial<C>> F)`	Solvable Extended Groebner base using critical pair class.
`SolvableExtendedGB<C>`	SolvableGroebnerBaseAbstract.`extLeftGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Solvable Extended Groebner base using critical pair class.
`SolvableExtendedGB<C>`	SolvableGroebnerBaseAbstract.`extLeftGB(java.util.List<GenSolvablePolynomial<C>> F)`	Solvable Extended Groebner base using critical pair class.
`SolvableExtendedGB<C>`	SolvableGroebnerBaseSeq.`extLeftGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Solvable Extended Groebner base using critical pair class.
`SolvableExtendedGB<C>`	SolvableGroebnerBaseAbstract.`extRightGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Solvable Extended Groebner base using critical pair class.
`SolvableExtendedGB<C>`	SolvableGroebnerBaseAbstract.`extRightGB(java.util.List<GenSolvablePolynomial<C>> F)`	Solvable Extended Groebner base using critical pair class.
`boolean`	SolvableGroebnerBase.`isLeftGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Left Groebner base test.
`boolean`	SolvableGroebnerBase.`isLeftGB(java.util.List<GenSolvablePolynomial<C>> F)`	Left Groebner base test.
`boolean`	SolvableGroebnerBaseAbstract.`isLeftGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Left Groebner base test.
`boolean`	SolvableGroebnerBaseAbstract.`isLeftGB(int modv, java.util.List<GenSolvablePolynomial<C>> F, boolean b)`	Left Groebner base test.
`boolean`	SolvableGroebnerBaseAbstract.`isLeftGB(java.util.List<GenSolvablePolynomial<C>> F)`	Left Groebner base test.
`boolean`	SolvableGroebnerBaseAbstract.`isLeftGB(java.util.List<GenSolvablePolynomial<C>> F, boolean b)`	Left Groebner base test.
`boolean`	SolvableGroebnerBaseAbstract.`isLeftGBidem(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Left Groebner base idempotence test.
`boolean`	SolvableGroebnerBaseAbstract.`isLeftGBsimple(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Left Groebner base test.
`boolean`	SolvableGroebnerBase.`isLeftReductionMatrix(java.util.List<GenSolvablePolynomial<C>> F, java.util.List<GenSolvablePolynomial<C>> G, java.util.List<java.util.List<GenSolvablePolynomial<C>>> Mf, java.util.List<java.util.List<GenSolvablePolynomial<C>>> Mg)`	Test if left reduction matrix.
`boolean`	SolvableGroebnerBaseAbstract.`isLeftReductionMatrix(java.util.List<GenSolvablePolynomial<C>> F, java.util.List<GenSolvablePolynomial<C>> G, java.util.List<java.util.List<GenSolvablePolynomial<C>>> Mf, java.util.List<java.util.List<GenSolvablePolynomial<C>>> Mg)`	Test if left reduction matrix.
`boolean`	SolvableReduction.`isLeftReductionNF(java.util.List<GenSolvablePolynomial<C>> row, java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap, GenSolvablePolynomial<C> Np)`	Is reduction of normal form.
`boolean`	SolvableReductionAbstract.`isLeftReductionNF(java.util.List<GenSolvablePolynomial<C>> row, java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap, GenSolvablePolynomial<C> Np)`	Is reduction of normal form.
`boolean`	SolvableReduction.`isNormalform(java.util.List<GenSolvablePolynomial<C>> P, GenSolvablePolynomial<C> A)`	Is in normalform.
`boolean`	SolvableReductionAbstract.`isNormalform(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Is in Normalform.
`boolean`	SolvableReduction.`isReducible(java.util.List<GenSolvablePolynomial<C>> P, GenSolvablePolynomial<C> A)`	Is reducible.
`boolean`	SolvableReductionAbstract.`isReducible(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Is reducible.
`boolean`	SolvableGroebnerBase.`isRightGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Right Groebner base test.
`boolean`	SolvableGroebnerBase.`isRightGB(java.util.List<GenSolvablePolynomial<C>> F)`	Right Groebner base test.
`boolean`	SolvableGroebnerBaseAbstract.`isRightGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Right Groebner base test.
`boolean`	SolvableGroebnerBaseAbstract.`isRightGB(java.util.List<GenSolvablePolynomial<C>> F)`	Right Groebner base test.
`boolean`	SolvableGroebnerBaseAbstract.`isRightGBidem(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Right Groebner base idempotence test.
`boolean`	SolvableGroebnerBaseAbstract.`isRightGBidem(java.util.List<GenSolvablePolynomial<C>> F)`	Right Groebner base idempotence test.
`boolean`	SolvableReduction.`isRightReductionNF(java.util.List<GenSolvablePolynomial<C>> row, java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap, GenSolvablePolynomial<C> Np)`	Is right reduction of normal form.
`boolean`	SolvableReductionAbstract.`isRightReductionNF(java.util.List<GenSolvablePolynomial<C>> row, java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap, GenSolvablePolynomial<C> Np)`	Is right reduction of normal form.
`boolean`	SolvableReduction.`isTopReducible(java.util.List<GenSolvablePolynomial<C>> P, GenSolvablePolynomial<C> A)`	Is top reducible.
`boolean`	SolvableReductionAbstract.`isTopReducible(java.util.List<GenSolvablePolynomial<C>> P, GenSolvablePolynomial<C> A)`	Is top reducible.
`boolean`	SolvableGroebnerBase.`isTwosidedGB(int modv, java.util.List<GenSolvablePolynomial<C>> Fp)`	Twosided Groebner base test.
`boolean`	SolvableGroebnerBase.`isTwosidedGB(java.util.List<GenSolvablePolynomial<C>> Fp)`	Twosided Groebner base test.
`boolean`	SolvableGroebnerBaseAbstract.`isTwosidedGB(int modv, java.util.List<GenSolvablePolynomial<C>> Fp)`	Twosided Groebner base test.
`boolean`	SolvableGroebnerBaseAbstract.`isTwosidedGB(java.util.List<GenSolvablePolynomial<C>> Fp)`	Twosided Groebner base test.
`boolean`	SolvableGroebnerBaseAbstract.`isTwosidedGBidem(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Twosided Groebner base idempotence test.
`boolean`	SolvableGroebnerBaseAbstract.`isTwosidedGBidem(java.util.List<GenSolvablePolynomial<C>> F)`	Twosided Groebner base idempotence test.
`java.util.List<GenSolvablePolynomial<C>>`	SGBProxy.`leftGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Groebner base.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableGroebnerBase.`leftGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Left Groebner base using pairlist class.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableGroebnerBase.`leftGB(java.util.List<GenSolvablePolynomial<C>> F)`	Left Groebner base using pairlist class.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableGroebnerBaseAbstract.`leftGB(java.util.List<GenSolvablePolynomial<C>> F)`	Left Groebner base using pairlist class.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableGroebnerBaseParallel.`leftGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Parallel Groebner base using sequential pair order class.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableGroebnerBaseSeq.`leftGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Left Groebner base using pairlist class.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableGroebnerBaseSeqPairParallel.`leftGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Parallel Groebner base using sequential pair order class.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableReduction.`leftIrreducibleSet(java.util.List<GenSolvablePolynomial<C>> Pp)`	Left irreducible set.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableReductionAbstract.`leftIrreducibleSet(java.util.List<GenSolvablePolynomial<C>> Pp)`	Left irreducible set.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableGroebnerBase.`leftMinimalGB(java.util.List<GenSolvablePolynomial<C>> Gp)`	Left minimal ordered groebner basis.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableGroebnerBaseAbstract.`leftMinimalGB(java.util.List<GenSolvablePolynomial<C>> Gp)`	Left minimal ordered groebner basis.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableGroebnerBaseParallel.`leftMinimalGB(java.util.List<GenSolvablePolynomial<C>> Fp)`	Minimal ordered groebner basis, parallel.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableGroebnerBaseSeqPairParallel.`leftMinimalGB(java.util.List<GenSolvablePolynomial<C>> Fp)`	Minimal ordered groebner basis, parallel.
`GenSolvablePolynomial<C>`	SolvableReduction.`leftNormalform(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Left Normalform.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableReduction.`leftNormalform(java.util.List<GenSolvablePolynomial<C>> Pp, java.util.List<GenSolvablePolynomial<C>> Ap)`	Left Normalform Set.
`GenSolvablePolynomial<C>`	SolvableReduction.`leftNormalform(java.util.List<GenSolvablePolynomial<C>> row, java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	LeftNormalform with recording.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableReductionAbstract.`leftNormalform(java.util.List<GenSolvablePolynomial<C>> Pp, java.util.List<GenSolvablePolynomial<C>> Ap)`	Left Normalform Set.
`GenSolvablePolynomial<C>`	SolvableReductionPar.`leftNormalform(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Left Normalform.
`GenSolvablePolynomial<C>`	SolvableReductionPar.`leftNormalform(java.util.List<GenSolvablePolynomial<C>> row, java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	LeftNormalform with recording.
`GenSolvablePolynomial<C>`	SolvableReductionSeq.`leftNormalform(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Left Normalform.
`GenSolvablePolynomial<C>`	SolvableReductionSeq.`leftNormalform(java.util.List<GenSolvablePolynomial<C>> row, java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	LeftNormalform with recording.
`GenSolvablePolynomial<C>`	SolvableReduction.`leftSPolynomial(java.util.List<GenSolvablePolynomial<C>> S, int i, GenSolvablePolynomial<C> Ap, int j, GenSolvablePolynomial<C> Bp)`	S-Polynomial with recording.
`GenSolvablePolynomial<C>`	SolvableReductionAbstract.`leftSPolynomial(java.util.List<GenSolvablePolynomial<C>> S, int i, GenSolvablePolynomial<C> Ap, int j, GenSolvablePolynomial<C> Bp)`	S-Polynomial with recording.
`SolvableExtendedGB<C>`	SolvableGroebnerBaseSeq.`minimalSolvableExtendedGB(int flen, java.util.List<GenSolvablePolynomial<C>> Gp, java.util.List<java.util.List<GenSolvablePolynomial<C>>> M)`	Minimal solvable extended groebner basis.
`GenSolvablePolynomial<C>`	SolvableReduction.`normalform(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Two-sided Normalform.
`GenSolvablePolynomial<C>`	SolvableReductionAbstract.`normalform(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Two-sided Normalform.
`java.util.List<java.util.List<GenSolvablePolynomial<C>>>`	SolvableGroebnerBaseSeq.`normalizeMatrix(int flen, java.util.List<java.util.List<GenSolvablePolynomial<C>>> M)`	Normalize M.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableGroebnerBaseAbstract.`normalizeZerosOnes(java.util.List<GenSolvablePolynomial<C>> A)`	Normalize polynomial list.
`java.util.List<GenSolvablePolynomial<C>>`	SGBProxy.`rightGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Right Groebner base.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableGroebnerBase.`rightGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Right Groebner base using opposite ring left GB.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableGroebnerBase.`rightGB(java.util.List<GenSolvablePolynomial<C>> F)`	Right Groebner base using opposite ring left GB.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableGroebnerBaseAbstract.`rightGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Right Groebner base using opposite ring left GB.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableGroebnerBaseAbstract.`rightGB(java.util.List<GenSolvablePolynomial<C>> F)`	Right Groebner base using opposite ring left GB.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableGroebnerBaseSeq.`rightGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Right Groebner base via right reduction using pairlist class.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableGroebnerBaseAbstract.`rightMinimalGB(java.util.List<GenSolvablePolynomial<C>> Gp)`	Right minimal ordered groebner basis.
`GenSolvablePolynomial<C>`	SolvableReduction.`rightNormalform(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Right Normalform.
`GenSolvablePolynomial<C>`	SolvableReduction.`rightNormalform(java.util.List<GenSolvablePolynomial<C>> row, java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	RightNormalform with recording.
`GenSolvablePolynomial<C>`	SolvableReductionPar.`rightNormalform(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Right Normalform.
`GenSolvablePolynomial<C>`	SolvableReductionPar.`rightNormalform(java.util.List<GenSolvablePolynomial<C>> row, java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	RightNormalform with recording.
`GenSolvablePolynomial<C>`	SolvableReductionSeq.`rightNormalform(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Right Normalform.
`GenSolvablePolynomial<C>`	SolvableReductionSeq.`rightNormalform(java.util.List<GenSolvablePolynomial<C>> row, java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	RightNormalform with recording.
`GenSolvablePolynomial<C>`	SolvableReductionAbstract.`rightSPolynomial(java.util.List<GenSolvablePolynomial<C>> S, int i, GenSolvablePolynomial<C> Ap, int j, GenSolvablePolynomial<C> Bp)`	S-Polynomial with recording.
`java.util.List<GenSolvablePolynomial<C>>`	SGBProxy.`twosidedGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Groebner base.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableGroebnerBase.`twosidedGB(int modv, java.util.List<GenSolvablePolynomial<C>> Fp)`	Twosided Groebner base using pairlist class.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableGroebnerBase.`twosidedGB(java.util.List<GenSolvablePolynomial<C>> Fp)`	Twosided Groebner base using pairlist class.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableGroebnerBaseAbstract.`twosidedGB(java.util.List<GenSolvablePolynomial<C>> Fp)`	Twosided Groebner base using pairlist class.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableGroebnerBaseParallel.`twosidedGB(int modv, java.util.List<GenSolvablePolynomial<C>> Fp)`	Twosided Groebner base using pairlist class.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableGroebnerBaseSeq.`twosidedGB(int modv, java.util.List<GenSolvablePolynomial<C>> Fp)`	Twosided Groebner base using pairlist class.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableGroebnerBaseSeqPairParallel.`twosidedGB(int modv, java.util.List<GenSolvablePolynomial<C>> Fp)`	Twosided Groebner base using pairlist class.
`java.util.List<java.lang.Long>`	SolvableGroebnerBaseAbstract.`univariateDegrees(java.util.List<GenSolvablePolynomial<C>> A)`	Univariate head term degrees.

Constructors in edu.jas.gb with parameters of type GenSolvablePolynomial
Constructor	Description
`SolvableMiReducer(java.util.List<GenSolvablePolynomial<C>> G, GenSolvablePolynomial<C> p)`
`SolvableMiReducerSeqPair(java.util.List<GenSolvablePolynomial<C>> G, GenSolvablePolynomial<C> p)`

Constructor parameters in edu.jas.gb with type arguments of type GenSolvablePolynomial
Constructor	Description
`LeftSolvableReducer(Terminator fin, java.util.List<GenSolvablePolynomial<C>> G, PairList<C> L)`
`LeftSolvableReducerSeqPair(Terminator fin, java.util.List<GenSolvablePolynomial<C>> G, CriticalPairList<C> L)`
`SolvableExtendedGB(java.util.List<GenSolvablePolynomial<C>> F, java.util.List<GenSolvablePolynomial<C>> G, java.util.List<java.util.List<GenSolvablePolynomial<C>>> F2G, java.util.List<java.util.List<GenSolvablePolynomial<C>>> G2F)`	Container for a GB and transformation matrices.
`SolvableMiReducer(java.util.List<GenSolvablePolynomial<C>> G, GenSolvablePolynomial<C> p)`
`SolvableMiReducerSeqPair(java.util.List<GenSolvablePolynomial<C>> G, GenSolvablePolynomial<C> p)`
`TwosidedSolvableReducer(Terminator fin, int modv, java.util.List<GenSolvablePolynomial<C>> X, java.util.List<GenSolvablePolynomial<C>> G, PairList<C> L)`
`TwosidedSolvableReducerSeqPair(Terminator fin, java.util.List<GenSolvablePolynomial<C>> X, java.util.List<GenSolvablePolynomial<C>> G, CriticalPairList<C> L)`

Uses of GenSolvablePolynomial in edu.jas.gbmod

Methods in edu.jas.gbmod that return types with arguments of type GenSolvablePolynomial
Modifier and Type	Method	Description
`java.util.List<GenSolvablePolynomial<C>>`	ModSolvableGroebnerBase.`leftGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Deprecated. Left Groebner base using pairlist class.
`java.util.List<GenSolvablePolynomial<C>>`	ModSolvableGroebnerBaseSeq.`leftGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Deprecated. Left Groebner base using pairlist class.
`java.util.List<GenSolvablePolynomial<C>>`	ModSolvableGroebnerBase.`rightGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Deprecated. Right Groebner base using pairlist class.
`java.util.List<GenSolvablePolynomial<C>>`	ModSolvableGroebnerBaseSeq.`rightGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Deprecated. Right Groebner base using pairlist class.
`java.util.List<GenSolvablePolynomial<C>>`	ModSolvableGroebnerBase.`twosidedGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Deprecated. Twosided Groebner base using pairlist class.
`java.util.List<GenSolvablePolynomial<C>>`	ModSolvableGroebnerBaseSeq.`twosidedGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Deprecated. Twosided Groebner base using pairlist class.

Method parameters in edu.jas.gbmod with type arguments of type GenSolvablePolynomial
Modifier and Type	Method	Description
`boolean`	ModSolvableGroebnerBase.`isLeftGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Deprecated. Module left Groebner base test.
`boolean`	ModSolvableGroebnerBaseSeq.`isLeftGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Deprecated. Module left Groebner base test.
`boolean`	ModSolvableGroebnerBase.`isRightGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Deprecated. Module right Groebner base test.
`boolean`	ModSolvableGroebnerBaseSeq.`isRightGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Deprecated. Module right Groebner base test.
`boolean`	ModSolvableGroebnerBase.`isTwosidedGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Deprecated. Module twosided Groebner base test.
`boolean`	ModSolvableGroebnerBaseSeq.`isTwosidedGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Deprecated. Module twosided Groebner base test.
`java.util.List<GenSolvablePolynomial<C>>`	ModSolvableGroebnerBase.`leftGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Deprecated. Left Groebner base using pairlist class.
`java.util.List<GenSolvablePolynomial<C>>`	ModSolvableGroebnerBaseSeq.`leftGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Deprecated. Left Groebner base using pairlist class.
`java.util.List<GenSolvablePolynomial<C>>`	ModSolvableGroebnerBase.`rightGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Deprecated. Right Groebner base using pairlist class.
`java.util.List<GenSolvablePolynomial<C>>`	ModSolvableGroebnerBaseSeq.`rightGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Deprecated. Right Groebner base using pairlist class.
`java.util.List<GenSolvablePolynomial<C>>`	ModSolvableGroebnerBase.`twosidedGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Deprecated. Twosided Groebner base using pairlist class.
`java.util.List<GenSolvablePolynomial<C>>`	ModSolvableGroebnerBaseSeq.`twosidedGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Deprecated. Twosided Groebner base using pairlist class.

Uses of GenSolvablePolynomial in edu.jas.gbufd

Methods in edu.jas.gbufd that return GenSolvablePolynomial
Modifier and Type	Method	Description
`GenSolvablePolynomial<C>`	SolvablePseudoReductionSeq.`leftNormalform(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Left normalform.
`GenSolvablePolynomial<C>`	SolvablePseudoReductionSeq.`leftNormalform(java.util.List<GenSolvablePolynomial<C>> row, java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Left normalform with recording.
`GenSolvablePolynomial<GenPolynomial<C>>`	SolvablePseudoReduction.`leftNormalformRecursive(java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> Pp, GenSolvablePolynomial<GenPolynomial<C>> Ap)`	Left normalform recursive.
`GenSolvablePolynomial<GenPolynomial<C>>`	SolvablePseudoReductionSeq.`leftNormalformRecursive(java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> Pp, GenSolvablePolynomial<GenPolynomial<C>> Ap)`	Left normalform recursive.
`GenSolvablePolynomial<C>[]`	SolvableSyzygy.`leftOreCond(GenSolvablePolynomial<C> a, GenSolvablePolynomial<C> b)`	Left Ore condition.
`GenSolvablePolynomial<C>[]`	SolvableSyzygySeq.`leftOreCond(GenSolvablePolynomial<C> a, GenSolvablePolynomial<C> b)`	Left Ore condition.
`abstract GenSolvablePolynomial<C>[]`	SolvableSyzygyAbstract.`leftSimplifier(GenSolvablePolynomial<C> a, GenSolvablePolynomial<C> b)`	Left simplifier.
`GenSolvablePolynomial<C>[]`	SolvableSyzygySeq.`leftSimplifier(GenSolvablePolynomial<C> a, GenSolvablePolynomial<C> b)`	Left simplifier.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<C>[]`	PolyGBUtil.`quotientRemainder(GenSolvablePolynomial<C> n, GenSolvablePolynomial<C> d)`	Solvable quotient and remainder via reduction.
`GenSolvablePolynomial<C>`	SolvablePseudoReductionSeq.`rightNormalform(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Right normalform.
`GenSolvablePolynomial<C>`	SolvablePseudoReductionSeq.`rightNormalform(java.util.List<GenSolvablePolynomial<C>> row, java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Right normalform with recording.
`GenSolvablePolynomial<GenPolynomial<C>>`	SolvablePseudoReduction.`rightNormalformRecursive(java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> Pp, GenSolvablePolynomial<GenPolynomial<C>> Ap)`	Right normalform recursive.
`GenSolvablePolynomial<GenPolynomial<C>>`	SolvablePseudoReductionSeq.`rightNormalformRecursive(java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> Pp, GenSolvablePolynomial<GenPolynomial<C>> Ap)`	Right normalform recursive.
`GenSolvablePolynomial<C>[]`	SolvableSyzygy.`rightOreCond(GenSolvablePolynomial<C> a, GenSolvablePolynomial<C> b)`	Right Ore condition.
`GenSolvablePolynomial<C>[]`	SolvableSyzygySeq.`rightOreCond(GenSolvablePolynomial<C> a, GenSolvablePolynomial<C> b)`	Right Ore condition.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<C>`	PolyModUtil.`syzGcd(GenSolvablePolynomialRing<C> r, GenSolvablePolynomial<C> n, GenSolvablePolynomial<C> d)`	Greatest common divisor via least common multiple.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<C>[]`	PolyModUtil.`syzGcdCofactors(GenSolvablePolynomialRing<C> r, GenSolvablePolynomial<C> n, GenSolvablePolynomial<C> d)`	Greatest common divisor and cofactors via least common multiple and reduction.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<C>`	PolyModUtil.`syzLcm(GenSolvablePolynomialRing<C> r, GenSolvablePolynomial<C> n, GenSolvablePolynomial<C> d)`	Least common multiple via ideal intersection.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<C>`	PolyModUtil.`syzLeftGcd(GenSolvablePolynomialRing<C> r, GenSolvablePolynomial<C> n, GenSolvablePolynomial<C> d)`	Left greatest common divisor via least common multiple.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<C>`	PolyModUtil.`syzRightGcd(GenSolvablePolynomialRing<C> r, GenSolvablePolynomial<C> n, GenSolvablePolynomial<C> d)`	Right greatest common divisor via least common multiple.

Methods in edu.jas.gbufd that return types with arguments of type GenSolvablePolynomial
Modifier and Type	Method	Description
`static <C extends GcdRingElem<C>> java.util.List<GenSolvablePolynomial<C>>`	PolyGBUtil.`intersect(GenSolvablePolynomialRing<C> pfac, java.util.List<GenSolvablePolynomial<C>> A, java.util.List<GenSolvablePolynomial<C>> B)`	Intersection.
`java.util.List<GenSolvablePolynomial<GenPolynomial<C>>>`	SolvableGroebnerBasePseudoRecSeq.`leftGB(int modv, java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> F)`	Left Groebner base using pairlist class.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableGroebnerBasePseudoSeq.`leftGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Left Groebner base using pairlist class.
`java.util.List<GenSolvablePolynomial<GenPolynomial<C>>>`	SolvableGroebnerBasePseudoRecSeq.`leftMinimalGB(java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> Gp)`	Minimal ordered Solvable Groebner basis.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableGroebnerBasePseudoSeq.`leftMinimalGB(java.util.List<GenSolvablePolynomial<C>> Gp)`	Minimal ordered Solvable Groebner basis.
`java.util.List<java.util.List<GenSolvablePolynomial<C>>>`	SolvableSyzygy.`leftZeroRelations(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Left syzygy for left Groebner base.
`java.util.List<java.util.List<GenSolvablePolynomial<C>>>`	SolvableSyzygy.`leftZeroRelations(java.util.List<GenSolvablePolynomial<C>> F)`	Left syzygy for left Groebner base.
`java.util.List<java.util.List<GenSolvablePolynomial<C>>>`	SolvableSyzygyAbstract.`leftZeroRelations(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Left syzygy for left Groebner base.
`java.util.List<java.util.List<GenSolvablePolynomial<C>>>`	SolvableSyzygyAbstract.`leftZeroRelations(java.util.List<GenSolvablePolynomial<C>> F)`	Left syzygy for left Groebner base.
`java.util.List<java.util.List<GenSolvablePolynomial<C>>>`	SolvableSyzygy.`leftZeroRelationsArbitrary(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Left syzygy module from arbitrary base.
`java.util.List<java.util.List<GenSolvablePolynomial<C>>>`	SolvableSyzygy.`leftZeroRelationsArbitrary(java.util.List<GenSolvablePolynomial<C>> F)`	Left syzygy module from arbitrary base.
`java.util.List<java.util.List<GenSolvablePolynomial<C>>>`	SolvableSyzygyAbstract.`leftZeroRelationsArbitrary(java.util.List<GenSolvablePolynomial<C>> F)`	Left syzygy module from arbitrary base.
`java.util.List<java.util.List<GenSolvablePolynomial<C>>>`	SolvableSyzygySeq.`leftZeroRelationsArbitrary(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Left syzygy module from arbitrary base.
`java.util.List<java.util.List<GenSolvablePolynomial<C>>>`	SolvableSyzygyAbstract.`rightZeroRelations(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Right syzygy module from Groebner base.
`java.util.List<java.util.List<GenSolvablePolynomial<C>>>`	SolvableSyzygyAbstract.`rightZeroRelations(java.util.List<GenSolvablePolynomial<C>> F)`	Right syzygy module from Groebner base.
`java.util.List<java.util.List<GenSolvablePolynomial<C>>>`	SolvableSyzygy.`rightZeroRelationsArbitrary(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Right syzygy module from arbitrary base.
`java.util.List<java.util.List<GenSolvablePolynomial<C>>>`	SolvableSyzygy.`rightZeroRelationsArbitrary(java.util.List<GenSolvablePolynomial<C>> F)`	Right syzygy module from arbitrary base.
`java.util.List<java.util.List<GenSolvablePolynomial<C>>>`	SolvableSyzygyAbstract.`rightZeroRelationsArbitrary(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Right syzygy module from arbitrary base.
`java.util.List<java.util.List<GenSolvablePolynomial<C>>>`	SolvableSyzygyAbstract.`rightZeroRelationsArbitrary(java.util.List<GenSolvablePolynomial<C>> F)`	Right syzygy module from arbitrary base.
`java.util.List<GenSolvablePolynomial<GenPolynomial<C>>>`	SolvableGroebnerBasePseudoRecSeq.`twosidedGB(int modv, java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> Fp)`	Twosided Solvable Groebner base using pairlist class.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableGroebnerBasePseudoSeq.`twosidedGB(int modv, java.util.List<GenSolvablePolynomial<C>> Fp)`	Twosided Solvable Groebner base using pairlist class.

Methods in edu.jas.gbufd with parameters of type GenSolvablePolynomial
Modifier and Type	Method	Description
`int`	SolvableSyzygyAbstract.`compare(GenSolvablePolynomial<C> num, GenSolvablePolynomial<C> den, GenSolvablePolynomial<C> n, GenSolvablePolynomial<C> d)`	Comparison like SolvableLocal or SolvableQuotient.
`boolean`	SolvableSyzygy.`isLeftOreCond(GenSolvablePolynomial<C> a, GenSolvablePolynomial<C> b, GenSolvablePolynomial<C>[] oc)`	Test left Ore condition.
`boolean`	SolvableSyzygyAbstract.`isLeftOreCond(GenSolvablePolynomial<C> a, GenSolvablePolynomial<C> b, GenSolvablePolynomial<C>[] oc)`	Test left Ore condition.
`boolean`	SolvableSyzygyAbstract.`isLeftOreCond(GenSolvablePolynomial<C> a, GenSolvablePolynomial<C> b, GenSolvablePolynomial<C> p, GenSolvablePolynomial<C> q)`	Is left Ore condition.
`boolean`	SolvableSyzygy.`isRightOreCond(GenSolvablePolynomial<C> a, GenSolvablePolynomial<C> b, GenSolvablePolynomial<C>[] oc)`	Test right Ore condition.
`boolean`	SolvableSyzygyAbstract.`isRightOreCond(GenSolvablePolynomial<C> a, GenSolvablePolynomial<C> b, GenSolvablePolynomial<C>[] oc)`	Test right Ore condition.
`boolean`	SolvableSyzygyAbstract.`isRightOreCond(GenSolvablePolynomial<C> a, GenSolvablePolynomial<C> b, GenSolvablePolynomial<C> p, GenSolvablePolynomial<C> q)`	Is right Ore condition.
`GenSolvablePolynomial<C>`	SolvablePseudoReductionSeq.`leftNormalform(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Left normalform.
`GenSolvablePolynomial<C>`	SolvablePseudoReductionSeq.`leftNormalform(java.util.List<GenSolvablePolynomial<C>> row, java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Left normalform with recording.
`PseudoReductionEntry<C>`	SolvablePseudoReduction.`leftNormalformFactor(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Left normalform with multiplication factor.
`PseudoReductionEntry<C>`	SolvablePseudoReductionSeq.`leftNormalformFactor(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Left normalform with factor.
`GenSolvablePolynomial<GenPolynomial<C>>`	SolvablePseudoReduction.`leftNormalformRecursive(java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> Pp, GenSolvablePolynomial<GenPolynomial<C>> Ap)`	Left normalform recursive.
`GenSolvablePolynomial<GenPolynomial<C>>`	SolvablePseudoReductionSeq.`leftNormalformRecursive(java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> Pp, GenSolvablePolynomial<GenPolynomial<C>> Ap)`	Left normalform recursive.
`GenSolvablePolynomial<C>[]`	SolvableSyzygy.`leftOreCond(GenSolvablePolynomial<C> a, GenSolvablePolynomial<C> b)`	Left Ore condition.
`GenSolvablePolynomial<C>[]`	SolvableSyzygySeq.`leftOreCond(GenSolvablePolynomial<C> a, GenSolvablePolynomial<C> b)`	Left Ore condition.
`abstract GenSolvablePolynomial<C>[]`	SolvableSyzygyAbstract.`leftSimplifier(GenSolvablePolynomial<C> a, GenSolvablePolynomial<C> b)`	Left simplifier.
`GenSolvablePolynomial<C>[]`	SolvableSyzygySeq.`leftSimplifier(GenSolvablePolynomial<C> a, GenSolvablePolynomial<C> b)`	Left simplifier.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<C>[]`	PolyGBUtil.`quotientRemainder(GenSolvablePolynomial<C> n, GenSolvablePolynomial<C> d)`	Solvable quotient and remainder via reduction.
`GenSolvablePolynomial<C>`	SolvablePseudoReductionSeq.`rightNormalform(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Right normalform.
`GenSolvablePolynomial<C>`	SolvablePseudoReductionSeq.`rightNormalform(java.util.List<GenSolvablePolynomial<C>> row, java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Right normalform with recording.
`PseudoReductionEntry<C>`	SolvablePseudoReduction.`rightNormalformFactor(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Right normalform with multiplication factor.
`PseudoReductionEntry<C>`	SolvablePseudoReductionSeq.`rightNormalformFactor(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Right normalform with multiplication factor.
`GenSolvablePolynomial<GenPolynomial<C>>`	SolvablePseudoReduction.`rightNormalformRecursive(java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> Pp, GenSolvablePolynomial<GenPolynomial<C>> Ap)`	Right normalform recursive.
`GenSolvablePolynomial<GenPolynomial<C>>`	SolvablePseudoReductionSeq.`rightNormalformRecursive(java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> Pp, GenSolvablePolynomial<GenPolynomial<C>> Ap)`	Right normalform recursive.
`GenSolvablePolynomial<C>[]`	SolvableSyzygy.`rightOreCond(GenSolvablePolynomial<C> a, GenSolvablePolynomial<C> b)`	Right Ore condition.
`GenSolvablePolynomial<C>[]`	SolvableSyzygySeq.`rightOreCond(GenSolvablePolynomial<C> a, GenSolvablePolynomial<C> b)`	Right Ore condition.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<C>`	PolyModUtil.`syzGcd(GenSolvablePolynomialRing<C> r, GenSolvablePolynomial<C> n, GenSolvablePolynomial<C> d)`	Greatest common divisor via least common multiple.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<C>[]`	PolyModUtil.`syzGcdCofactors(GenSolvablePolynomialRing<C> r, GenSolvablePolynomial<C> n, GenSolvablePolynomial<C> d)`	Greatest common divisor and cofactors via least common multiple and reduction.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<C>`	PolyModUtil.`syzLcm(GenSolvablePolynomialRing<C> r, GenSolvablePolynomial<C> n, GenSolvablePolynomial<C> d)`	Least common multiple via ideal intersection.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<C>`	PolyModUtil.`syzLeftGcd(GenSolvablePolynomialRing<C> r, GenSolvablePolynomial<C> n, GenSolvablePolynomial<C> d)`	Left greatest common divisor via least common multiple.
`static <C extends GcdRingElem<C>> GenSolvablePolynomial<C>`	PolyModUtil.`syzRightGcd(GenSolvablePolynomialRing<C> r, GenSolvablePolynomial<C> n, GenSolvablePolynomial<C> d)`	Right greatest common divisor via least common multiple.

Method parameters in edu.jas.gbufd with type arguments of type GenSolvablePolynomial
Modifier and Type	Method	Description
`static <C extends GcdRingElem<C>> java.util.List<GenSolvablePolynomial<C>>`	PolyGBUtil.`intersect(GenSolvablePolynomialRing<C> pfac, java.util.List<GenSolvablePolynomial<C>> A, java.util.List<GenSolvablePolynomial<C>> B)`	Intersection.
`boolean`	SolvableGroebnerBasePseudoRecSeq.`isLeftGBidem(int modv, java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> F)`	Left Groebner base idempotence test.
`boolean`	SolvableGroebnerBasePseudoRecSeq.`isLeftGBsimple(int modv, java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> F)`	Left Groebner base test.
`boolean`	SolvableSyzygy.`isLeftZeroRelation(java.util.List<java.util.List<GenSolvablePolynomial<C>>> Z, java.util.List<GenSolvablePolynomial<C>> F)`	Test if left syzygy.
`boolean`	SolvableSyzygyAbstract.`isLeftZeroRelation(java.util.List<java.util.List<GenSolvablePolynomial<C>>> Z, java.util.List<GenSolvablePolynomial<C>> F)`	Test if left syzygy.
`boolean`	SolvableSyzygy.`isRightZeroRelation(java.util.List<java.util.List<GenSolvablePolynomial<C>>> Z, java.util.List<GenSolvablePolynomial<C>> F)`	Test if right syzygy.
`boolean`	SolvableSyzygyAbstract.`isRightZeroRelation(java.util.List<java.util.List<GenSolvablePolynomial<C>>> Z, java.util.List<GenSolvablePolynomial<C>> F)`	Test if right syzygy.
`boolean`	SolvableGroebnerBasePseudoRecSeq.`isTwosidedGB(int modv, java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> Fp)`	Twosided Groebner base test.
`java.util.List<GenSolvablePolynomial<GenPolynomial<C>>>`	SolvableGroebnerBasePseudoRecSeq.`leftGB(int modv, java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> F)`	Left Groebner base using pairlist class.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableGroebnerBasePseudoSeq.`leftGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Left Groebner base using pairlist class.
`java.util.List<GenSolvablePolynomial<GenPolynomial<C>>>`	SolvableGroebnerBasePseudoRecSeq.`leftMinimalGB(java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> Gp)`	Minimal ordered Solvable Groebner basis.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableGroebnerBasePseudoSeq.`leftMinimalGB(java.util.List<GenSolvablePolynomial<C>> Gp)`	Minimal ordered Solvable Groebner basis.
`GenSolvablePolynomial<C>`	SolvablePseudoReductionSeq.`leftNormalform(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Left normalform.
`GenSolvablePolynomial<C>`	SolvablePseudoReductionSeq.`leftNormalform(java.util.List<GenSolvablePolynomial<C>> row, java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Left normalform with recording.
`PseudoReductionEntry<C>`	SolvablePseudoReduction.`leftNormalformFactor(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Left normalform with multiplication factor.
`PseudoReductionEntry<C>`	SolvablePseudoReductionSeq.`leftNormalformFactor(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Left normalform with factor.
`GenSolvablePolynomial<GenPolynomial<C>>`	SolvablePseudoReduction.`leftNormalformRecursive(java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> Pp, GenSolvablePolynomial<GenPolynomial<C>> Ap)`	Left normalform recursive.
`GenSolvablePolynomial<GenPolynomial<C>>`	SolvablePseudoReductionSeq.`leftNormalformRecursive(java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> Pp, GenSolvablePolynomial<GenPolynomial<C>> Ap)`	Left normalform recursive.
`java.util.List<java.util.List<GenSolvablePolynomial<C>>>`	SolvableSyzygy.`leftZeroRelations(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Left syzygy for left Groebner base.
`java.util.List<java.util.List<GenSolvablePolynomial<C>>>`	SolvableSyzygy.`leftZeroRelations(java.util.List<GenSolvablePolynomial<C>> F)`	Left syzygy for left Groebner base.
`java.util.List<java.util.List<GenSolvablePolynomial<C>>>`	SolvableSyzygyAbstract.`leftZeroRelations(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Left syzygy for left Groebner base.
`java.util.List<java.util.List<GenSolvablePolynomial<C>>>`	SolvableSyzygyAbstract.`leftZeroRelations(java.util.List<GenSolvablePolynomial<C>> F)`	Left syzygy for left Groebner base.
`java.util.List<java.util.List<GenSolvablePolynomial<C>>>`	SolvableSyzygy.`leftZeroRelationsArbitrary(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Left syzygy module from arbitrary base.
`java.util.List<java.util.List<GenSolvablePolynomial<C>>>`	SolvableSyzygy.`leftZeroRelationsArbitrary(java.util.List<GenSolvablePolynomial<C>> F)`	Left syzygy module from arbitrary base.
`java.util.List<java.util.List<GenSolvablePolynomial<C>>>`	SolvableSyzygyAbstract.`leftZeroRelationsArbitrary(java.util.List<GenSolvablePolynomial<C>> F)`	Left syzygy module from arbitrary base.
`java.util.List<java.util.List<GenSolvablePolynomial<C>>>`	SolvableSyzygySeq.`leftZeroRelationsArbitrary(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Left syzygy module from arbitrary base.
`GenSolvablePolynomial<C>`	SolvablePseudoReductionSeq.`rightNormalform(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Right normalform.
`GenSolvablePolynomial<C>`	SolvablePseudoReductionSeq.`rightNormalform(java.util.List<GenSolvablePolynomial<C>> row, java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Right normalform with recording.
`PseudoReductionEntry<C>`	SolvablePseudoReduction.`rightNormalformFactor(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Right normalform with multiplication factor.
`PseudoReductionEntry<C>`	SolvablePseudoReductionSeq.`rightNormalformFactor(java.util.List<GenSolvablePolynomial<C>> Pp, GenSolvablePolynomial<C> Ap)`	Right normalform with multiplication factor.
`GenSolvablePolynomial<GenPolynomial<C>>`	SolvablePseudoReduction.`rightNormalformRecursive(java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> Pp, GenSolvablePolynomial<GenPolynomial<C>> Ap)`	Right normalform recursive.
`GenSolvablePolynomial<GenPolynomial<C>>`	SolvablePseudoReductionSeq.`rightNormalformRecursive(java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> Pp, GenSolvablePolynomial<GenPolynomial<C>> Ap)`	Right normalform recursive.
`java.util.List<java.util.List<GenSolvablePolynomial<C>>>`	SolvableSyzygyAbstract.`rightZeroRelations(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Right syzygy module from Groebner base.
`java.util.List<java.util.List<GenSolvablePolynomial<C>>>`	SolvableSyzygyAbstract.`rightZeroRelations(java.util.List<GenSolvablePolynomial<C>> F)`	Right syzygy module from Groebner base.
`java.util.List<java.util.List<GenSolvablePolynomial<C>>>`	SolvableSyzygy.`rightZeroRelationsArbitrary(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Right syzygy module from arbitrary base.
`java.util.List<java.util.List<GenSolvablePolynomial<C>>>`	SolvableSyzygy.`rightZeroRelationsArbitrary(java.util.List<GenSolvablePolynomial<C>> F)`	Right syzygy module from arbitrary base.
`java.util.List<java.util.List<GenSolvablePolynomial<C>>>`	SolvableSyzygyAbstract.`rightZeroRelationsArbitrary(int modv, java.util.List<GenSolvablePolynomial<C>> F)`	Right syzygy module from arbitrary base.
`java.util.List<java.util.List<GenSolvablePolynomial<C>>>`	SolvableSyzygyAbstract.`rightZeroRelationsArbitrary(java.util.List<GenSolvablePolynomial<C>> F)`	Right syzygy module from arbitrary base.
`java.util.List<GenSolvablePolynomial<GenPolynomial<C>>>`	SolvableGroebnerBasePseudoRecSeq.`twosidedGB(int modv, java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> Fp)`	Twosided Solvable Groebner base using pairlist class.
`java.util.List<GenSolvablePolynomial<C>>`	SolvableGroebnerBasePseudoSeq.`twosidedGB(int modv, java.util.List<GenSolvablePolynomial<C>> Fp)`	Twosided Solvable Groebner base using pairlist class.

Uses of GenSolvablePolynomial in edu.jas.poly

Subclasses of GenSolvablePolynomial in edu.jas.poly
Modifier and Type	Class	Description
`class`	`QLRSolvablePolynomial<C extends GcdRingElem<C> & QuotPair<GenPolynomial<D>>,D extends GcdRingElem<D>>`	QLRSolvablePolynomial generic recursive solvable polynomials implementing RingElem.
`class`	`RecSolvablePolynomial<C extends RingElem<C>>`	RecSolvablePolynomial generic recursive solvable polynomials implementing RingElem.
`class`	`RecSolvableWordPolynomial<C extends RingElem<C>>`	RecSolvableWordPolynomial generic recursive solvable polynomials implementing RingElem.

Fields in edu.jas.poly declared as GenSolvablePolynomial
Modifier and Type	Field	Description
`GenSolvablePolynomial<C>`	GenSolvablePolynomialRing.`ONE`	The constant polynomial 1 for this ring.
`GenSolvablePolynomial<C>`	TableRelation.`p`	GenSolvablePolynomial of the data structure.
`GenSolvablePolynomial<C>`	GenSolvablePolynomialRing.`ZERO`	The constant polynomial 0 for this ring.

Methods in edu.jas.poly that return GenSolvablePolynomial
Modifier and Type	Method	Description
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`copy()`	Clone this GenSolvablePolynomial.
`GenSolvablePolynomial<C>`	GenSolvablePolynomialRing.`copy(GenSolvablePolynomial<C> c)`	Copy polynomial c.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`divide(GenSolvablePolynomial<C> S)`	GenSolvablePolynomial left division.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`evalAsRightRecursivePolynomial()`	Evaluate RecSolvablePolynomial as right coefficients polynomial.
`GenSolvablePolynomial<GenPolynomial<C>>`	RecSolvablePolynomial.`evalAsRightRecursivePolynomial()`	Evaluate RecSolvablePolynomial as right coefficients polynomial.
`static <C extends RingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>`	PolyUtil.`extendCoefficients(GenSolvablePolynomialRing<GenPolynomial<C>> pfac, GenSolvablePolynomial<GenPolynomial<C>> A, int j, long k)`	Extend coefficient variables.
`GenSolvablePolynomial<C>`	GenSolvablePolynomialRing.`fromInteger(long a)`	Get a (constant) GenSolvablePolynomial<C> element from a long value.
`GenSolvablePolynomial<C>`	GenSolvablePolynomialRing.`fromInteger(java.math.BigInteger a)`	Get a (constant) GenSolvablePolynomial<C> element from a BigInteger value.
`GenSolvablePolynomial<C>`	GenSolvablePolynomialRing.`getONE()`	Get the one element.
`GenSolvablePolynomial<C>`	GenSolvablePolynomialRing.`getZERO()`	Get the zero element.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`leftMonic()`	GenSolvablePolynomial left monic, i.e.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`monic()`	GenSolvablePolynomial left monic, i.e.
`static <C extends RingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>`	PolyUtil.`monic(GenSolvablePolynomial<GenPolynomial<C>> p)`	GenSolvablePolynomial monic, i.e.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`multiply(C b)`	GenSolvablePolynomial multiplication.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`multiply(C b, C c)`	GenSolvablePolynomial left and right multiplication.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`multiply(C b, ExpVector e)`	GenSolvablePolynomial multiplication.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`multiply(C b, ExpVector e, C c, ExpVector f)`	GenSolvablePolynomial left and right multiplication.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`multiply(ExpVector e)`	GenSolvablePolynomial multiplication.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`multiply(ExpVector e, ExpVector f)`	GenSolvablePolynomial left and right multiplication.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`multiply(GenSolvablePolynomial<C> Bp)`	GenSolvablePolynomial multiplication.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`multiply(GenSolvablePolynomial<C> S, GenSolvablePolynomial<C> T)`	GenSolvablePolynomial left and right multiplication.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`multiply(java.util.Map.Entry<ExpVector,C> m)`	GenSolvablePolynomial multiplication.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`multiplyLeft(C b)`	GenSolvablePolynomial multiplication.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`multiplyLeft(C b, ExpVector e)`	GenSolvablePolynomial multiplication.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`multiplyLeft(ExpVector e)`	GenSolvablePolynomial multiplication.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`multiplyLeft(java.util.Map.Entry<ExpVector,C> m)`	GenSolvablePolynomial multiplication.
`GenSolvablePolynomial`	GenPolynomialTokenizer.`nextSolvablePolynomial()`	Parsing method for solvable polynomial.
`GenSolvablePolynomial<C>`	GenSolvablePolynomialRing.`parse(java.io.Reader r)`	Parse a solvable polynomial with the use of GenPolynomialTokenizer
`GenSolvablePolynomial<C>`	GenSolvablePolynomialRing.`parse(java.lang.String s)`	Parse a solvable polynomial with the use of GenPolynomialTokenizer
`GenSolvablePolynomial<C>[]`	GenSolvablePolynomial.`quotientRemainder(GenSolvablePolynomial<C> S)`	GenSolvablePolynomial left division with remainder.
`GenSolvablePolynomial<C>`	GenSolvablePolynomialRing.`random(int n)`	Random solvable polynomial.
`GenSolvablePolynomial<C>`	GenSolvablePolynomialRing.`random(int k, int l, int d, float q)`	Generate a random solvable polynomial.
`GenSolvablePolynomial<C>`	GenSolvablePolynomialRing.`random(int k, int l, int d, float q, java.util.Random rnd)`	Random solvable polynomial.
`GenSolvablePolynomial<C>`	GenSolvablePolynomialRing.`random(int n, java.util.Random rnd)`	Random solvable polynomial.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`remainder(GenSolvablePolynomial<C> S)`	GenSolvablePolynomial remainder by left division.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`rightDivide(GenSolvablePolynomial<C> S)`	GenSolvablePolynomial right division.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`rightMonic()`	GenSolvablePolynomial right monic, i.e.
`GenSolvablePolynomial<C>[]`	GenSolvablePolynomial.`rightQuotientRemainder(GenSolvablePolynomial<C> S)`	GenSolvablePolynomial right division with remainder.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`rightRecursivePolynomial()`	RecSolvablePolynomial right coefficients from left coefficients.
`GenSolvablePolynomial<GenPolynomial<C>>`	RecSolvablePolynomial.`rightRecursivePolynomial()`	RecSolvablePolynomial right coefficients from left coefficients.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`rightRemainder(GenSolvablePolynomial<C> S)`	GenSolvablePolynomial remainder by right division.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`scaleSubtractMultiple(C b, C a, ExpVector e, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial scale and subtract a multiple.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`scaleSubtractMultiple(C b, C a, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial scale and subtract a multiple.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`scaleSubtractMultiple(C b, ExpVector g, C a, ExpVector e, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial scale and subtract a multiple.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`subtractMultiple(C a, ExpVector e, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial subtract a multiple.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`subtractMultiple(C a, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial subtract a multiple.
`static <C extends RingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>`	PolyUtil.`toRecursive(GenSolvablePolynomialRing<GenPolynomial<C>> rfac, GenSolvablePolynomial<C> A)`	To recursive representation.
`GenSolvablePolynomial<C>`	GenSolvablePolynomialRing.`univariate(int i)`	Generate univariate solvable polynomial in a given variable.
`GenSolvablePolynomial<C>`	GenSolvablePolynomialRing.`univariate(int modv, int i, long e)`	Generate univariate solvable polynomial in a given variable with given exponent.
`GenSolvablePolynomial<C>`	GenSolvablePolynomialRing.`univariate(int i, long e)`	Generate univariate solvable polynomial in a given variable with given exponent.
`GenSolvablePolynomial<C>`	GenSolvablePolynomialRing.`valueOf(C a)`	Get a (constant) GenPolynomial<C> element from a coefficient value.
`GenSolvablePolynomial<C>`	GenSolvablePolynomialRing.`valueOf(C a, ExpVector e)`	Get a GenPolynomial<C> element from a coefficient and an exponent vector.
`GenSolvablePolynomial<C>`	GenSolvablePolynomialRing.`valueOf(ExpVector e)`	Get a GenPolynomial<C> element from an exponent vector.

Methods in edu.jas.poly that return types with arguments of type GenSolvablePolynomial
Modifier and Type	Method	Description
`java.util.List<java.util.List<GenSolvablePolynomial<C>>>`	ModuleList.`castToSolvableList()`	Get list as List of GenSolvablePolynomials.
`java.util.List<GenSolvablePolynomial<C>>`	PolynomialList.`castToSolvableList()`	Get list as List of GenSolvablePolynomials.
`static <C extends RingElem<C>> java.util.List<GenSolvablePolynomial<C>>`	PolynomialList.`castToSolvableList(java.util.List<GenPolynomial<C>> list)`	Get list as List of GenSolvablePolynomials.
`static <C extends RingElem<C>> java.util.List<java.util.List<GenSolvablePolynomial<C>>>`	PolynomialList.`castToSolvableMatrix(java.util.List<java.util.List<GenPolynomial<C>>> list)`	Get list of list as List of List of GenSolvablePolynomials.
`java.util.List<GenSolvablePolynomial<C>>`	PolynomialList.`getSolvableList()`	Get list as List of GenSolvablePolynomials.
`static <C extends RingElem<C>> java.util.List<GenSolvablePolynomial<C>>`	PolyUtil.`intersect(GenSolvablePolynomialRing<C> R, java.util.List<GenSolvablePolynomial<C>> F)`	Intersection.
`java.util.List<GenSolvablePolynomial>`	GenPolynomialTokenizer.`nextSolvablePolynomialList()`	Parsing method for solvable polynomial list.
`java.util.List<java.util.List<GenSolvablePolynomial>>`	GenPolynomialTokenizer.`nextSolvableSubModuleList()`	Parsing method for solvable submodule list.
`static <C extends RingElem<C>> java.util.List<GenSolvablePolynomial<C>>`	TermOrderOptimization.`permutation(java.util.List<java.lang.Integer> P, GenSolvablePolynomialRing<C> R, java.util.List<GenSolvablePolynomial<C>> L)`	Permutation of solvable polynomial exponent vectors.
`java.util.List<GenSolvablePolynomial<C>>`	RelationTable.`relationList()`	Convert relation table to list of polynomial triples.
`java.util.List<? extends GenSolvablePolynomial<C>>`	GenSolvablePolynomialRing.`univariateList()`	Generate list of univariate polynomials in all variables.
`java.util.List<? extends GenSolvablePolynomial<C>>`	GenSolvablePolynomialRing.`univariateList(int modv)`	Generate list of univariate polynomials in all variables.
`java.util.List<? extends GenSolvablePolynomial<C>>`	GenSolvablePolynomialRing.`univariateList(int modv, long e)`	Generate list of univariate polynomials in all variables with given exponent.

Methods in edu.jas.poly with parameters of type GenSolvablePolynomial
Modifier and Type	Method	Description
`GenSolvablePolynomial<C>`	GenSolvablePolynomialRing.`copy(GenSolvablePolynomial<C> c)`	Copy polynomial c.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`divide(GenSolvablePolynomial<C> S)`	GenSolvablePolynomial left division.
`static <C extends RingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>`	PolyUtil.`extendCoefficients(GenSolvablePolynomialRing<GenPolynomial<C>> pfac, GenSolvablePolynomial<GenPolynomial<C>> A, int j, long k)`	Extend coefficient variables.
`QLRSolvablePolynomial<C,D>`	QLRSolvablePolynomialRing.`fromPolyCoefficients(GenSolvablePolynomial<GenPolynomial<D>> A)`	Rational function from integral polynomial coefficients.
`boolean`	GenSolvablePolynomial.`isRightRecursivePolynomial(GenSolvablePolynomial<C> R)`	Test RecSolvablePolynomial right coefficients polynomial.
`boolean`	RecSolvablePolynomial.`isRightRecursivePolynomial(GenSolvablePolynomial<GenPolynomial<C>> R)`	Test RecSolvablePolynomial right coefficients polynomial.
`static <C extends RingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>`	PolyUtil.`monic(GenSolvablePolynomial<GenPolynomial<C>> p)`	GenSolvablePolynomial monic, i.e.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`multiply(GenSolvablePolynomial<C> Bp)`	GenSolvablePolynomial multiplication.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`multiply(GenSolvablePolynomial<C> S, GenSolvablePolynomial<C> T)`	GenSolvablePolynomial left and right multiplication.
`GenSolvablePolynomial<C>[]`	GenSolvablePolynomial.`quotientRemainder(GenSolvablePolynomial<C> S)`	GenSolvablePolynomial left division with remainder.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`remainder(GenSolvablePolynomial<C> S)`	GenSolvablePolynomial remainder by left division.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`rightDivide(GenSolvablePolynomial<C> S)`	GenSolvablePolynomial right division.
`GenSolvablePolynomial<C>[]`	GenSolvablePolynomial.`rightQuotientRemainder(GenSolvablePolynomial<C> S)`	GenSolvablePolynomial right division with remainder.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`rightRemainder(GenSolvablePolynomial<C> S)`	GenSolvablePolynomial remainder by right division.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`scaleSubtractMultiple(C b, C a, ExpVector e, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial scale and subtract a multiple.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`scaleSubtractMultiple(C b, C a, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial scale and subtract a multiple.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`scaleSubtractMultiple(C b, ExpVector g, C a, ExpVector e, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial scale and subtract a multiple.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`subtractMultiple(C a, ExpVector e, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial subtract a multiple.
`GenSolvablePolynomial<C>`	GenSolvablePolynomial.`subtractMultiple(C a, GenSolvablePolynomial<C> S)`	GenSolvablePolynomial subtract a multiple.
`static <C extends RingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>`	PolyUtil.`toRecursive(GenSolvablePolynomialRing<GenPolynomial<C>> rfac, GenSolvablePolynomial<C> A)`	To recursive representation.
`void`	RelationTable.`update(ExpVector e, ExpVector f, GenSolvablePolynomial<C> p)`	Update or initialize RelationTable with new relation.
`void`	RelationTable.`update(GenPolynomial<C> E, GenPolynomial<C> F, GenSolvablePolynomial<C> p)`	Update or initialize RelationTable with new relation.

Method parameters in edu.jas.poly with type arguments of type GenSolvablePolynomial
Modifier and Type	Method	Description
`void`	RecSolvablePolynomialRing.`addSolvCoeffRelations(java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> rel)`	Generate the coefficient relation table of the solvable polynomial ring from a solvable polynomial list of relations.
`void`	GenSolvablePolynomialRing.`addSolvRelations(java.util.List<GenSolvablePolynomial<C>> rel)`	Generate the relation table of the solvable polynomial ring from a solvable polynomial list of relations.
`void`	RelationTable.`addSolvRelations(java.util.List<GenSolvablePolynomial<C>> rel)`	Add list of polynomial triples as relations.
`static <C extends RingElem<C>> java.util.List<java.util.List<GenPolynomial<C>>>`	ModuleList.`castToList(java.util.List<java.util.List<GenSolvablePolynomial<C>>> slist)`	Get a solvable polynomials list as List of GenPolynomials.
`static <C extends RingElem<C>> java.util.List<GenSolvablePolynomial<C>>`	PolyUtil.`intersect(GenSolvablePolynomialRing<C> R, java.util.List<GenSolvablePolynomial<C>> F)`	Intersection.

Constructors in edu.jas.poly with parameters of type GenSolvablePolynomial
Constructor	Description
`QLRSolvablePolynomial(QLRSolvablePolynomialRing<C,D> r, GenSolvablePolynomial<C> S)`	Constructor for QLRSolvablePolynomial.
`RecSolvablePolynomial(RecSolvablePolynomialRing<C> r, GenSolvablePolynomial<GenPolynomial<C>> S)`	Constructor for RecSolvablePolynomial.
`RecSolvableWordPolynomial(RecSolvableWordPolynomialRing<C> r, GenSolvablePolynomial<GenWordPolynomial<C>> S)`	Constructor for RecSolvableWordPolynomial.
`TableRelation(ExpVector e, ExpVector f, GenSolvablePolynomial<C> p)`	Constructor to setup the data structure.

Constructor parameters in edu.jas.poly with type arguments of type GenSolvablePolynomial
Constructor	Description
`ModuleList(GenSolvablePolynomialRing<C> r, java.util.List<java.util.List<GenSolvablePolynomial<C>>> l)`	Constructor.
`PolynomialList(GenSolvablePolynomialRing<C> r, java.util.List<GenSolvablePolynomial<C>> l)`	Constructor.

Uses of Classedu.jas.poly.GenSolvablePolynomial

Uses of GenSolvablePolynomial in edu.jas.application

Uses of GenSolvablePolynomial in edu.jas.fd

Uses of GenSolvablePolynomial in edu.jas.gb

Uses of GenSolvablePolynomial in edu.jas.gbmod

Uses of GenSolvablePolynomial in edu.jas.gbufd

Uses of GenSolvablePolynomial in edu.jas.poly

Uses of Class
edu.jas.poly.GenSolvablePolynomial