Uses of Class
edu.jas.poly.GenWordPolynomial

Packages that use GenWordPolynomial

Package	Description
edu.jas.application	Groebner base application package.
edu.jas.gb	Groebner bases package.
edu.jas.gbufd	Groebner bases using unique factorization package.
edu.jas.poly	Generic coefficients polynomial package.

Uses of GenWordPolynomial in edu.jas.application

Classes in edu.jas.application that implement interfaces with type arguments of type GenWordPolynomial

Modifier and Type	Class	Description
class	WordResidue<C extends GcdRingElem<C>>	WordResidue ring element based on GenWordPolynomial with GcdRingElem interface.
class	WordResidue<C extends GcdRingElem<C>>	WordResidue ring element based on GenWordPolynomial with GcdRingElem interface.
class	WordResidueRing<C extends GcdRingElem<C>>	WordResidue ring factory based on GenWordPolynomialRing with GcdRingFactory interface.
class	WordResidueRing<C extends GcdRingElem<C>>	WordResidue ring factory based on GenWordPolynomialRing with GcdRingFactory interface.

Fields in edu.jas.application declared as GenWordPolynomial

Modifier and Type	Field	Description
final GenWordPolynomial<C>	WordResidue.val	Value part of the element data structure.

Fields in edu.jas.application with type parameters of type GenWordPolynomial

Modifier and Type	Field	Description
protected List<GenWordPolynomial<C>>	WordIdeal.list	The data structure is a list of word polynomials.

Methods in edu.jas.application that return GenWordPolynomial

Modifier and Type	Method	Description
GenWordPolynomial<C>	WordResidue.denominator()	Denominator.
GenWordPolynomial<C>	WordIdeal.inverse(GenWordPolynomial<C> h)	Inverse for element modulo this ideal.
GenWordPolynomial<C>	WordIdeal.normalform(GenWordPolynomial<C> h)	Normalform for element.
GenWordPolynomial<C>	WordResidue.numerator()	Numerator.
GenWordPolynomial<C>	WordResidue.value()	Value.

Methods in edu.jas.application that return types with arguments of type GenWordPolynomial

Modifier and Type	Method	Description
List<GenWordPolynomial<C>>	WordIdeal.getList()	Get the List of GenWordPolynomials.
List<GenWordPolynomial<C>>	WordIdeal.normalform(List<GenWordPolynomial<C>> L)	Normalform for list of word elements.

Methods in edu.jas.application with parameters of type GenWordPolynomial

Modifier and Type	Method	Description
boolean	WordIdeal.contains(GenWordPolynomial<C> b)	Word ideal containment.
WordResidue<C>	WordResidueRing.create(GenWordPolynomial<C> n)	Create from numerator.
WordResidue<C>	WordResidueRing.create(GenWordPolynomial<C> n, GenWordPolynomial<C> d)	Create from numerator, denominator pair.
GenWordPolynomial<C>	WordIdeal.inverse(GenWordPolynomial<C> h)	Inverse for element modulo this ideal.
boolean	WordIdeal.isUnit(GenWordPolynomial<C> h)	Test if element is a unit modulo this ideal.
WordResidue<C>	WordResidue.multiply(GenWordPolynomial<C> S)	WordResidue multiplication.
GenWordPolynomial<C>	WordIdeal.normalform(GenWordPolynomial<C> h)	Normalform for element.
WordIdeal<C>	WordIdeal.product(GenWordPolynomial<C> b)	Left product.
WordIdeal<C>	WordIdeal.sum(GenWordPolynomial<C> b)	Word summation.

Method parameters in edu.jas.application with type arguments of type GenWordPolynomial

Modifier and Type	Method	Description
boolean	WordIdeal.contains(List<GenWordPolynomial<C>> B)	Word ideal containment.
ResidueSolvableWordPolynomial<C>	ResidueSolvableWordPolynomialRing.fromPolyCoefficients(GenSolvablePolynomial<GenWordPolynomial<C>> A)	Word residue coefficients from integral word polynomial coefficients.
List<GenWordPolynomial<C>>	WordIdeal.normalform(List<GenWordPolynomial<C>> L)	Normalform for list of word elements.
WordIdeal<C>	WordIdeal.sum(List<GenWordPolynomial<C>> L)	Word summation.

Constructors in edu.jas.application with parameters of type GenWordPolynomial

Modifier	Constructor	Description
	WordResidue(WordResidueRing<C> r, GenWordPolynomial<C> a)	The constructor creates a WordResidue object from a ring factory and a polynomial.
	WordResidue(WordResidueRing<C> r, GenWordPolynomial<C> a, int u)	The constructor creates a WordResidue 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 GenWordPolynomial

Modifier	Constructor	Description
	WordIdeal(GenWordPolynomialRing<C> ring, List<GenWordPolynomial<C>> list)	Constructor.
	WordIdeal(GenWordPolynomialRing<C> ring, List<GenWordPolynomial<C>> list, boolean gb)	Constructor.
	WordIdeal(GenWordPolynomialRing<C> ring, List<GenWordPolynomial<C>> list, boolean gb, WordGroebnerBaseAbstract<C> bb)	Constructor.
	WordIdeal(GenWordPolynomialRing<C> ring, List<GenWordPolynomial<C>> list, boolean gb, WordGroebnerBaseAbstract<C> bb, WordReduction<C> red)	Constructor.
	WordIdeal(GenWordPolynomialRing<C> ring, List<GenWordPolynomial<C>> list, WordGroebnerBaseAbstract<C> bb, WordReduction<C> red)	Constructor.

Uses of GenWordPolynomial in edu.jas.gb

Fields in edu.jas.gb declared as GenWordPolynomial

Modifier and Type	Field	Description
final GenWordPolynomial<C>	WordPair.pi
final GenWordPolynomial<C>	WordPair.pj

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

Modifier and Type	Field	Description
protected final List<GenWordPolynomial<C>>	OrderedWordPairlist.P

Methods in edu.jas.gb that return GenWordPolynomial

Modifier and Type	Method	Description
GenWordPolynomial<C>	WordReduction.leftNormalform(List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Normalform with left recording.
GenWordPolynomial<C>	WordReduction.leftNormalform(List<GenWordPolynomial<C>> lrow, List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Normalform with left recording.
GenWordPolynomial<C>	WordReductionSeq.leftNormalform(List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Left normalform with recording.
GenWordPolynomial<C>	WordReductionSeq.leftNormalform(List<GenWordPolynomial<C>> lrow, List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Left normalform with recording.
GenWordPolynomial<C>	WordReduction.normalform(List<GenWordPolynomial<C>> P, GenWordPolynomial<C> A)	Normalform.
GenWordPolynomial<C>	WordReduction.normalform(List<GenWordPolynomial<C>> lrow, List<GenWordPolynomial<C>> rrow, List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Normalform with left and right recording.
GenWordPolynomial<C>	WordReductionSeq.normalform(List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Normalform.
GenWordPolynomial<C>	WordReductionSeq.normalform(List<GenWordPolynomial<C>> lrow, List<GenWordPolynomial<C>> rrow, List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Normalform with left and right recording.
GenWordPolynomial<C>	WordReduction.rightNormalform(List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Right normalform with recording.
GenWordPolynomial<C>	WordReduction.rightNormalform(List<GenWordPolynomial<C>> rrow, List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Right normalform with recording.
GenWordPolynomial<C>	WordReductionSeq.rightNormalform(List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Right normalform with recording.
GenWordPolynomial<C>	WordReductionSeq.rightNormalform(List<GenWordPolynomial<C>> rrow, List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Right normalform with recording.
GenWordPolynomial<C>	WordReduction.SPolynomial(C a, Word l1, GenWordPolynomial<C> A, Word r1, C b, Word l2, GenWordPolynomial<C> B, Word r2)	S-Polynomials of non-commutative polynomials.
GenWordPolynomial<C>	WordReductionAbstract.SPolynomial(C a, Word l1, GenWordPolynomial<C> A, Word r1, C b, Word l2, GenWordPolynomial<C> B, Word r2)	S-Polynomials of non-commutative polynomials.
GenWordPolynomial<C>	WordReductionAbstract.SPolynomial(Overlap ol, C a, GenWordPolynomial<C> A, C b, GenWordPolynomial<C> B)	S-Polynomials of non-commutative polynomials.

Methods in edu.jas.gb that return types with arguments of type GenWordPolynomial

Modifier and Type	Method	Description
List<GenWordPolynomial<C>>	WordGroebnerBase.GB(List<GenWordPolynomial<C>> F)	Groebner base using pairlist class.
abstract List<GenWordPolynomial<C>>	WordGroebnerBaseAbstract.GB(List<GenWordPolynomial<C>> F)	Groebner base using pairlist class.
List<GenWordPolynomial<C>>	WordGroebnerBaseSeq.GB(List<GenWordPolynomial<C>> F)	Word Groebner base using word pairlist class.
List<GenWordPolynomial<C>>	OrderedWordPairlist.getList()	Get the list of polynomials.
List<GenWordPolynomial<C>>	WordPairList.getList()	Get the list of word polynomials.
List<GenWordPolynomial<C>>	WordReduction.irreducibleSet(List<GenWordPolynomial<C>> Pp)	Irreducible set.
List<GenWordPolynomial<C>>	WordReductionAbstract.irreducibleSet(List<GenWordPolynomial<C>> Pp)	Irreducible set.
List<GenWordPolynomial<C>>	WordGroebnerBase.minimalGB(List<GenWordPolynomial<C>> Gp)	Minimal ordered groebner basis.
List<GenWordPolynomial<C>>	WordGroebnerBaseAbstract.minimalGB(List<GenWordPolynomial<C>> Gp)	Minimal ordered Groebner basis.
List<GenWordPolynomial<C>>	WordReduction.normalform(List<GenWordPolynomial<C>> Pp, List<GenWordPolynomial<C>> Ap)	Normalform Set.
List<GenWordPolynomial<C>>	WordReductionAbstract.normalform(List<GenWordPolynomial<C>> Pp, List<GenWordPolynomial<C>> Ap)	Normalform Set.
List<GenWordPolynomial<C>>	WordGroebnerBaseAbstract.normalizeZerosOnes(List<GenWordPolynomial<C>> A)	Normalize polynomial list.
List<GenWordPolynomial<C>>	WordReduction.SPolynomials(GenWordPolynomial<C> Ap, GenWordPolynomial<C> Bp)	S-Polynomials of non-commutative polynomials.
List<GenWordPolynomial<C>>	WordReductionAbstract.SPolynomials(GenWordPolynomial<C> Ap, GenWordPolynomial<C> Bp)	S-Polynomials of non-commutative polynomials.

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

Modifier and Type	Method	Description
boolean	WordReduction.isNormalform(List<GenWordPolynomial<C>> P, GenWordPolynomial<C> A)	Is in Normalform.
boolean	WordReductionAbstract.isNormalform(List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Is in Normalform.
boolean	WordReduction.isReducible(List<GenWordPolynomial<C>> P, GenWordPolynomial<C> A)	Is reducible.
boolean	WordReductionAbstract.isReducible(List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Is reducible.
boolean	WordReduction.isReductionNF(List<GenWordPolynomial<C>> lrow, List<GenWordPolynomial<C>> rrow, List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap, GenWordPolynomial<C> Np)	Is reduction of normal form.
boolean	WordReductionAbstract.isReductionNF(List<GenWordPolynomial<C>> lrow, List<GenWordPolynomial<C>> rrow, List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap, GenWordPolynomial<C> Np)	Is reduction of normal form.
boolean	WordReduction.isTopReducible(List<GenWordPolynomial<C>> P, GenWordPolynomial<C> A)	Is top reducible.
boolean	WordReductionAbstract.isTopReducible(List<GenWordPolynomial<C>> P, GenWordPolynomial<C> A)	Is top reducible.
GenWordPolynomial<C>	WordReduction.leftNormalform(List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Normalform with left recording.
GenWordPolynomial<C>	WordReduction.leftNormalform(List<GenWordPolynomial<C>> lrow, List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Normalform with left recording.
GenWordPolynomial<C>	WordReductionSeq.leftNormalform(List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Left normalform with recording.
GenWordPolynomial<C>	WordReductionSeq.leftNormalform(List<GenWordPolynomial<C>> lrow, List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Left normalform with recording.
GenWordPolynomial<C>	WordReduction.normalform(List<GenWordPolynomial<C>> P, GenWordPolynomial<C> A)	Normalform.
GenWordPolynomial<C>	WordReduction.normalform(List<GenWordPolynomial<C>> lrow, List<GenWordPolynomial<C>> rrow, List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Normalform with left and right recording.
GenWordPolynomial<C>	WordReductionSeq.normalform(List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Normalform.
GenWordPolynomial<C>	WordReductionSeq.normalform(List<GenWordPolynomial<C>> lrow, List<GenWordPolynomial<C>> rrow, List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Normalform with left and right recording.
int	OrderedWordPairlist.put(GenWordPolynomial<C> p)	Put one Polynomial to the pairlist and reduction matrix.
int	WordPairList.put(GenWordPolynomial<C> p)	Put one Word Polynomial to the pairlist and reduction matrix.
int	OrderedWordPairlist.putOne(GenWordPolynomial<C> one)	Put the ONE-Polynomial to the pairlist.
GenWordPolynomial<C>	WordReduction.rightNormalform(List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Right normalform with recording.
GenWordPolynomial<C>	WordReduction.rightNormalform(List<GenWordPolynomial<C>> rrow, List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Right normalform with recording.
GenWordPolynomial<C>	WordReductionSeq.rightNormalform(List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Right normalform with recording.
GenWordPolynomial<C>	WordReductionSeq.rightNormalform(List<GenWordPolynomial<C>> rrow, List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Right normalform with recording.
GenWordPolynomial<C>	WordReduction.SPolynomial(C a, Word l1, GenWordPolynomial<C> A, Word r1, C b, Word l2, GenWordPolynomial<C> B, Word r2)	S-Polynomials of non-commutative polynomials.
GenWordPolynomial<C>	WordReductionAbstract.SPolynomial(C a, Word l1, GenWordPolynomial<C> A, Word r1, C b, Word l2, GenWordPolynomial<C> B, Word r2)	S-Polynomials of non-commutative polynomials.
GenWordPolynomial<C>	WordReductionAbstract.SPolynomial(Overlap ol, C a, GenWordPolynomial<C> A, C b, GenWordPolynomial<C> B)	S-Polynomials of non-commutative polynomials.
List<GenWordPolynomial<C>>	WordReduction.SPolynomials(GenWordPolynomial<C> Ap, GenWordPolynomial<C> Bp)	S-Polynomials of non-commutative polynomials.
List<GenWordPolynomial<C>>	WordReductionAbstract.SPolynomials(GenWordPolynomial<C> Ap, GenWordPolynomial<C> Bp)	S-Polynomials of non-commutative polynomials.

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

Modifier and Type	Method	Description
int	WordGroebnerBaseAbstract.commonZeroTest(List<GenWordPolynomial<C>> F)	Common zero test, test if univariate leading words exist for all variables.
List<GenWordPolynomial<C>>	WordGroebnerBase.GB(List<GenWordPolynomial<C>> F)	Groebner base using pairlist class.
abstract List<GenWordPolynomial<C>>	WordGroebnerBaseAbstract.GB(List<GenWordPolynomial<C>> F)	Groebner base using pairlist class.
List<GenWordPolynomial<C>>	WordGroebnerBaseSeq.GB(List<GenWordPolynomial<C>> F)	Word Groebner base using word pairlist class.
List<GenWordPolynomial<C>>	WordReduction.irreducibleSet(List<GenWordPolynomial<C>> Pp)	Irreducible set.
List<GenWordPolynomial<C>>	WordReductionAbstract.irreducibleSet(List<GenWordPolynomial<C>> Pp)	Irreducible set.
boolean	WordGroebnerBase.isGB(List<GenWordPolynomial<C>> F)	Groebner base test.
boolean	WordGroebnerBaseAbstract.isGB(List<GenWordPolynomial<C>> F)	Word Groebner base test.
boolean	WordGroebnerBaseAbstract.isMinimalGB(List<GenWordPolynomial<C>> Gp)	Test for minimal ordered Groebner basis.
boolean	WordReduction.isNormalform(List<GenWordPolynomial<C>> Pp)	Is in Normalform.
boolean	WordReduction.isNormalform(List<GenWordPolynomial<C>> P, GenWordPolynomial<C> A)	Is in Normalform.
boolean	WordReductionAbstract.isNormalform(List<GenWordPolynomial<C>> Pp)	Is in Normalform.
boolean	WordReductionAbstract.isNormalform(List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Is in Normalform.
boolean	WordReduction.isReducible(List<GenWordPolynomial<C>> P, GenWordPolynomial<C> A)	Is reducible.
boolean	WordReductionAbstract.isReducible(List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Is reducible.
boolean	WordReduction.isReductionNF(List<GenWordPolynomial<C>> lrow, List<GenWordPolynomial<C>> rrow, List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap, GenWordPolynomial<C> Np)	Is reduction of normal form.
boolean	WordReductionAbstract.isReductionNF(List<GenWordPolynomial<C>> lrow, List<GenWordPolynomial<C>> rrow, List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap, GenWordPolynomial<C> Np)	Is reduction of normal form.
boolean	WordReduction.isTopReducible(List<GenWordPolynomial<C>> P, GenWordPolynomial<C> A)	Is top reducible.
boolean	WordReductionAbstract.isTopReducible(List<GenWordPolynomial<C>> P, GenWordPolynomial<C> A)	Is top reducible.
GenWordPolynomial<C>	WordReduction.leftNormalform(List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Normalform with left recording.
GenWordPolynomial<C>	WordReduction.leftNormalform(List<GenWordPolynomial<C>> lrow, List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Normalform with left recording.
GenWordPolynomial<C>	WordReductionSeq.leftNormalform(List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Left normalform with recording.
GenWordPolynomial<C>	WordReductionSeq.leftNormalform(List<GenWordPolynomial<C>> lrow, List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Left normalform with recording.
List<GenWordPolynomial<C>>	WordGroebnerBase.minimalGB(List<GenWordPolynomial<C>> Gp)	Minimal ordered groebner basis.
List<GenWordPolynomial<C>>	WordGroebnerBaseAbstract.minimalGB(List<GenWordPolynomial<C>> Gp)	Minimal ordered Groebner basis.
GenWordPolynomial<C>	WordReduction.normalform(List<GenWordPolynomial<C>> P, GenWordPolynomial<C> A)	Normalform.
List<GenWordPolynomial<C>>	WordReduction.normalform(List<GenWordPolynomial<C>> Pp, List<GenWordPolynomial<C>> Ap)	Normalform Set.
GenWordPolynomial<C>	WordReduction.normalform(List<GenWordPolynomial<C>> lrow, List<GenWordPolynomial<C>> rrow, List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Normalform with left and right recording.
List<GenWordPolynomial<C>>	WordReductionAbstract.normalform(List<GenWordPolynomial<C>> Pp, List<GenWordPolynomial<C>> Ap)	Normalform Set.
GenWordPolynomial<C>	WordReductionSeq.normalform(List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Normalform.
GenWordPolynomial<C>	WordReductionSeq.normalform(List<GenWordPolynomial<C>> lrow, List<GenWordPolynomial<C>> rrow, List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Normalform with left and right recording.
List<GenWordPolynomial<C>>	WordGroebnerBaseAbstract.normalizeZerosOnes(List<GenWordPolynomial<C>> A)	Normalize polynomial list.
int	OrderedWordPairlist.put(List<GenWordPolynomial<C>> F)	Put all word polynomials in F to the pairlist and reduction matrix.
int	WordPairList.put(List<GenWordPolynomial<C>> F)	Put all word polynomials in F to the pairlist and reduction matrix.
GenWordPolynomial<C>	WordReduction.rightNormalform(List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Right normalform with recording.
GenWordPolynomial<C>	WordReduction.rightNormalform(List<GenWordPolynomial<C>> rrow, List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Right normalform with recording.
GenWordPolynomial<C>	WordReductionSeq.rightNormalform(List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Right normalform with recording.
GenWordPolynomial<C>	WordReductionSeq.rightNormalform(List<GenWordPolynomial<C>> rrow, List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Right normalform with recording.
List<Long>	WordGroebnerBaseAbstract.univariateDegrees(List<GenWordPolynomial<C>> A)	Univariate head term degrees.

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

Modifier	Constructor	Description
	WordPair(GenWordPolynomial<C> a, GenWordPolynomial<C> b, int i, int j)	WordPair constructor.

Uses of GenWordPolynomial in edu.jas.gbufd

Fields in edu.jas.gbufd declared as GenWordPolynomial

Modifier and Type	Field	Description
final GenWordPolynomial<C>	WordPseudoReductionEntry.pol

Methods in edu.jas.gbufd that return GenWordPolynomial

Modifier and Type	Method	Description
GenWordPolynomial<C>	WordGroebnerBasePseudoSeq.basePrimitivePart(GenWordPolynomial<C> P)	GenWordPolynomial base coefficient primitive part.
GenWordPolynomial<C>	WordPseudoReductionSeq.leftNormalform(List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)
GenWordPolynomial<C>	WordPseudoReductionSeq.leftNormalform(List<GenWordPolynomial<C>> lrow, List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)
GenWordPolynomial<C>	WordPseudoReductionSeq.normalform(List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Normalform.
GenWordPolynomial<C>	WordPseudoReductionSeq.normalform(List<GenWordPolynomial<C>> lrow, List<GenWordPolynomial<C>> rrow, List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Normalform with left and right recording.
GenWordPolynomial<GenPolynomial<C>>	WordPseudoReduction.normalformRecursive(List<GenWordPolynomial<GenPolynomial<C>>> Pp, GenWordPolynomial<GenPolynomial<C>> Ap)	Left normalform recursive.
GenWordPolynomial<GenPolynomial<C>>	WordPseudoReductionSeq.normalformRecursive(List<GenWordPolynomial<GenPolynomial<C>>> Pp, GenWordPolynomial<GenPolynomial<C>> Ap)	Normalform with polynomial coefficients.
GenWordPolynomial<GenPolynomial<C>>	WordGroebnerBasePseudoRecSeq.recursivePrimitivePart(GenWordPolynomial<GenPolynomial<C>> P)	GenWordPolynomial recursive coefficient primitive part.
GenWordPolynomial<C>	WordPseudoReductionSeq.rightNormalform(List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)
GenWordPolynomial<C>	WordPseudoReductionSeq.rightNormalform(List<GenWordPolynomial<C>> rrow, List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)

Methods in edu.jas.gbufd that return types with arguments of type GenWordPolynomial

Modifier and Type	Method	Description
List<GenWordPolynomial<C>>	WordGroebnerBasePseudoSeq.basePrimitivePart(List<GenWordPolynomial<C>> F)	List of GenWordPolynomial base coefficient primitive part.
List<GenWordPolynomial<GenPolynomial<C>>>	WordGroebnerBasePseudoRecSeq.GB(List<GenWordPolynomial<GenPolynomial<C>>> F)	Word Groebner base using word pairlist class.
List<GenWordPolynomial<C>>	WordGroebnerBasePseudoSeq.GB(List<GenWordPolynomial<C>> F)	Word Groebner base using word pairlist class.
static <C extends GcdRingElem<C>> List<GenWordPolynomial<C>>	PolyGBUtil.intersect(GenWordPolynomialRing<C> pfac, List<GenWordPolynomial<C>> A, List<GenWordPolynomial<C>> B)	Intersection.
static <C extends GcdRingElem<C>> List<GenWordPolynomial<C>>	PolyGBUtil.intersect(GenWordPolynomialRing<C> pfac, List<GenWordPolynomial<C>> A, List<GenWordPolynomial<C>> B, WordGroebnerBaseAbstract<C> bb)	Intersection.
List<GenWordPolynomial<GenPolynomial<C>>>	WordGroebnerBasePseudoRecSeq.minimalGB(List<GenWordPolynomial<GenPolynomial<C>>> Gp)	Minimal ordered Groebner basis.
List<GenWordPolynomial<GenPolynomial<C>>>	WordGroebnerBasePseudoRecSeq.recursivePrimitivePart(List<GenWordPolynomial<GenPolynomial<C>>> F)	List of GenWordPolynomial recursive coefficient primitive part.

Methods in edu.jas.gbufd with parameters of type GenWordPolynomial

Modifier and Type	Method	Description
C	WordGroebnerBasePseudoSeq.baseContent(GenWordPolynomial<C> P)	GenWordPolynomial base coefficient content.
GenWordPolynomial<C>	WordGroebnerBasePseudoSeq.basePrimitivePart(GenWordPolynomial<C> P)	GenWordPolynomial base coefficient primitive part.
GenWordPolynomial<C>	WordPseudoReductionSeq.leftNormalform(List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)
GenWordPolynomial<C>	WordPseudoReductionSeq.leftNormalform(List<GenWordPolynomial<C>> lrow, List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)
GenWordPolynomial<C>	WordPseudoReductionSeq.normalform(List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Normalform.
GenWordPolynomial<C>	WordPseudoReductionSeq.normalform(List<GenWordPolynomial<C>> lrow, List<GenWordPolynomial<C>> rrow, List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Normalform with left and right recording.
WordPseudoReductionEntry<C>	WordPseudoReduction.normalformFactor(List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Left normalform with multiplication factor.
WordPseudoReductionEntry<C>	WordPseudoReductionSeq.normalformFactor(List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Normalform with multiplication factor.
GenWordPolynomial<GenPolynomial<C>>	WordPseudoReduction.normalformRecursive(List<GenWordPolynomial<GenPolynomial<C>>> Pp, GenWordPolynomial<GenPolynomial<C>> Ap)	Left normalform recursive.
GenWordPolynomial<GenPolynomial<C>>	WordPseudoReductionSeq.normalformRecursive(List<GenWordPolynomial<GenPolynomial<C>>> Pp, GenWordPolynomial<GenPolynomial<C>> Ap)	Normalform with polynomial coefficients.
GenPolynomial<C>	WordGroebnerBasePseudoRecSeq.recursiveContent(GenWordPolynomial<GenPolynomial<C>> P)	GenWordPolynomial recursive coefficient content.
GenWordPolynomial<GenPolynomial<C>>	WordGroebnerBasePseudoRecSeq.recursivePrimitivePart(GenWordPolynomial<GenPolynomial<C>> P)	GenWordPolynomial recursive coefficient primitive part.
GenWordPolynomial<C>	WordPseudoReductionSeq.rightNormalform(List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)
GenWordPolynomial<C>	WordPseudoReductionSeq.rightNormalform(List<GenWordPolynomial<C>> rrow, List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)

Method parameters in edu.jas.gbufd with type arguments of type GenWordPolynomial

Modifier and Type	Method	Description
List<GenWordPolynomial<C>>	WordGroebnerBasePseudoSeq.basePrimitivePart(List<GenWordPolynomial<C>> F)	List of GenWordPolynomial base coefficient primitive part.
List<GenWordPolynomial<GenPolynomial<C>>>	WordGroebnerBasePseudoRecSeq.GB(List<GenWordPolynomial<GenPolynomial<C>>> F)	Word Groebner base using word pairlist class.
List<GenWordPolynomial<C>>	WordGroebnerBasePseudoSeq.GB(List<GenWordPolynomial<C>> F)	Word Groebner base using word pairlist class.
static <C extends GcdRingElem<C>> List<GenWordPolynomial<C>>	PolyGBUtil.intersect(GenWordPolynomialRing<C> pfac, List<GenWordPolynomial<C>> A, List<GenWordPolynomial<C>> B)	Intersection.
static <C extends GcdRingElem<C>> List<GenWordPolynomial<C>>	PolyGBUtil.intersect(GenWordPolynomialRing<C> pfac, List<GenWordPolynomial<C>> A, List<GenWordPolynomial<C>> B, WordGroebnerBaseAbstract<C> bb)	Intersection.
boolean	WordGroebnerBasePseudoRecSeq.isGB(List<GenWordPolynomial<GenPolynomial<C>>> F)	Wird Groebner base simple test.
GenWordPolynomial<C>	WordPseudoReductionSeq.leftNormalform(List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)
GenWordPolynomial<C>	WordPseudoReductionSeq.leftNormalform(List<GenWordPolynomial<C>> lrow, List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)
List<GenWordPolynomial<GenPolynomial<C>>>	WordGroebnerBasePseudoRecSeq.minimalGB(List<GenWordPolynomial<GenPolynomial<C>>> Gp)	Minimal ordered Groebner basis.
GenWordPolynomial<C>	WordPseudoReductionSeq.normalform(List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Normalform.
GenWordPolynomial<C>	WordPseudoReductionSeq.normalform(List<GenWordPolynomial<C>> lrow, List<GenWordPolynomial<C>> rrow, List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Normalform with left and right recording.
WordPseudoReductionEntry<C>	WordPseudoReduction.normalformFactor(List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Left normalform with multiplication factor.
WordPseudoReductionEntry<C>	WordPseudoReductionSeq.normalformFactor(List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)	Normalform with multiplication factor.
GenWordPolynomial<GenPolynomial<C>>	WordPseudoReduction.normalformRecursive(List<GenWordPolynomial<GenPolynomial<C>>> Pp, GenWordPolynomial<GenPolynomial<C>> Ap)	Left normalform recursive.
GenWordPolynomial<GenPolynomial<C>>	WordPseudoReductionSeq.normalformRecursive(List<GenWordPolynomial<GenPolynomial<C>>> Pp, GenWordPolynomial<GenPolynomial<C>> Ap)	Normalform with polynomial coefficients.
List<GenWordPolynomial<GenPolynomial<C>>>	WordGroebnerBasePseudoRecSeq.recursivePrimitivePart(List<GenWordPolynomial<GenPolynomial<C>>> F)	List of GenWordPolynomial recursive coefficient primitive part.
GenWordPolynomial<C>	WordPseudoReductionSeq.rightNormalform(List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)
GenWordPolynomial<C>	WordPseudoReductionSeq.rightNormalform(List<GenWordPolynomial<C>> rrow, List<GenWordPolynomial<C>> Pp, GenWordPolynomial<C> Ap)

Constructors in edu.jas.gbufd with parameters of type GenWordPolynomial

Modifier	Constructor	Description
	WordPseudoReductionEntry(GenWordPolynomial<C> pol, C multiplicator)

Uses of GenWordPolynomial in edu.jas.poly

Subclasses with type arguments of type GenWordPolynomial in edu.jas.poly

Modifier and Type	Class	Description
class	RecSolvableWordPolynomial<C extends RingElem<C>>	RecSolvableWordPolynomial generic recursive solvable polynomials implementing RingElem.
class	RecSolvableWordPolynomialRing<C extends RingElem<C>>	RecSolvableWordPolynomialRing generic recursive solvable polynomial factory implementing RingFactory and extending GenSolvablePolynomialRing factory.

Classes in edu.jas.poly that implement interfaces with type arguments of type GenWordPolynomial

Modifier and Type	Class	Description
final class	GenWordPolynomial<C extends RingElem<C>>	GenWordPolynomial generic polynomials implementing RingElem.
final class	GenWordPolynomialRing<C extends RingElem<C>>	GenWordPolynomialRing generic polynomial factory implementing RingFactory; Factory for non-commutative string polynomials over C.

Fields in edu.jas.poly declared as GenWordPolynomial

Modifier and Type	Field	Description
final GenWordPolynomial<C>	GenWordPolynomialRing.ONE	The constant polynomial 1 for this ring.
final GenWordPolynomial<C>	GenWordPolynomialRing.ZERO	The constant polynomial 0 for this ring.

Fields in edu.jas.poly with type parameters of type GenWordPolynomial

Modifier and Type	Field	Description
final RelationTable<GenWordPolynomial<C>>	RecSolvableWordPolynomialRing.coeffTable	The solvable multiplication relations between variables and coefficients.

Methods in edu.jas.poly that return GenWordPolynomial

Modifier and Type	Method	Description
GenWordPolynomial<C>	GenWordPolynomial.abs()	GenWordPolynomial absolute value, i.e.
GenWordPolynomial<C>	GenWordPolynomialRing.commute(int i, int j)	Generate commute polynomial in two variables.
GenWordPolynomial<C>	GenWordPolynomial.contract(GenWordPolynomialRing<C> fac)	GenWordPolynomial contraction.
GenWordPolynomial<C>	GenWordPolynomial.copy()	Copy this GenWordPolynomial.
GenWordPolynomial<C>	GenWordPolynomialRing.copy(GenWordPolynomial<C> c)	Copy polynomial c.
GenWordPolynomial<C>	GenWordPolynomial.divide(C s)	GenWordPolynomial division.
GenWordPolynomial<C>	GenWordPolynomial.divide(GenWordPolynomial<C> S)	GenWordPolynomial division.
GenWordPolynomial<C>[]	GenWordPolynomial.egcd(GenWordPolynomial<C> S)	GenWordPolynomial extended greatest common divisor.
GenWordPolynomial<C>	GenWordPolynomialRing.fromInteger(long a)	Get a (constant) GenWordPolynomial<C> element from a long value.
GenWordPolynomial<C>	GenWordPolynomialRing.fromInteger(BigInteger a)	Get a (constant) GenWordPolynomial<C> element from a BigInteger value.
GenWordPolynomial<C>	GenWordPolynomial.gcd(GenWordPolynomial<C> S)	GenWordPolynomial greatest common divisor.
GenWordPolynomial<C>	GenWordPolynomialRing.getONE()	Get the one element.
GenWordPolynomial<C>	GenWordPolynomialRing.getZERO()	Get the zero element.
GenWordPolynomial<C>[]	GenWordPolynomial.hegcd(GenWordPolynomial<C> S)	GenWordPolynomial half extended greatest common divisor.
GenWordPolynomial<C>	GenWordPolynomial.inverse()	GenWordPolynomial inverse.
GenWordPolynomial<C>	GenWordPolynomial.map(UnaryFunctor<? super C, C> f)	Map a unary function to the coefficients.
GenWordPolynomial<C>	GenWordPolynomial.modInverse(GenWordPolynomial<C> m)	GenWordPolynomial modular inverse.
GenWordPolynomial<C>	GenWordPolynomial.monic()	GenWordPolynomial monic, i.e.
GenWordPolynomial<C>	GenWordPolynomial.multiply(C s)	GenWordPolynomial multiplication.
GenWordPolynomial<C>	GenWordPolynomial.multiply(C s, C t)	GenWordPolynomial multiplication.
GenWordPolynomial<C>	GenWordPolynomial.multiply(C s, Word e)	GenWordPolynomial multiplication.
GenWordPolynomial<C>	GenWordPolynomial.multiply(C s, Word e, C t, Word f)	GenWordPolynomial left and right multiplication.
GenWordPolynomial<C>	GenWordPolynomial.multiply(C s, Word e, Word f)	GenWordPolynomial left and right multiplication.
GenWordPolynomial<C>	GenWordPolynomial.multiply(GenWordPolynomial<C> S)	GenWordPolynomial multiplication.
GenWordPolynomial<C>	GenWordPolynomial.multiply(GenWordPolynomial<C> S, GenWordPolynomial<C> T)	GenWordPolynomial left and right multiplication.
GenWordPolynomial<C>	GenWordPolynomial.multiply(Word e)	GenWordPolynomial multiplication.
GenWordPolynomial<C>	GenWordPolynomial.multiply(Word e, Word f)	GenWordPolynomial left and right multiplication.
GenWordPolynomial<C>	GenWordPolynomial.multiply(Map.Entry<Word,C> m)	GenWordPolynomial multiplication.
GenWordPolynomial<C>	GenWordPolynomial.negate()	GenWordPolynomial negation.
GenWordPolynomial	GenPolynomialTokenizer.nextWordPolynomial()	Parsing method for word polynomial.
GenWordPolynomial	GenPolynomialTokenizer.nextWordPolynomial(GenWordPolynomialRing wfac)	Parsing method for word polynomial.
GenWordPolynomial<C>	GenWordPolynomialRing.parse(Reader r)	Parse a polynomial with the use of GenWordPolynomialTokenizer.
GenWordPolynomial<C>	GenWordPolynomialRing.parse(String s)	Parse a polynomial with the use of GenWordPolynomialTokenizer.
GenWordPolynomial<C>[]	GenWordPolynomial.quotientRemainder(GenWordPolynomial<C> S)	GenWordPolynomial division with remainder.
GenWordPolynomial<C>	GenWordPolynomialRing.random(int n)	Random polynomial.
GenWordPolynomial<C>	GenWordPolynomialRing.random(int k, int l, int d)	Generate a random polynomial.
GenWordPolynomial<C>	GenWordPolynomialRing.random(int k, int l, int d, Random rnd)	Generate a random polynomial.
GenWordPolynomial<C>	GenWordPolynomialRing.random(int n, Random rnd)	Random polynomial.
static <C extends RingElem<C>> GenWordPolynomial<GenPolynomial<C>>	PolyUtil.recursiveDivide(GenWordPolynomial<GenPolynomial<C>> P, GenPolynomial<C> s)	GenPolynomial divide.
GenWordPolynomial<C>	GenWordPolynomial.reductum()	Reductum.
GenWordPolynomial<C>	GenWordPolynomial.remainder(GenWordPolynomial<C> S)	GenWordPolynomial remainder.
GenWordPolynomial<C>	GenWordPolynomial.subtract(C a)	GenWordPolynomial subtract.
GenWordPolynomial<C>	GenWordPolynomial.subtract(C a, Word e)	GenWordPolynomial subtraction.
GenWordPolynomial<C>	GenWordPolynomial.subtract(GenWordPolynomial<C> S)	GenWordPolynomial subtraction.
GenWordPolynomial<C>	GenWordPolynomial.sum(C a)	GenWordPolynomial addition.
GenWordPolynomial<C>	GenWordPolynomial.sum(C a, Word e)	GenWordPolynomial addition.
GenWordPolynomial<C>	GenWordPolynomial.sum(GenWordPolynomial<C> S)	GenWordPolynomial summation.
GenWordPolynomial<C>	GenWordPolynomialRing.univariate(int i)	Generate univariate polynomial in a given variable.
GenWordPolynomial<C>	GenWordPolynomialRing.valueOf(C a)	Get a (constant) GenWordPolynomial<C> element from a coefficient value.
GenWordPolynomial<C>	GenWordPolynomialRing.valueOf(C a, ExpVector e)	Get a GenWordPolynomial<C> element from a coefficient and an ExpVector.
GenWordPolynomial<C>	GenWordPolynomialRing.valueOf(C a, Word e)	Get a GenWordPolynomial<C> element from a coefficient and a word.
GenWordPolynomial<C>	GenWordPolynomialRing.valueOf(ExpVector e)	Get a GenWordPolynomial<C> element from an ExpVector.
GenWordPolynomial<C>	GenWordPolynomialRing.valueOf(GenPolynomial<C> a)	Get a GenWordPolynomial<C> element from a GenPolynomial<C>.
GenWordPolynomial<C>	GenWordPolynomialRing.valueOf(GenWordPolynomial<C> a)	Get a GenWordPolynomial<C> element from a GenWordPolynomial<C>.
GenWordPolynomial<C>	GenWordPolynomialRing.valueOf(Word e)	Get a GenWordPolynomial<C> element from a word.

Methods in edu.jas.poly that return types with arguments of type GenWordPolynomial

Modifier and Type	Method	Description
List<GenWordPolynomial<C>>	GenWordPolynomialRing.commute()	Generate commute polynomials for all variables.
List<GenWordPolynomial<C>>	GenWordPolynomialRing.commute(int i)	Generate commute polynomials for given variable.
List<GenWordPolynomial<C>>	GenWordPolynomialRing.generators()	Get a list of all generating elements.
List<GenWordPolynomial<C>>	GenWordPolynomialRing.getGenerators()	Get the generating elements excluding the generators for the coefficient ring.
static <C extends RingElem<C>> List<GenWordPolynomial<C>>	PolyUtil.intersect(GenWordPolynomialRing<C> R, List<GenWordPolynomial<C>> F)	Intersection.
List<GenWordPolynomial>	GenPolynomialTokenizer.nextWordPolynomialList()	Parsing method for word polynomial list.
List<GenWordPolynomial>	GenPolynomialTokenizer.nextWordPolynomialList(GenWordPolynomialRing wfac)	Parsing method for word polynomial list.
GenSolvablePolynomialRing<GenWordPolynomial<C>>	RecSolvableWordPolynomialRing.permutation(List<Integer> P)	Permutation of polynomial ring variables.
List<GenWordPolynomial<C>>	GenWordPolynomialRing.univariateList()	Generate list of univariate polynomials in all variables.
List<GenWordPolynomial<C>>	GenWordPolynomialRing.valueOf(List<GenPolynomial<C>> A)	Get a list of GenWordPolynomial<C> element from a list of GenPolynomial<C>.
static <C extends RingElem<C>> List<GenWordPolynomial<C>>	PolyUtil.wordMonic(List<GenWordPolynomial<C>> L)	Word polynomial list monic.

Methods in edu.jas.poly with parameters of type GenWordPolynomial

Modifier and Type	Method	Description
int	GenWordPolynomial.compareTo(GenWordPolynomial<C> b)	GenWordPolynomial comparison.
GenWordPolynomial<C>	GenWordPolynomialRing.copy(GenWordPolynomial<C> c)	Copy polynomial c.
GenWordPolynomial<C>	GenWordPolynomial.divide(GenWordPolynomial<C> S)	GenWordPolynomial division.
GenWordPolynomial<C>[]	GenWordPolynomial.egcd(GenWordPolynomial<C> S)	GenWordPolynomial extended greatest common divisor.
GenWordPolynomial<C>	GenWordPolynomial.gcd(GenWordPolynomial<C> S)	GenWordPolynomial greatest common divisor.
GenWordPolynomial<C>[]	GenWordPolynomial.hegcd(GenWordPolynomial<C> S)	GenWordPolynomial half extended greatest common divisor.
GenWordPolynomial<C>	GenWordPolynomial.modInverse(GenWordPolynomial<C> m)	GenWordPolynomial modular inverse.
GenWordPolynomial<C>	GenWordPolynomial.multiply(GenWordPolynomial<C> S)	GenWordPolynomial multiplication.
GenWordPolynomial<C>	GenWordPolynomial.multiply(GenWordPolynomial<C> S, GenWordPolynomial<C> T)	GenWordPolynomial left and right multiplication.
RecSolvableWordPolynomial<C>	RecSolvableWordPolynomial.multiply(GenWordPolynomial<C> b, ExpVector e)	RecSolvableWordPolynomial multiplication.
RecSolvableWordPolynomial<C>	RecSolvableWordPolynomial.multiply(GenWordPolynomial<C> b, ExpVector e, GenWordPolynomial<C> c, ExpVector f)	RecSolvableWordPolynomial left and right multiplication.
RecSolvableWordPolynomial<C>	RecSolvableWordPolynomial.multiply(GenWordPolynomial<C> b, GenWordPolynomial<C> c)	RecSolvableWordPolynomial left and right multiplication.
RecSolvableWordPolynomial<C>	RecSolvableWordPolynomial.multiplyLeft(GenWordPolynomial<C> b)	RecSolvableWordPolynomial multiplication.
RecSolvableWordPolynomial<C>	RecSolvableWordPolynomial.multiplyLeft(GenWordPolynomial<C> b, ExpVector e)	RecSolvableWordPolynomial multiplication.
GenWordPolynomial<C>[]	GenWordPolynomial.quotientRemainder(GenWordPolynomial<C> S)	GenWordPolynomial division with remainder.
RecSolvableWordPolynomial<C>	RecSolvableWordPolynomial.recMultiply(GenWordPolynomial<C> b)	RecSolvableWordPolynomial multiplication.
static <C extends RingElem<C>> GenWordPolynomial<GenPolynomial<C>>	PolyUtil.recursiveDivide(GenWordPolynomial<GenPolynomial<C>> P, GenPolynomial<C> s)	GenPolynomial divide.
GenWordPolynomial<C>	GenWordPolynomial.remainder(GenWordPolynomial<C> S)	GenWordPolynomial remainder.
GenWordPolynomial<C>	GenWordPolynomial.subtract(GenWordPolynomial<C> S)	GenWordPolynomial subtraction.
GenWordPolynomial<C>	GenWordPolynomial.sum(GenWordPolynomial<C> S)	GenWordPolynomial summation.
GenWordPolynomial<C>	GenWordPolynomialRing.valueOf(GenWordPolynomial<C> a)	Get a GenWordPolynomial<C> element from a GenWordPolynomial<C>.
RecSolvableWordPolynomial<C>	RecSolvableWordPolynomialRing.valueOf(GenWordPolynomial<C> a)	Get a (constant) RecSolvableWordPolynomial<C> element from a coefficient value.
RecSolvableWordPolynomial<C>	RecSolvableWordPolynomialRing.valueOf(GenWordPolynomial<C> a, ExpVector e)	Get a RecSolvableWordPolynomial<C> element from a coefficient and an ExpVector.

Method parameters in edu.jas.poly with type arguments of type GenWordPolynomial

Modifier and Type	Method	Description
static <C extends RingElem<C>> List<GenWordPolynomial<C>>	PolyUtil.intersect(GenWordPolynomialRing<C> R, List<GenWordPolynomial<C>> F)	Intersection.
RecSolvableWordPolynomial<C>	RecSolvableWordPolynomial.multiply(Map.Entry<ExpVector, GenWordPolynomial<C>> m)	RecSolvableWordPolynomial multiplication.
RecSolvableWordPolynomial<C>	RecSolvableWordPolynomial.multiplyLeft(Map.Entry<ExpVector, GenWordPolynomial<C>> m)	RecSolvableWordPolynomial multiplication.
static <C extends RingElem<C>> List<GenWordPolynomial<C>>	PolyUtil.wordMonic(List<GenWordPolynomial<C>> L)	Word polynomial list monic.

Constructors in edu.jas.poly with parameters of type GenWordPolynomial

Modifier	Constructor	Description
	RecSolvableWordPolynomial(RecSolvableWordPolynomialRing<C> r, GenWordPolynomial<C> c)	Constructor for RecSolvableWordPolynomial.
	RecSolvableWordPolynomial(RecSolvableWordPolynomialRing<C> r, GenWordPolynomial<C> c, ExpVector e)	Constructor for RecSolvableWordPolynomial.

Constructor parameters in edu.jas.poly with type arguments of type GenWordPolynomial

Modifier	Constructor	Description
	RecSolvableWordPolynomial(RecSolvableWordPolynomialRing<C> r, GenSolvablePolynomial<GenWordPolynomial<C>> S)	Constructor for RecSolvableWordPolynomial.
protected	RecSolvableWordPolynomial(RecSolvableWordPolynomialRing<C> r, SortedMap<ExpVector, GenWordPolynomial<C>> v)	Constructor for RecSolvableWordPolynomial.
	RecSolvableWordPolynomialRing(RingFactory<GenWordPolynomial<C>> cf, int n)	The constructor creates a solvable polynomial factory object with the default term order and commutative relations.
	RecSolvableWordPolynomialRing(RingFactory<GenWordPolynomial<C>> cf, int n, RelationTable<GenWordPolynomial<C>> rt)	The constructor creates a solvable polynomial factory object with the default term order.
	RecSolvableWordPolynomialRing(RingFactory<GenWordPolynomial<C>> cf, int n, RelationTable<GenWordPolynomial<C>> rt)	The constructor creates a solvable polynomial factory object with the default term order.
	RecSolvableWordPolynomialRing(RingFactory<GenWordPolynomial<C>> cf, int n, TermOrder t)	The constructor creates a solvable polynomial factory object with the given term order and commutative relations.
	RecSolvableWordPolynomialRing(RingFactory<GenWordPolynomial<C>> cf, int n, TermOrder t, RelationTable<GenWordPolynomial<C>> rt)	The constructor creates a solvable polynomial factory object with the given term order.
	RecSolvableWordPolynomialRing(RingFactory<GenWordPolynomial<C>> cf, int n, TermOrder t, RelationTable<GenWordPolynomial<C>> rt)	The constructor creates a solvable polynomial factory object with the given term order.
	RecSolvableWordPolynomialRing(RingFactory<GenWordPolynomial<C>> cf, int n, TermOrder t, String[] v)	The constructor creates a solvable polynomial factory object with the given term order and commutative relations.
	RecSolvableWordPolynomialRing(RingFactory<GenWordPolynomial<C>> cf, int n, TermOrder t, String[] v, RelationTable<GenWordPolynomial<C>> rt)	The constructor creates a solvable polynomial factory object with the given term order.
	RecSolvableWordPolynomialRing(RingFactory<GenWordPolynomial<C>> cf, int n, TermOrder t, String[] v, RelationTable<GenWordPolynomial<C>> rt)	The constructor creates a solvable polynomial factory object with the given term order.
	RecSolvableWordPolynomialRing(RingFactory<GenWordPolynomial<C>> cf, RecSolvableWordPolynomialRing o)	The constructor creates a solvable polynomial factory object with the the same term order, number of variables and variable names as the given polynomial factory, only the coefficient factories differ and the solvable multiplication relations are empty.
	RecSolvableWordPolynomialRing(RingFactory<GenWordPolynomial<C>> cf, TermOrder t, String[] v)	The constructor creates a solvable polynomial factory object with the given term order and commutative relations.
	RecSolvableWordPolynomialRing(RingFactory<GenWordPolynomial<C>> cf, String[] v)	The constructor creates a solvable polynomial factory object with the default term order.