62 for (
int i = 0;
i <= n;
i++)
72 for (
int i= 1;
i <= n;
i++)
103 for (
int i= 1;
i <= n;
i++)
141 for (
int j=
i + 1;
j <=
m;
j++)
221 for (
int i= 2;
i <
l + 1;
i++,
j++)
237 for (
int i = n;
i >= 0;
i--)
243 ASSERT (
A.min() == 2,
"expected A.min() == 2");
252 while ((
i<n) &&(max_deg == 0))
258 for (
int j=
i + 1;
j <= n;
j++)
276 if (
k == 2 && n == 3)
314 LCs [1]= MM (LeadCoeffs [1]);
315 LCs [2]= MM (LeadCoeffs [2]);
318 long termEstimate=
size (U);
320 for (
int i=
A.min();
i <=
A.max();
i++)
323 ((ch >
degree (U,
i)) || ch == 0))
325 termEstimate *=
degree (U,
i)*2;
339 CFList shiftedLCsEval1, shiftedLCsEval2;
348 lcs [0]= shiftedLCsEval1.
getFirst();
349 lcs [1]= shiftedLCsEval2.
getFirst();
360 bool noOneToOne=
false;
364 liftBounds[0]= liftBound;
365 for (
int i= 1;
i < U.
level() - 1;
i++)
368 false, shiftedLCsEval1, shiftedLCsEval2, Pi,
369 diophant, noOneToOne);
388 REvaluation &
b,
int delta,
int degF,
int degG,
int maxeval,
391 if(
count == 0 && delta != 0)
393 if(
count++ > maxeval )
410 if (
count++ > maxeval)
416 if(
degree( Fb, 1 ) == degF )
419 if(
degree( Gb, 1 ) == degG )
424 if(
degree( Db, 1 ) <= delta )
446 if(
count++ > maxeval )
456 for(
int i=pl-1;
i>0;
i--)
exp[
i]=0;
476 for(
int i=ll;
i>=0;
i--)
exp[
i]=0;
486 for(
int i=0;
i<=ll;
i++)
504 int sizeF=
size (FF);
537 CanonicalForm F,
G,
f,
g, d, Fb, Gb, Db, Fbt, Gbt, Dbt, B0,
B, D0, lcF, lcG,
539 CFArray DD( 1, 2 ), lcDD( 1, 2 );
540 int degF, degG, delta, t,
count, maxeval;
560 int best_level= compress4EZGCD (F,
G,
M,
N, smallestDegLev);
595 return N(d*
gcd(F,
g));
630 lcF =
LC( F,
x ); lcG =
LC(
G,
x );
631 lcD =
gcd( lcF, lcG );
640 DEBOUTLN( cerr,
"search for evaluation, delta = " << delta );
644 if (!
findeval( F,
G, Fb, Gb, Db,
b, delta, degF, degG, maxeval,
count,
657 DEBOUTLN( cerr,
"found evaluation b = " <<
b );
675 else if (delta == degG)
700 if (!
findeval( F,
G, Fbt, Gbt, Dbt, bt, delta, degF, degG, maxeval,
count,
723 else if ( dd < delta )
727 Db = Dbt; Fb = Fbt; Gb = Gbt;
729 DEBOUTLN( cerr,
"now after A4, delta = " << delta );
743 else if (delta == degG)
763 if ( delta != degF && delta != degG )
771 xxx1 =
gcd( DD[1], Db );
807 DD[2] = DD[2] * (
b( lcDD[2] ) /
lc( DD[2] ) );
808 DD[1] = DD[1] * (
b( lcDD[1] ) /
lc( DD[1] ) );
812 DEBOUTLN( cerr,
"(hensel) DD = " << DD );
813 DEBOUTLN( cerr,
"(hensel) lcDD = " << lcDD );
815 gcdfound=
Hensel (
B*lcD, DD,
b, lcDD);
817 DEBOUTLN( cerr,
"(hensel finished) DD = " << DD );
835 cand = DD[2] / contcand;
841 "time for termination test in EZ: ")
868#if defined(HAVE_NTL) || defined(HAVE_FLINT)
884 if (FF ==
GG)
return FF/
Lc(FF);
888 int sizeF=
size (FF);
910 CanonicalForm F,
G,
f,
g, d, Fb, Gb, Db, Fbt, Gbt, Dbt, B0,
B, D0, lcF, lcG,
912 CFArray DD( 1, 2 ), lcDD( 1, 2 );
913 int degF, degG, delta,
count;
930 int best_level= compress4EZGCD (F,
G,
M,
N, smallestDegLev);
932 if (best_level == 0)
return G.
genOne();
956 return N(d*
gcd(F,
g));
984 bool passToGF=
false;
985 bool extOfExt=
false;
997 else if (
p == 5 ||
p == 7)
1023 if (
p == 2 && d < 6)
1025 bool primFail=
false;
1028 ASSERT (!primFail,
"failure in integer factorizer");
1032 nmod_poly_t Irredpoly;
1034 nmod_poly_randtest_monic_irreducible(Irredpoly,
FLINTrandom, 3*d+1);
1037 #elif defined(HAVE_NTL)
1044 BuildIrred (NTLIrredpoly, d*3);
1054 nmod_poly_t Irredpoly;
1056 nmod_poly_randtest_monic_irreducible(Irredpoly,
FLINTrandom, 2*d+1);
1059 #elif defined(HAVE_NTL)
1066 BuildIrred (NTLIrredpoly, d*2);
1076 else if ((
p == 3 && d < 4) || ((
p == 5 ||
p == 7) && d < 3))
1078 bool primFail=
false;
1081 ASSERT (!primFail,
"failure in integer factorizer");
1083 nmod_poly_t Irredpoly;
1085 nmod_poly_randtest_monic_irreducible(Irredpoly,
FLINTrandom, 2*d+1);
1088 #elif defined(HAVE_NTL)
1095 BuildIrred (NTLIrredpoly, d*2);
1107 F=
mapUp (F, a, v2, primElem, imPrimElem, source, dest);
1108 G=
mapUp (
G, a, v2, primElem, imPrimElem, source, dest);
1113 lcF =
LC( F,
x ); lcG =
LC(
G,
x );
1114 lcD =
gcd( lcF, lcG );
1134 int goodPointCount= 0;
1139 if( !
findeval( F,
G, Fb, Gb, Db,
b, delta, degF, degG, maxeval,
count, o,
1186 F=
mapDown (F, primElem, imPrimElem, oldA, dest, source);
1194 else if (delta == degG)
1213 G=
mapDown (
G, primElem, imPrimElem, oldA, dest, source);
1233 if( !
findeval(F,
G,Fbt,Gbt,Dbt, bt, delta, degF, degG, maxeval,
count, o,
1272 if (goodPointCount == 5)
1280 Db = Dbt; Fb = Fbt; Gb = Gbt;
1301 F=
mapDown (F, primElem, imPrimElem, oldA, dest, source);
1309 else if (delta == degG)
1328 G=
mapDown (
G, primElem, imPrimElem, oldA, dest, source);
1345 if( delta != degF && delta != degG )
1352 xxx1 =
gcd( DD[1], Db );
1400 DD[2] = DD[2] * (
b( lcDD[2] ) /
lc( DD[2] ) );
1401 DD[1] = DD[1] * (
b( lcDD[1] ) /
lc( DD[1] ) );
1439 gcdfound=
Hensel (
B*lcD, DD,
b, lcDD);
1486 cand = DD[2] / contcand;
1492 "time for termination test EZ_P: ");
1494 if (passToGF && gcdfound)
1502 if (
k > 1 && gcdfound)
1507 if (extOfExt && gcdfound)
CanonicalForm convertnmod_poly_t2FacCF(const nmod_poly_t poly, const Variable &x)
conversion of a FLINT poly over Z/p to CanonicalForm
This file defines functions for conversion to FLINT (www.flintlib.org) and back.
CanonicalForm convertNTLzzpX2CF(const zz_pX &poly, const Variable &x)
Conversion to and from NTL.
CanonicalForm EZGCD_P(const CanonicalForm &FF, const CanonicalForm &GG)
Extended Zassenhaus GCD for finite fields. In case things become too dense we switch to a modular alg...
const CanonicalForm CFMap CFMap & N
static CanonicalForm myShift2Zero(const CanonicalForm &F, CFList &Feval, const CFList &evaluation)
STATIC_VAR int maxNumEval
static CanonicalForm gcd_mon(CanonicalForm F, CanonicalForm G)
static const double log2exp
static Evaluation optimize4Lift(const CanonicalForm &F, CFMap &M, CFMap &N, const Evaluation &A)
static void gcd_mon_rec(CanonicalForm G, CanonicalForm &cf, int *exp, int pl)
static int Hensel(const CanonicalForm &UU, CFArray &G, const Evaluation &AA, const CFArray &LeadCoeffs)
const CanonicalForm CFMap CFMap int & both_non_zero
static CanonicalForm ezgcd(const CanonicalForm &FF, const CanonicalForm &GG, REvaluation &b, bool internal)
real implementation of EZGCD over Z
const CanonicalForm CFMap & M
STATIC_VAR int sizePerVars1
static CanonicalForm myReverseShift(const CanonicalForm &F, const CFList &evaluation)
static bool findeval(const CanonicalForm &F, const CanonicalForm &G, CanonicalForm &Fb, CanonicalForm &Gb, CanonicalForm &Db, REvaluation &b, int delta, int degF, int degG, int maxeval, int &count, int &k, int bound, int &l)
Extended Zassenhaus GCD over finite fields and Z.
bool gcd_test_one(const CanonicalForm &f, const CanonicalForm &g, bool swap, int &d)
Coprimality Check. f and g are assumed to have the same level. If swap is true, the main variables of...
CanonicalForm modGCDFq(const CanonicalForm &F, const CanonicalForm &G, CanonicalForm &coF, CanonicalForm &coG, Variable &alpha, CFList &l, bool &topLevel)
GCD of F and G over , l and topLevel are only used internally, output is monic based on Alg....
const CanonicalForm const CanonicalForm const CanonicalForm const CanonicalForm & cand
CanonicalForm modGCDFp(const CanonicalForm &F, const CanonicalForm &G, CanonicalForm &coF, CanonicalForm &coG, bool &topLevel, CFList &l)
CanonicalForm sparseGCDFp(const CanonicalForm &F, const CanonicalForm &G, bool &topLevel, CFList &l)
CanonicalForm modGCDGF(const CanonicalForm &F, const CanonicalForm &G, CanonicalForm &coF, CanonicalForm &coG, CFList &l, bool &topLevel)
GCD of F and G over GF, based on Alg. 7.2. as described in "Algorithms for Computer Algebra" by Gedde...
modular and sparse modular GCD algorithms over finite fields and Z.
CanonicalForm bCommonDen(const CanonicalForm &f)
CanonicalForm bCommonDen ( const CanonicalForm & f )
bool fdivides(const CanonicalForm &f, const CanonicalForm &g)
bool fdivides ( const CanonicalForm & f, const CanonicalForm & g )
declarations of higher level algorithms.
#define ASSERT(expression, message)
static const int SW_USE_EZGCD_P
set to 1 to use EZGCD over F_q
static const int SW_RATIONAL
set to 1 for computations over Q
static const int SW_USE_EZGCD
set to 1 to use EZGCD over Z
#define GaloisFieldDomain
Iterators for CanonicalForm's.
static CanonicalForm bound(const CFMatrix &M)
CanonicalForm mapPrimElem(const CanonicalForm &primElem, const Variable &alpha, const Variable &beta)
compute the image of a primitive element of in . We assume .
CanonicalForm GFMapDown(const CanonicalForm &F, int k)
maps a polynomial over to a polynomial over , d needs to be a multiple of k
CanonicalForm primitiveElement(const Variable &alpha, Variable &beta, bool &fail)
determine a primitive element of , is a primitive element of a field which is isomorphic to
static CanonicalForm mapDown(const CanonicalForm &F, const Variable &alpha, const CanonicalForm &G, CFList &source, CFList &dest)
the CanonicalForm G is the output of map_up, returns F considered as an element over ,...
static CanonicalForm mapUp(const Variable &alpha, const Variable &beta)
and is a primitive element, returns the image of
CanonicalForm GFMapUp(const CanonicalForm &F, int k)
maps a polynomial over to a polynomial over , d needs to be a multiple of k
CanonicalForm GF2FalphaRep(const CanonicalForm &F, const Variable &alpha)
changes representation by primitive element to representation by residue classes modulo a Conway poly...
This file implements functions to map between extensions of finite fields.
int cf_getBigPrime(int i)
GLOBAL_VAR flint_rand_t FLINTrandom
generate random integers, random elements of finite fields
generate random evaluation points
VAR void(* factoryError)(const char *s)
int ipower(int b, int m)
int ipower ( int b, int m )
generate random elements in F_p(alpha)
class to iterate through CanonicalForm's
class to evaluate a polynomial at points
generate random elements in F_p
generate random elements in GF
class to generate random evaluation points
factory's class for variables
functions to print debug output
#define DEBINCLEVEL(stream, msg)
#define DEBOUTLN(stream, objects)
#define DEBDECLEVEL(stream, msg)
const CanonicalForm int const CFList & evaluation
nmod_poly_init(FLINTmipo, getCharacteristic())
CFList nonMonicHenselLift2(const CFList &F, const CFList &factors, const CFList &MOD, CFList &diophant, CFArray &Pi, CFMatrix &M, int lOld, int &lNew, const CFList &LCs1, const CFList &LCs2, bool &bad)
void nonMonicHenselLift12(const CanonicalForm &F, CFList &factors, int l, CFArray &Pi, CFList &diophant, CFMatrix &M, const CFArray &LCs, bool sort)
Hensel lifting from univariate to bivariate, factors need not to be monic.
nmod_poly_clear(FLINTmipo)
This file defines functions for Hensel lifting.
bool isZero(const CFArray &A)
checks if entries of A are zero
some useful template functions.
template CanonicalForm tmax(const CanonicalForm &, const CanonicalForm &)
template CanonicalForm tmin(const CanonicalForm &, const CanonicalForm &)
INST_VAR CanonicalForm gf_mipo
gmp_float exp(const gmp_float &a)
int status int void size_t count
int status int void * buf
#define TIMING_DEFINE_PRINT(t)
#define TIMING_END_AND_PRINT(t, msg)
void prune1(const Variable &alpha)
void prune(Variable &alpha)
CanonicalForm getMipo(const Variable &alpha, const Variable &x)
Variable rootOf(const CanonicalForm &mipo, char name)
returns a symbolic root of polynomial with name name Use it to define algebraic variables