Uses of Class
edu.jas.poly.GenSolvablePolynomialRing
Packages that use GenSolvablePolynomialRing
Package
Description
Groebner base application package.
Factorization domain package for solvable polynomial rings.
Groebner bases package.
Groebner bases using unique factorization package.
Generic coefficients polynomial package.
-
Uses of GenSolvablePolynomialRing in edu.jas.application
Subclasses of GenSolvablePolynomialRing in edu.jas.applicationModifier and TypeClassDescriptionclass
LocalSolvablePolynomialRing<C extends GcdRingElem<C>>
LocalSolvablePolynomialRing generic recursive solvable polynomial factory implementing RingFactory and extending GenSolvablePolynomialRing factory.class
ResidueSolvablePolynomialRing<C extends GcdRingElem<C>>
ResidueSolvablePolynomialRing generic solvable polynomial with residue coefficients factory implementing RingFactory and extending GenSolvablePolynomialRing factory.class
ResidueSolvableWordPolynomialRing<C extends GcdRingElem<C>>
ResidueSolvableWordPolynomialRing solvable polynomial with word residue coefficients factory.Fields in edu.jas.application declared as GenSolvablePolynomialRingModifier and TypeFieldDescriptionfinal GenSolvablePolynomialRing
<C> SolvableLocalResidueRing.ring
Solvable polynomial ring of the factory.final GenSolvablePolynomialRing
<C> SolvableLocalRing.ring
Solvable polynomial ring of the factory.final GenSolvablePolynomialRing
<C> SolvableResidueRing.ring
Polynomial ring of the factory.private GenSolvablePolynomialRing
RingFactoryTokenizer.spfac
Methods in edu.jas.application that return GenSolvablePolynomialRingModifier and TypeMethodDescriptionSolvableIdeal.getRing()
Get the GenSolvablePolynomialRing.RingFactoryTokenizer.nextSolvablePolynomialRing()
Parsing method for solvable polynomial ring.RingFactoryTokenizer.nextSolvableSubModuleRing()
Parsing method for solvable module ring.SolvableLocalResidueRing.pairFactory()
Factory for base elements.SolvableLocalRing.pairFactory()
Factory for base elements.SolvableResidueRing.pairFactory()
Factory for base elements.ResidueSolvableWordPolynomialRing.permutation
(List<Integer> P) Permutation of polynomial ring variables.SolvableResidueRing.valueFactory()
Factory for base elements.Methods in edu.jas.application with parameters of type GenSolvablePolynomialRingModifier and TypeMethodDescriptionSolvableIdeal.eliminate
(GenSolvablePolynomialRing<C> R) Eliminate.SolvableIdeal.intersect
(GenSolvablePolynomialRing<C> R) Intersection.Constructors in edu.jas.application with parameters of type GenSolvablePolynomialRingModifierConstructorDescriptionThe 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.Constructor.SolvableIdeal
(GenSolvablePolynomialRing<C> ring, List<GenSolvablePolynomial<C>> F) Constructor.SolvableIdeal
(GenSolvablePolynomialRing<C> ring, List<GenSolvablePolynomial<C>> F, boolean gb) Constructor.SolvableIdeal
(GenSolvablePolynomialRing<C> ring, List<GenSolvablePolynomial<C>> F, boolean gb, boolean topt) Constructor.SolvableIdeal
(GenSolvablePolynomialRing<C> ring, List<GenSolvablePolynomial<C>> F, boolean gb, SolvableIdeal.Side s) Constructor.SolvableIdeal
(GenSolvablePolynomialRing<C> ring, List<GenSolvablePolynomial<C>> F, SolvableIdeal.Side s) Constructor. -
Uses of GenSolvablePolynomialRing in edu.jas.fd
Subclasses of GenSolvablePolynomialRing in edu.jas.fdModifier and TypeClassDescriptionclass
QuotSolvablePolynomialRing<C extends GcdRingElem<C>>
QuotSolvablePolynomialRing generic recursive solvable polynomial factory implementing RingFactory and extending GenSolvablePolynomialRing factory.Fields in edu.jas.fd declared as GenSolvablePolynomialRingModifier and TypeFieldDescriptionfinal GenSolvablePolynomialRing
<C> SolvableQuotientRing.ring
Solvable polynomial ring of the factory.Methods in edu.jas.fd that return GenSolvablePolynomialRingMethods in edu.jas.fd with parameters of type GenSolvablePolynomialRingModifier and TypeMethodDescriptionstatic <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.static <C extends GcdRingElem<C>>
List<GenSolvablePolynomial<GenPolynomial<C>>> FDUtil.integralFromQuotientCoefficients
(GenSolvablePolynomialRing<GenPolynomial<C>> fac, Collection<GenSolvablePolynomial<SolvableQuotient<C>>> L) Integral solvable polynomial from solvable rational function coefficients.GreatestCommonDivisorAbstract.leftGcdCofactors
(GenSolvablePolynomialRing<C> r, GenSolvablePolynomial<C> n, GenSolvablePolynomial<C> d) Left greatest common divisor and cofactors.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.static <C extends GcdRingElem<C>>
List<GenSolvablePolynomial<SolvableQuotient<C>>> FDUtil.quotientFromIntegralCoefficients
(GenSolvablePolynomialRing<SolvableQuotient<C>> fac, Collection<GenSolvablePolynomial<GenPolynomial<C>>> L) Solvable rational function from integral solvable polynomial coefficients.GreatestCommonDivisorAbstract.rightGcdCofactors
(GenSolvablePolynomialRing<C> r, GenSolvablePolynomial<C> n, GenSolvablePolynomial<C> d) Right greatest common divisor and cofactors.Constructors in edu.jas.fd with parameters of type GenSolvablePolynomialRingModifierConstructorDescriptionThe 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.The constructor creates a SolvableQuotientRing object from a GenSolvablePolynomialRing. -
Uses of GenSolvablePolynomialRing in edu.jas.gb
Fields in edu.jas.gb declared as GenSolvablePolynomialRing -
Uses of GenSolvablePolynomialRing in edu.jas.gbufd
Methods in edu.jas.gbufd with parameters of type GenSolvablePolynomialRingModifier and TypeMethodDescriptionstatic <C extends GcdRingElem<C>>
List<GenSolvablePolynomial<C>> PolyGBUtil.intersect
(GenSolvablePolynomialRing<C> pfac, List<GenSolvablePolynomial<C>> A, List<GenSolvablePolynomial<C>> B) Intersection.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. -
Uses of GenSolvablePolynomialRing in edu.jas.poly
Subclasses of GenSolvablePolynomialRing in edu.jas.polyModifier and TypeClassDescriptionclass
QLRSolvablePolynomialRing<C extends GcdRingElem<C> & QuotPair<GenPolynomial<D>>,
D extends GcdRingElem<D>> QLRSolvablePolynomialRing generic recursive solvable polynomial factory implementing RingFactory and extending GenSolvablePolynomialRing factory.class
RecSolvablePolynomialRing<C extends RingElem<C>>
RecSolvablePolynomialRing generic recursive solvable polynomial factory implementing RingFactory and extending GenSolvablePolynomialRing factory.class
RecSolvableWordPolynomialRing<C extends RingElem<C>>
RecSolvableWordPolynomialRing generic recursive solvable polynomial factory implementing RingFactory and extending GenSolvablePolynomialRing factory.Fields in edu.jas.poly declared as GenSolvablePolynomialRingModifier and TypeFieldDescriptionfinal GenSolvablePolynomialRing
<C> GenSolvablePolynomial.ring
The factory for the solvable polynomial ring.final GenSolvablePolynomialRing
<C> RelationTable.ring
The factory for the solvable polynomial ring.private final GenSolvablePolynomialRing
<C> WeylRelations.ring
The factory for the solvable polynomial ring.private final GenSolvablePolynomialRing
<C> WeylRelationsIterated.ring
The factory for the solvable polynomial ring.private GenSolvablePolynomialRing
GenPolynomialTokenizer.spfac
Methods in edu.jas.poly that return GenSolvablePolynomialRingModifier and TypeMethodDescriptionGenSolvablePolynomialRing.contract
(int i) Contract variables.GenSolvablePolynomialRing.distribute()
Distributive representation as polynomial with all main variables.static <C extends RingElem<C>>
GenSolvablePolynomialRing<C> RecSolvablePolynomialRing.distribute
(RecSolvablePolynomialRing<C> rf) Distributive representation as polynomial with all main variables.GenSolvablePolynomialRing.extend
(int i) Extend variables.GenSolvablePolynomialRing.extend
(int i, boolean top) Extend variables.Extend variables.Extend variables.GenSolvablePolynomial.factory()
Get the corresponding element factory.PolynomialList.getSolvableRing()
Get ring as GenSolvablePolynomialRing.RecSolvablePolynomialRing.permutation
(List<Integer> P) Permutation of polynomial ring variables.RecSolvableWordPolynomialRing.permutation
(List<Integer> P) Permutation of polynomial ring variables.GenSolvablePolynomialRing.recursive
(int i) Recursive representation as polynomial ring with i main variables.GenSolvablePolynomialRing.reverse()
Reverse variables.GenSolvablePolynomialRing.reverse
(boolean partial) Reverse variables.Methods in edu.jas.poly with parameters of type GenSolvablePolynomialRingModifier and TypeMethodDescriptionstatic <C extends RingElem<C>>
GenSolvablePolynomial<GenPolynomial<C>> PolyUtil.extendCoefficients
(GenSolvablePolynomialRing<GenPolynomial<C>> pfac, GenSolvablePolynomial<GenPolynomial<C>> A, int j, long k) Extend coefficient variables.void
RelationGenerator.generate
(GenSolvablePolynomialRing<C> ring) Generates the relation table of a solvable polynomial ring.void
WeylRelations.generate
(GenSolvablePolynomialRing<C> ring) Generates the relation table of this ring.void
WeylRelationsIterated.generate
(GenSolvablePolynomialRing<C> ring) Generates the relation table of this ring.static <C extends RingElem<C>>
List<GenSolvablePolynomial<C>> PolyUtil.intersect
(GenSolvablePolynomialRing<C> R, List<GenSolvablePolynomial<C>> F) Intersection.static <C extends RingElem<C>>
List<GenSolvablePolynomial<C>> TermOrderOptimization.permutation
(List<Integer> P, GenSolvablePolynomialRing<C> R, List<GenSolvablePolynomial<C>> L) Permutation of solvable polynomial exponent vectors.static <C extends RingElem<C>>
GenSolvablePolynomial<GenPolynomial<C>> PolyUtil.toRecursive
(GenSolvablePolynomialRing<GenPolynomial<C>> rfac, GenSolvablePolynomial<C> A) To recursive representation.Constructors in edu.jas.poly with parameters of type GenSolvablePolynomialRingModifierConstructorDescriptionConstructor for zero GenSolvablePolynomial.Constructor for GenSolvablePolynomial.Constructor for GenSolvablePolynomial.protected
Constructor for GenSolvablePolynomial.Constructor.Constructor.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.Constructor for RelationTable requires ring factory.RelationTable
(GenSolvablePolynomialRing<C> r, boolean coeffTable) Constructor for RelationTable requires ring factory.The constructor requires a ring factory.The constructor requires a ring factory.