MOD
- public class FactorInteger<MOD extends GcdRingElem<MOD> & Modular> extends FactorAbstract<BigInteger>
Modifier and Type | Field and Description |
---|---|
protected GreatestCommonDivisorAbstract<MOD> |
mengine
Gcd engine for modular base coefficients.
|
protected FactorAbstract<MOD> |
mfactor
Factorization engine for modular base coefficients.
|
engine, sengine
Constructor and Description |
---|
FactorInteger()
No argument constructor.
|
FactorInteger(RingFactory<BigInteger> cfac)
Constructor.
|
Modifier and Type | Method and Description |
---|---|
java.util.List<GenPolynomial<BigInteger>> |
baseFactorsSquarefree(GenPolynomial<BigInteger> P)
GenPolynomial base factorization of a squarefree polynomial.
|
static <C extends RingElem<C>> |
degreeSum(java.util.List<GenPolynomial<C>> L)
Sum of all degrees.
|
java.util.BitSet |
factorDegrees(java.util.List<ExpVector> E,
int deg)
BitSet for factor degree list.
|
java.util.List<GenPolynomial<BigInteger>> |
factorsSquarefree(GenPolynomial<BigInteger> P)
GenPolynomial factorization of a multivariate squarefree polynomial,
using Hensel lifting if possible.
|
java.util.List<GenPolynomial<BigInteger>> |
factorsSquarefreeHensel(GenPolynomial<BigInteger> P)
GenPolynomial factorization of a multivariate squarefree polynomial,
using Hensel lifting.
|
boolean |
isIrreducible(GenPolynomial<BigInteger> P)
GenPolynomial test if is irreducible.
|
boolean |
isIrreducibleEisenstein(GenPolynomial<BigInteger> P)
GenPolynomial test if is irreducible with Eisenstein criterion.
|
baseFactors, baseFactorsRadical, basePrimitivePart, factors, factorsDegree, factorsRadical, factorsRadical, factorsSquarefreeKronecker, factorsSquarefreeOptimize, isFactorization, isFactorization, isRecursiveFactorization, isReducible, isSquarefree, normalizeFactorization, primitivePart, recursiveFactors, recursiveFactorsSquarefree, squarefreeFactors, squarefreePart, toString
protected final FactorAbstract<MOD extends GcdRingElem<MOD> & Modular> mfactor
protected final GreatestCommonDivisorAbstract<MOD extends GcdRingElem<MOD> & Modular> mengine
public FactorInteger()
public FactorInteger(RingFactory<BigInteger> cfac)
cfac
- coefficient ring factory.public boolean isIrreducible(GenPolynomial<BigInteger> P)
isIrreducible
in interface Factorization<BigInteger>
isIrreducible
in class FactorAbstract<BigInteger>
P
- GenPolynomial.public boolean isIrreducibleEisenstein(GenPolynomial<BigInteger> P)
P
- univariate polynomial.public java.util.List<GenPolynomial<BigInteger>> baseFactorsSquarefree(GenPolynomial<BigInteger> P)
baseFactorsSquarefree
in class FactorAbstract<BigInteger>
P
- squarefree and primitive! GenPolynomial.public java.util.BitSet factorDegrees(java.util.List<ExpVector> E, int deg)
E
- exponent vector list.public static <C extends RingElem<C>> long degreeSum(java.util.List<GenPolynomial<C>> L)
L
- univariate polynomial list.public java.util.List<GenPolynomial<BigInteger>> factorsSquarefree(GenPolynomial<BigInteger> P)
factorsSquarefree
in interface Factorization<BigInteger>
factorsSquarefree
in class FactorAbstract<BigInteger>
P
- squarefree and primitive! (respectively monic) multivariate
GenPolynomial over the integers.public java.util.List<GenPolynomial<BigInteger>> factorsSquarefreeHensel(GenPolynomial<BigInteger> P)
P
- squarefree and primitive! (respectively monic) multivariate
GenPolynomial over the integers.