14#ifndef FAC_FQ_SQUAREFREE_H
15#define FAC_FQ_SQUAREFREE_H
48 for (
int i= n;
i >= 1;
i++)
52 if (bufResult.
getFirst().factor().inCoeffDomain())
62 if (bufResult.
getFirst().factor().inCoeffDomain())
87 for (
int i= n;
i >= 1;
i++)
91 if (bufResult.
getFirst().factor().inCoeffDomain())
101 if (bufResult.
getFirst().factor().inCoeffDomain())
121 "GF as base field expected");
static void sort(int **points, int sizePoints)
#define ASSERT(expression, message)
#define GaloisFieldDomain
Interface to generate InternalCF's over various domains from intrinsic types or mpz_t's.
factory's class for variables
CFFList GFSqrf(const CanonicalForm &F, bool sort=true)
squarefree factorization over GF. If input is not monic, the leading coefficient is dropped
CanonicalForm maxpthRoot(const CanonicalForm &F, int q, int &l)
p^l-th root extraction, where l is maximal
CFFList FqSqrf(const CanonicalForm &F, const Variable &alpha, bool sort=true)
squarefree factorization over . If input is not monic, the leading coefficient is dropped
CFFList squarefreeFactorization(const CanonicalForm &F, const Variable &alpha)
squarefree factorization over a finite field return a list of squarefree factors with multiplicity
CFFList FpSqrf(const CanonicalForm &F, bool sort=true)
squarefree factorization over . If input is not monic, the leading coefficient is dropped
CanonicalForm sqrfPart(const CanonicalForm &F, CanonicalForm &pthPower, const Variable &alpha)
squarefree part of F/g, where g is the product of those squarefree factors whose multiplicity is 0 mo...
CFFList sortCFFList(CFFList &F)
squarefree part and factorization over Q, Q(a)
template List< Variable > Union(const List< Variable > &, const List< Variable > &)