int
main(void)
{
int i, result;
flint_rand_t state;
_randinit(state);
{
const char *str =
"3 [5 0 0] [0 5 0] [0 0 5] (2 0 1)[1 1 3]";
const long n = atoi(str) - 1;
mpoly_t P;
ctx_t ctxFracQt;
qadic_ctx_t Qq;
fmpz_t p = {3L};
long d = 40;
qadic_t t1;
prec_t prec, prec_in;
/*
prec_in.N0 = 9;
prec_in.N1 = 9;
prec_in.N2 = 9;
prec_in.N3 = 13;
prec_in.N3i = 14;
prec_in.N3w = 23;
prec_in.N3iw = 22;
prec_in.N4 = 18;
prec_in.m = 29;
prec_in.K = 178;
prec_in.r = 0;
prec_in.s = 0;
*/
ctx_init_fmpz_poly_q(ctxFracQt);
qadic_ctx_init_conway(Qq, p, d, 1, 1, "X", PADIC_SERIES);
qadic_init2(t1, 1);
qadic_gen(t1, Qq);
mpoly_init(P, n + 1, ctxFracQt);
mpoly_set_str(P, str, ctxFracQt);
frob(P, ctxFracQt, t1, Qq, &prec, NULL, 1);
qadic_clear(t1);
mpoly_clear(P, ctxFracQt);
ctx_clear(ctxFracQt);
qadic_ctx_clear(Qq);
}
_randclear(state);
_fmpz_cleanup();
return EXIT_SUCCESS;
}
int
main(void)
{
int i, result;
flint_rand_t state;
_randinit(state);
/*
A generic sextic curve.
*/
{
const char *str =
"3 [6 0 0] [0 6 0] [0 0 6] "
"(2 0 -1)[5 1 0] (2 0 7)[5 0 1] (2 0 2)[1 5 0] (2 0 1)[0 5 1] (2 0 2)[1 0 5] (2 0 1)[0 1 5] "
"(2 0 2)[4 2 0] (2 0 2)[4 0 2] (2 0 3)[2 4 0] (2 0 1)[0 4 2] (2 0 3)[2 0 4] (2 0 1)[0 2 4] "
"(2 0 3)[4 1 1] (2 0 3)[1 4 1] (2 0 1)[1 1 4] "
"(2 0 -1)[3 3 0] (2 0 -2)[3 0 3] (2 0 4)[0 3 3] "
"(2 0 2)[3 2 1] (2 0 1)[3 1 2] (2 0 -1)[2 3 1] (2 0 1)[1 3 2] (2 0 2)[2 1 3] (2 0 1)[1 2 3] "
"(2 0 1)[2 2 2]";
const long n = atoi(str) - 1;
mpoly_t P;
ctx_t ctxFracQt;
qadic_ctx_t Qq;
fmpz_t p = {5L};
long d = 1;
qadic_t t1;
prec_t prec, prec_in;
ctx_init_fmpz_poly_q(ctxFracQt);
qadic_ctx_init_conway(Qq, p, d, 1, 1, "X", PADIC_SERIES);
qadic_init2(t1, 1);
qadic_set_ui(t1, 2, Qq);
mpoly_init(P, n + 1, ctxFracQt);
mpoly_set_str(P, str, ctxFracQt);
frob(P, ctxFracQt, t1, Qq, &prec, NULL, 1);
qadic_clear(t1);
mpoly_clear(P, ctxFracQt);
ctx_clear(ctxFracQt);
qadic_ctx_clear(Qq);
}
_randclear(state);
_fmpz_cleanup();
return EXIT_SUCCESS;
}
int
main(void)
{
int i, result;
flint_rand_t state;
_randinit(state);
/*
A quartic surface from Example 4.2.1 in [AKR].
TODO: This currently still fails!
*/
{
const char *str =
"4 (2 2 -1)[4 0 0 0] [0 4 0 0] [0 0 4 0] [0 0 0 4] "
"(2 0 -1)[0 1 3 0] (2 0 1)[1 1 2 0] (2 0 1)[1 1 1 1] "
"(2 0 1)[2 1 1 0] (2 0 -1)[2 1 0 1] (2 0 1)[1 0 3 0] (2 0 -1)[1 0 2 1]";
const long n = atoi(str) - 1;
mpoly_t P;
ctx_t ctxFracQt;
qadic_ctx_t Qq;
fmpz_t p = {3L};
long d = 2;
qadic_t t1;
prec_t prec, prec_in;
ctx_init_fmpz_poly_q(ctxFracQt);
qadic_ctx_init_conway(Qq, p, d, 1, 1, "X", PADIC_SERIES);
qadic_init2(t1, 1);
qadic_gen(t1, Qq);
mpoly_init(P, n + 1, ctxFracQt);
mpoly_set_str(P, str, ctxFracQt);
frob(P, ctxFracQt, t1, Qq, &prec, NULL, 1);
qadic_clear(t1);
mpoly_clear(P, ctxFracQt);
ctx_clear(ctxFracQt);
qadic_ctx_clear(Qq);
}
_randclear(state);
_fmpz_cleanup();
return EXIT_SUCCESS;
}
int
main(void)
{
int i, result;
flint_rand_t state;
_randinit(state);
{
const char *str =
"4 [5 0 0 0] [0 5 0 0] [0 0 5 0] [0 0 0 5] (2 0 1)[2 1 1 1]";
const long n = atoi(str) - 1;
mpoly_t P;
ctx_t ctxFracQt;
qadic_ctx_t Qq;
fmpz_t p = {2L};
long d = 10;
qadic_t t1;
prec_t prec, prec_in;
ctx_init_fmpz_poly_q(ctxFracQt);
qadic_ctx_init_conway(Qq, p, d, 1, 1, "X", PADIC_SERIES);
qadic_init2(t1, 1);
qadic_gen(t1, Qq);
mpoly_init(P, n + 1, ctxFracQt);
mpoly_set_str(P, str, ctxFracQt);
frob(P, ctxFracQt, t1, Qq, &prec, NULL, 1);
qadic_clear(t1);
mpoly_clear(P, ctxFracQt);
ctx_clear(ctxFracQt);
qadic_ctx_clear(Qq);
}
_randclear(state);
_fmpz_cleanup();
return EXIT_SUCCESS;
}
void frob(const mpoly_t P, const ctx_t ctxFracQt,
const qadic_t t1, const qadic_ctx_t Qq,
prec_t *prec, const prec_t *prec_in,
int verbose)
{
const padic_ctx_struct *Qp = &Qq->pctx;
const fmpz *p = Qp->p;
const long a = qadic_ctx_degree(Qq);
const long n = P->n - 1;
const long d = mpoly_degree(P, -1, ctxFracQt);
const long b = gmc_basis_size(n, d);
long i, j, k;
/* Diagonal fibre */
padic_mat_t F0;
/* Gauss--Manin Connection */
mat_t M;
mon_t *bR, *bC;
fmpz_poly_t r;
/* Local solution */
fmpz_poly_mat_t C, Cinv;
long vC, vCinv;
/* Frobenius */
fmpz_poly_mat_t F;
long vF;
fmpz_poly_mat_t F1;
long vF1;
fmpz_poly_t cp;
clock_t c0, c1;
double c;
if (verbose)
{
printf("Input:\n");
printf(" P = "), mpoly_print(P, ctxFracQt), printf("\n");
printf(" p = "), fmpz_print(p), printf("\n");
printf(" t1 = "), qadic_print_pretty(t1, Qq), printf("\n");
printf("\n");
fflush(stdout);
}
/* Step 1 {M, r} *********************************************************/
c0 = clock();
mat_init(M, b, b, ctxFracQt);
fmpz_poly_init(r);
gmc_compute(M, &bR, &bC, P, ctxFracQt);
{
fmpz_poly_t t;
fmpz_poly_init(t);
fmpz_poly_set_ui(r, 1);
for (i = 0; i < M->m; i++)
for (j = 0; j < M->n; j++)
{
fmpz_poly_lcm(t, r, fmpz_poly_q_denref(
(fmpz_poly_q_struct *) mat_entry(M, i, j, ctxFracQt)));
fmpz_poly_swap(r, t);
}
fmpz_poly_clear(t);
}
c1 = clock();
c = (double) (c1 - c0) / CLOCKS_PER_SEC;
if (verbose)
{
printf("Gauss-Manin connection:\n");
printf(" r(t) = "), fmpz_poly_print_pretty(r, "t"), printf("\n");
printf(" Time = %f\n", c);
printf("\n");
fflush(stdout);
}
{
qadic_t t;
qadic_init2(t, 1);
fmpz_poly_evaluate_qadic(t, r, t1, Qq);
if (qadic_is_zero(t))
{
printf("Exception (deformation_frob).\n");
printf("The resultant r evaluates to zero (mod p) at t1.\n");
abort();
}
qadic_clear(t);
}
/* Precisions ************************************************************/
if (prec_in != NULL)
{
*prec = *prec_in;
}
else
{
deformation_precisions(prec, p, a, n, d, fmpz_poly_degree(r));
}
if (verbose)
{
printf("Precisions:\n");
printf(" N0 = %ld\n", prec->N0);
printf(" N1 = %ld\n", prec->N1);
printf(" N2 = %ld\n", prec->N2);
printf(" N3 = %ld\n", prec->N3);
printf(" N3i = %ld\n", prec->N3i);
printf(" N3w = %ld\n", prec->N3w);
printf(" N3iw = %ld\n", prec->N3iw);
printf(" N4 = %ld\n", prec->N4);
printf(" m = %ld\n", prec->m);
printf(" K = %ld\n", prec->K);
printf(" r = %ld\n", prec->r);
printf(" s = %ld\n", prec->s);
printf("\n");
fflush(stdout);
}
/* Initialisation ********************************************************/
padic_mat_init2(F0, b, b, prec->N4);
fmpz_poly_mat_init(C, b, b);
fmpz_poly_mat_init(Cinv, b, b);
fmpz_poly_mat_init(F, b, b);
vF = 0;
fmpz_poly_mat_init(F1, b, b);
vF1 = 0;
fmpz_poly_init(cp);
/* Step 2 {F0} ***********************************************************/
{
padic_ctx_t pctx_F0;
fmpz *t;
padic_ctx_init(pctx_F0, p, FLINT_MIN(prec->N4 - 10, 0), prec->N4, PADIC_VAL_UNIT);
t = _fmpz_vec_init(n + 1);
c0 = clock();
mpoly_diagonal_fibre(t, P, ctxFracQt);
diagfrob(F0, t, n, d, prec->N4, pctx_F0, 0);
padic_mat_transpose(F0, F0);
c1 = clock();
c = (double) (c1 - c0) / CLOCKS_PER_SEC;
if (verbose)
{
printf("Diagonal fibre:\n");
printf(" P(0) = {"), _fmpz_vec_print(t, n + 1), printf("}\n");
printf(" Time = %f\n", c);
printf("\n");
fflush(stdout);
}
_fmpz_vec_clear(t, n + 1);
padic_ctx_clear(pctx_F0);
}
/* Step 3 {C, Cinv} ******************************************************/
/*
Compute C as a matrix over Z_p[[t]]. A is the same but as a series
of matrices over Z_p. Mt is the matrix -M^t, and Cinv is C^{-1}^t,
the local solution of the differential equation replacing M by Mt.
*/
c0 = clock();
{
const long K = prec->K;
padic_mat_struct *A;
gmde_solve(&A, K, p, prec->N3, prec->N3w, M, ctxFracQt);
gmde_convert_soln(C, &vC, A, K, p);
for(i = 0; i < K; i++)
padic_mat_clear(A + i);
free(A);
}
c1 = clock();
c = (double) (c1 - c0) / CLOCKS_PER_SEC;
if (verbose)
{
printf("Local solution:\n");
printf(" Time for C = %f\n", c);
fflush(stdout);
}
c0 = clock();
{
const long K = (prec->K + (*p) - 1) / (*p);
mat_t Mt;
padic_mat_struct *Ainv;
mat_init(Mt, b, b, ctxFracQt);
mat_transpose(Mt, M, ctxFracQt);
mat_neg(Mt, Mt, ctxFracQt);
gmde_solve(&Ainv, K, p, prec->N3i, prec->N3iw, Mt, ctxFracQt);
gmde_convert_soln(Cinv, &vCinv, Ainv, K, p);
fmpz_poly_mat_transpose(Cinv, Cinv);
fmpz_poly_mat_compose_pow(Cinv, Cinv, *p);
for(i = 0; i < K; i++)
padic_mat_clear(Ainv + i);
free(Ainv);
mat_clear(Mt, ctxFracQt);
}
c1 = clock();
c = (double) (c1 - c0) / CLOCKS_PER_SEC;
if (verbose)
{
printf(" Time for C^{-1} = %f\n", c);
printf("\n");
fflush(stdout);
}
/* Step 4 {F(t) := C(t) F(0) C(t^p)^{-1}} ********************************/
/*
Computes the product C(t) F(0) C(t^p)^{-1} modulo (p^{N_2}, t^K).
This is done by first computing the unit part of the product
exactly over the integers modulo t^K.
*/
c0 = clock();
{
fmpz_t pN;
fmpz_poly_mat_t T;
fmpz_init(pN);
fmpz_poly_mat_init(T, b, b);
for (i = 0; i < b; i++)
{
/* Find the unique k s.t. F0(i,k) is non-zero */
for (k = 0; k < b; k++)
if (!fmpz_is_zero(padic_mat_entry(F0, i, k)))
break;
if (k == b)
{
printf("Exception (frob). F0 is singular.\n\n");
abort();
}
for (j = 0; j < b; j++)
{
fmpz_poly_scalar_mul_fmpz(fmpz_poly_mat_entry(T, i, j),
fmpz_poly_mat_entry(Cinv, k, j),
padic_mat_entry(F0, i, k));
}
}
fmpz_poly_mat_mul(F, C, T);
fmpz_poly_mat_truncate(F, prec->K);
vF = vC + padic_mat_val(F0) + vCinv;
/* Canonicalise (F, vF) */
{
long v = fmpz_poly_mat_ord_p(F, p);
if (v == LONG_MAX)
{
printf("ERROR (deformation_frob). F(t) == 0.\n");
abort();
}
else if (v > 0)
{
fmpz_pow_ui(pN, p, v);
fmpz_poly_mat_scalar_divexact_fmpz(F, F, pN);
vF = vF + v;
}
}
/* Reduce (F, vF) modulo p^{N2} */
fmpz_pow_ui(pN, p, prec->N2 - vF);
fmpz_poly_mat_scalar_mod_fmpz(F, F, pN);
fmpz_clear(pN);
fmpz_poly_mat_clear(T);
}
c1 = clock();
c = (double) (c1 - c0) / CLOCKS_PER_SEC;
if (verbose)
{
printf("Matrix for F(t):\n");
printf(" Time = %f\n", c);
printf("\n");
fflush(stdout);
}
/* Step 5 {G = r(t)^m F(t)} **********************************************/
c0 = clock();
{
fmpz_t pN;
fmpz_poly_t t;
fmpz_init(pN);
fmpz_poly_init(t);
fmpz_pow_ui(pN, p, prec->N2 - vF);
/* Compute r(t)^m mod p^{N2-vF} */
if (prec->denR == NULL)
{
fmpz_mod_poly_t _t;
fmpz_mod_poly_init(_t, pN);
fmpz_mod_poly_set_fmpz_poly(_t, r);
fmpz_mod_poly_pow(_t, _t, prec->m);
fmpz_mod_poly_get_fmpz_poly(t, _t);
fmpz_mod_poly_clear(_t);
}
else
{
/* TODO: We don't really need a copy */
fmpz_poly_set(t, prec->denR);
}
fmpz_poly_mat_scalar_mul_fmpz_poly(F, F, t);
fmpz_poly_mat_scalar_mod_fmpz(F, F, pN);
/* TODO: This should not be necessary? */
fmpz_poly_mat_truncate(F, prec->K);
fmpz_clear(pN);
fmpz_poly_clear(t);
}
c1 = clock();
c = (double) (c1 - c0) / CLOCKS_PER_SEC;
if (verbose)
{
printf("Analytic continuation:\n");
printf(" Time = %f\n", c);
printf("\n");
fflush(stdout);
}
/* Steps 6 and 7 *********************************************************/
if (a == 1)
{
/* Step 6 {F(1) = r(t_1)^{-m} G(t_1)} ********************************/
c0 = clock();
{
const long N = prec->N2 - vF;
fmpz_t f, g, t, pN;
fmpz_init(f);
fmpz_init(g);
fmpz_init(t);
fmpz_init(pN);
fmpz_pow_ui(pN, p, N);
/* f := \hat{t_1}, g := r(\hat{t_1})^{-m} */
_padic_teichmuller(f, t1->coeffs + 0, p, N);
if (prec->denR == NULL)
{
_fmpz_mod_poly_evaluate_fmpz(g, r->coeffs, r->length, f, pN);
fmpz_powm_ui(t, g, prec->m, pN);
}
else
{
_fmpz_mod_poly_evaluate_fmpz(t, prec->denR->coeffs, prec->denR->length, f, pN);
}
_padic_inv(g, t, p, N);
/* F1 := g G(\hat{t_1}) */
for (i = 0; i < b; i++)
for (j = 0; j < b; j++)
{
const fmpz_poly_struct *poly = fmpz_poly_mat_entry(F, i, j);
const long len = poly->length;
if (len == 0)
{
fmpz_poly_zero(fmpz_poly_mat_entry(F1, i, j));
}
else
{
fmpz_poly_fit_length(fmpz_poly_mat_entry(F1, i, j), 1);
_fmpz_mod_poly_evaluate_fmpz(t, poly->coeffs, len, f, pN);
fmpz_mul(fmpz_poly_mat_entry(F1, i, j)->coeffs + 0, g, t);
fmpz_mod(fmpz_poly_mat_entry(F1, i, j)->coeffs + 0,
fmpz_poly_mat_entry(F1, i, j)->coeffs + 0, pN);
_fmpz_poly_set_length(fmpz_poly_mat_entry(F1, i, j), 1);
_fmpz_poly_normalise(fmpz_poly_mat_entry(F1, i, j));
}
}
vF1 = vF;
fmpz_poly_mat_canonicalise(F1, &vF1, p);
fmpz_clear(f);
fmpz_clear(g);
fmpz_clear(t);
fmpz_clear(pN);
}
c1 = clock();
c = (double) (c1 - c0) / CLOCKS_PER_SEC;
if (verbose)
{
printf("Evaluation:\n");
printf(" Time = %f\n", c);
printf("\n");
fflush(stdout);
}
}
else
{
/* Step 6 {F(1) = r(t_1)^{-m} G(t_1)} ********************************/
c0 = clock();
{
const long N = prec->N2 - vF;
fmpz_t pN;
fmpz *f, *g, *t;
fmpz_init(pN);
f = _fmpz_vec_init(a);
g = _fmpz_vec_init(2 * a - 1);
t = _fmpz_vec_init(2 * a - 1);
fmpz_pow_ui(pN, p, N);
/* f := \hat{t_1}, g := r(\hat{t_1})^{-m} */
_qadic_teichmuller(f, t1->coeffs, t1->length, Qq->a, Qq->j, Qq->len, p, N);
if (prec->denR == NULL)
{
fmpz_t e;
fmpz_init_set_ui(e, prec->m);
_fmpz_mod_poly_compose_smod(g, r->coeffs, r->length, f, a,
Qq->a, Qq->j, Qq->len, pN);
_qadic_pow(t, g, a, e, Qq->a, Qq->j, Qq->len, pN);
fmpz_clear(e);
}
else
{
_fmpz_mod_poly_reduce(prec->denR->coeffs, prec->denR->length, Qq->a, Qq->j, Qq->len, pN);
_fmpz_poly_normalise(prec->denR);
_fmpz_mod_poly_compose_smod(t, prec->denR->coeffs, prec->denR->length, f, a,
Qq->a, Qq->j, Qq->len, pN);
}
_qadic_inv(g, t, a, Qq->a, Qq->j, Qq->len, p, N);
/* F1 := g G(\hat{t_1}) */
for (i = 0; i < b; i++)
for (j = 0; j < b; j++)
{
const fmpz_poly_struct *poly = fmpz_poly_mat_entry(F, i, j);
const long len = poly->length;
fmpz_poly_struct *poly2 = fmpz_poly_mat_entry(F1, i, j);
if (len == 0)
{
fmpz_poly_zero(poly2);
}
else
{
_fmpz_mod_poly_compose_smod(t, poly->coeffs, len, f, a,
Qq->a, Qq->j, Qq->len, pN);
fmpz_poly_fit_length(poly2, 2 * a - 1);
_fmpz_poly_mul(poly2->coeffs, g, a, t, a);
_fmpz_mod_poly_reduce(poly2->coeffs, 2 * a - 1, Qq->a, Qq->j, Qq->len, pN);
_fmpz_poly_set_length(poly2, a);
_fmpz_poly_normalise(poly2);
}
}
/* Now the matrix for p^{-1} F_p at t=t_1 is (F1, vF1). */
vF1 = vF;
fmpz_poly_mat_canonicalise(F1, &vF1, p);
fmpz_clear(pN);
_fmpz_vec_clear(f, a);
_fmpz_vec_clear(g, 2 * a - 1);
_fmpz_vec_clear(t, 2 * a - 1);
}
c1 = clock();
c = (double) (c1 - c0) / CLOCKS_PER_SEC;
if (verbose)
{
printf("Evaluation:\n");
printf(" Time = %f\n", c);
printf("\n");
fflush(stdout);
}
/* Step 7 {Norm} *****************************************************/
/*
Computes the matrix for $q^{-1} F_q$ at $t = t_1$ as the
product $F \sigma(F) \dotsm \sigma^{a-1}(F)$ up appropriate
transpositions because our convention of columns vs rows is
the opposite of that used by Gerkmann.
Note that, in any case, transpositions do not affect
the characteristic polynomial.
*/
c0 = clock();
{
const long N = prec->N1 - a * vF1;
fmpz_t pN;
fmpz_poly_mat_t T;
fmpz_init(pN);
fmpz_poly_mat_init(T, b, b);
fmpz_pow_ui(pN, p, N);
fmpz_poly_mat_frobenius(T, F1, 1, p, N, Qq);
_qadic_mat_mul(F1, F1, T, pN, Qq);
for (i = 2; i < a; i++)
{
fmpz_poly_mat_frobenius(T, T, 1, p, N, Qq);
_qadic_mat_mul(F1, F1, T, pN, Qq);
}
vF1 = a * vF1;
fmpz_poly_mat_canonicalise(F1, &vF1, p);
fmpz_clear(pN);
fmpz_poly_mat_clear(T);
}
c1 = clock();
c = (double) (c1 - c0) / CLOCKS_PER_SEC;
if (verbose)
{
printf("Norm:\n");
printf(" Time = %f\n", c);
printf("\n");
fflush(stdout);
}
}
/* Step 8 {Reverse characteristic polynomial} ****************************/
c0 = clock();
deformation_revcharpoly(cp, F1, vF1, n, d, prec->N0, prec->r, prec->s, Qq);
c1 = clock();
c = (double) (c1 - c0) / CLOCKS_PER_SEC;
if (verbose)
{
printf("Reverse characteristic polynomial:\n");
printf(" p(T) = "), fmpz_poly_print_pretty(cp, "T"), printf("\n");
printf(" Time = %f\n", c);
printf("\n");
fflush(stdout);
}
/* Clean up **************************************************************/
padic_mat_clear(F0);
mat_clear(M, ctxFracQt);
free(bR);
free(bC);
fmpz_poly_clear(r);
fmpz_poly_mat_clear(C);
fmpz_poly_mat_clear(Cinv);
fmpz_poly_mat_clear(F);
fmpz_poly_mat_clear(F1);
fmpz_poly_clear(cp);
}
int
main(void)
{
int i, result;
FLINT_TEST_INIT(state);
flint_printf("mul... ");
fflush(stdout);
/* Check aliasing: a = a * b */
for (i = 0; i < 2000; i++)
{
fmpz_t p;
slong d, N;
qadic_ctx_t ctx;
qadic_t a, b, c;
fmpz_init_set_ui(p, n_randprime(state, 2 + n_randint(state, 3), 1));
d = n_randint(state, 10) + 1;
N = z_randint(state, 50) + 1;
qadic_ctx_init_conway(ctx, p, d, FLINT_MAX(0,N-10), FLINT_MAX(0,N+10), "a", PADIC_SERIES);
qadic_init2(a, N);
qadic_init2(b, N);
qadic_init2(c, N);
qadic_randtest(a, state, ctx);
qadic_randtest(b, state, ctx);
qadic_mul(c, a, b, ctx);
qadic_mul(a, a, b, ctx);
result = (qadic_equal(a, c));
if (!result)
{
flint_printf("FAIL:\n\n");
flint_printf("a = "), qadic_print_pretty(a, ctx), flint_printf("\n");
flint_printf("b = "), qadic_print_pretty(b, ctx), flint_printf("\n");
flint_printf("c = "), qadic_print_pretty(c, ctx), flint_printf("\n");
abort();
}
qadic_clear(a);
qadic_clear(b);
qadic_clear(c);
fmpz_clear(p);
qadic_ctx_clear(ctx);
}
/* Check aliasing: b = a * b */
for (i = 0; i < 2000; i++)
{
fmpz_t p;
slong d, N;
qadic_ctx_t ctx;
qadic_t a, b, c;
fmpz_init_set_ui(p, n_randprime(state, 2 + n_randint(state, 3), 1));
d = n_randint(state, 10) + 1;
N = z_randint(state, 50) + 1;
qadic_ctx_init_conway(ctx, p, d, FLINT_MAX(0, N-10), FLINT_MAX(0, N+10), "a", PADIC_SERIES);
qadic_init2(a, N);
qadic_init2(b, N);
qadic_init2(c, N);
qadic_randtest(a, state, ctx);
qadic_randtest(b, state, ctx);
qadic_mul(c, a, b, ctx);
qadic_mul(b, a, b, ctx);
result = (qadic_equal(b, c));
if (!result)
{
flint_printf("FAIL:\n\n");
flint_printf("a = "), qadic_print_pretty(a, ctx), flint_printf("\n");
flint_printf("b = "), qadic_print_pretty(b, ctx), flint_printf("\n");
flint_printf("c = "), qadic_print_pretty(c, ctx), flint_printf("\n");
abort();
}
qadic_clear(a);
qadic_clear(b);
qadic_clear(c);
fmpz_clear(p);
qadic_ctx_clear(ctx);
}
/* Check aliasing: a = a + a */
for (i = 0; i < 2000; i++)
{
fmpz_t p;
slong d, N;
qadic_ctx_t ctx;
qadic_t a, c;
fmpz_init_set_ui(p, n_randprime(state, 2 + n_randint(state, 3), 1));
d = n_randint(state, 10) + 1;
N = z_randint(state, 50) + 1;
qadic_ctx_init_conway(ctx, p, d, FLINT_MAX(0,N-10), FLINT_MAX(0,N+10), "a", PADIC_SERIES);
qadic_init2(a, N);
qadic_init2(c, N);
qadic_randtest(a, state, ctx);
qadic_add(c, a, a, ctx);
qadic_add(a, a, a, ctx);
result = (qadic_equal(a, c));
if (!result)
{
flint_printf("FAIL:\n\n");
flint_printf("a = "), qadic_print_pretty(a, ctx), flint_printf("\n");
flint_printf("c = "), qadic_print_pretty(c, ctx), flint_printf("\n");
abort();
}
qadic_clear(a);
qadic_clear(c);
fmpz_clear(p);
qadic_ctx_clear(ctx);
}
/* Check that a * b == b * a */
for (i = 0; i < 2000; i++)
{
fmpz_t p;
slong d, N;
qadic_ctx_t ctx;
qadic_t a, b, c1, c2;
fmpz_init_set_ui(p, n_randprime(state, 2 + n_randint(state, 3), 1));
d = n_randint(state, 10) + 1;
N = z_randint(state, 50) + 1;
qadic_ctx_init_conway(ctx, p, d, FLINT_MAX(0,N-10), FLINT_MAX(0,N+10), "a", PADIC_SERIES);
qadic_init2(a, N);
qadic_init2(b, N);
qadic_init2(c1, N);
qadic_init2(c2, N);
qadic_randtest(a, state, ctx);
qadic_randtest(b, state, ctx);
qadic_mul(c1, a, b, ctx);
qadic_mul(c2, b, a, ctx);
result = (qadic_equal(c1, c2));
if (!result)
{
flint_printf("FAIL:\n\n");
flint_printf("a = "), qadic_print_pretty(a, ctx), flint_printf("\n");
flint_printf("b = "), qadic_print_pretty(b, ctx), flint_printf("\n");
flint_printf("c1 = "), qadic_print_pretty(c1, ctx), flint_printf("\n");
flint_printf("c2 = "), qadic_print_pretty(c2, ctx), flint_printf("\n");
abort();
}
qadic_clear(a);
qadic_clear(b);
qadic_clear(c1);
qadic_clear(c2);
fmpz_clear(p);
qadic_ctx_clear(ctx);
}
/* Check that (a * b) * c == a * (b * c) for integral values */
for (i = 0; i < 2000; i++)
{
fmpz_t p;
slong d, N;
qadic_ctx_t ctx;
qadic_t a, b, c, lhs, rhs;
fmpz_init_set_ui(p, n_randprime(state, 2 + n_randint(state, 3), 1));
d = n_randint(state, 10) + 1;
N = n_randint(state, 50) + 1;
qadic_ctx_init_conway(ctx, p, d, FLINT_MAX(0,N-10), FLINT_MAX(0,N+10), "a", PADIC_SERIES);
qadic_init2(a, N);
qadic_init2(b, N);
qadic_init2(c, N);
qadic_init2(lhs, N);
qadic_init2(rhs, N);
qadic_randtest_int(a, state, ctx);
qadic_randtest_int(b, state, ctx);
qadic_randtest_int(c, state, ctx);
qadic_mul(lhs, a, b, ctx);
qadic_mul(lhs, lhs, c, ctx);
qadic_mul(rhs, b, c, ctx);
qadic_mul(rhs, a, rhs, ctx);
result = (qadic_equal(lhs, rhs));
if (!result)
{
flint_printf("FAIL:\n\n");
flint_printf("a = "), qadic_print_pretty(a, ctx), flint_printf("\n");
flint_printf("b = "), qadic_print_pretty(b, ctx), flint_printf("\n");
flint_printf("c = "), qadic_print_pretty(c, ctx), flint_printf("\n");
flint_printf("lhs = "), qadic_print_pretty(lhs, ctx), flint_printf("\n");
flint_printf("rhs = "), qadic_print_pretty(rhs, ctx), flint_printf("\n");
abort();
}
qadic_clear(a);
qadic_clear(b);
qadic_clear(c);
qadic_clear(lhs);
qadic_clear(rhs);
fmpz_clear(p);
qadic_ctx_clear(ctx);
}
FLINT_TEST_CLEANUP(state);
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int
main(void)
{
int i, result;
FLINT_TEST_INIT(state);
flint_printf("norm... ");
fflush(stdout);
/* Compare with product of Galois conjugates */
for (i = 0; i < 2000; i++)
{
fmpz_t p;
slong d, N;
qadic_ctx_t ctx;
qadic_t a, b, c;
padic_t x, y;
slong j;
int ans;
fmpz_init_set_ui(p, n_randprime(state, 2 + n_randint(state, 3), 1));
d = n_randint(state, 10) + 1;
N = z_randint(state, 50) + 1;
qadic_ctx_init_conway(ctx, p, d, FLINT_MAX(0,N-10), FLINT_MAX(0,N+10), "a", PADIC_SERIES);
qadic_init2(a, N);
qadic_init2(b, N);
qadic_init2(c, N);
padic_init2(x, N);
padic_init2(y, N);
qadic_randtest_val(a, state, 0, ctx);
qadic_reduce(a, ctx);
qadic_norm(x, a, ctx);
qadic_one(b);
for (j = 0; j < d; j++)
{
qadic_frobenius(c, a, j, ctx);
qadic_mul(b, b, c, ctx);
}
ans = qadic_get_padic(y, b, ctx);
result = (ans && padic_equal(x, y));
if (!result)
{
flint_printf("FAIL:\n\n");
flint_printf("a = "), qadic_print_pretty(a, ctx), flint_printf("\n");
flint_printf("b = "), qadic_print_pretty(b, ctx), flint_printf("\n");
flint_printf("x = "), padic_print(x, &ctx->pctx), flint_printf("\n");
flint_printf("y = "), padic_print(y, &ctx->pctx), flint_printf("\n");
for (j = 0; j < d; j++)
{
qadic_frobenius(c, a, j, ctx);
flint_printf("sigma^%wd = ", j), qadic_print_pretty(c, ctx), flint_printf("\n");
}
flint_printf("ans = %d\n", ans);
abort();
}
qadic_clear(a);
qadic_clear(b);
qadic_clear(c);
padic_clear(x);
padic_clear(y);
fmpz_clear(p);
qadic_ctx_clear(ctx);
}
FLINT_TEST_CLEANUP(state);
flint_printf("PASS\n");
return EXIT_SUCCESS;
}