/*
Copyright (C) 2017 Daniel Schultz
This file is part of FLINT.
FLINT is free software: you can redistribute it and/or modify it under
the terms of the GNU Lesser General Public License (LGPL) as published
by the Free Software Foundation; either version 2.1 of the License, or
(at your option) any later version. See .
*/
#include
#include
#include "nmod_mpoly.h"
int
main(void)
{
int i, j;
FLINT_TEST_INIT(state);
flint_printf("degree....");
fflush(stdout);
/* Check degree does not go up under addition */
for (i = 0; i < 40 * flint_test_multiplier(); i++)
{
nmod_mpoly_ctx_t ctx;
nmod_mpoly_t f, g, h;
fmpz_t fdeg, gdeg, hdeg;
slong len1, len2;
flint_bitcnt_t exp_bits1, exp_bits2;
mp_limb_t modulus;
modulus = n_randbits(state, n_randint(state, FLINT_BITS));
modulus = FLINT_MAX(UWORD(2), modulus);
nmod_mpoly_ctx_init_rand(ctx, state, 20, modulus);
nmod_mpoly_init(f, ctx);
nmod_mpoly_init(g, ctx);
nmod_mpoly_init(h, ctx);
fmpz_init(fdeg);
fmpz_init(gdeg);
fmpz_init(hdeg);
len1 = n_randint(state, 100);
len2 = n_randint(state, 100);
exp_bits1 = n_randint(state, 100) + 2;
exp_bits2 = n_randint(state, 100) + 2;
for (j = 0; j < ctx->minfo->nvars; j++)
{
nmod_mpoly_randtest_bits(f, state, len1, exp_bits1, ctx);
nmod_mpoly_randtest_bits(g, state, len2, exp_bits2, ctx);
nmod_mpoly_add(h, f, g, ctx);
nmod_mpoly_degree_fmpz(hdeg, h, j, ctx);
nmod_mpoly_degree_fmpz(fdeg, f, j, ctx);
nmod_mpoly_degree_fmpz(gdeg, g, j, ctx);
if ((fmpz_cmp(hdeg, fdeg) > 0) && (fmpz_cmp(hdeg, gdeg) > 0))
{
printf("FAIL\n");
flint_printf("Check degree does not go up under addition\ni: %wd j: %wd\n", i, j);
flint_abort();
}
}
fmpz_clear(fdeg);
fmpz_clear(gdeg);
fmpz_clear(hdeg);
nmod_mpoly_clear(f, ctx);
nmod_mpoly_clear(g, ctx);
nmod_mpoly_clear(h, ctx);
nmod_mpoly_ctx_clear(ctx);
}
/* Check degree adds under multiplication */
for (i = 0; i < 40 * flint_test_multiplier(); i++)
{
int ok;
nmod_mpoly_ctx_t ctx;
nmod_mpoly_t f, g, h;
fmpz_t fdeg, gdeg, hdeg;
slong len1, len2;
flint_bitcnt_t exp_bits1, exp_bits2;
mp_limb_t modulus;
modulus = n_randbits(state, n_randint(state, FLINT_BITS));
modulus = FLINT_MAX(UWORD(2), modulus);
nmod_mpoly_ctx_init_rand(ctx, state, 20, modulus);
nmod_mpoly_init(f, ctx);
nmod_mpoly_init(g, ctx);
nmod_mpoly_init(h, ctx);
fmpz_init(fdeg);
fmpz_init(gdeg);
fmpz_init(hdeg);
len1 = n_randint(state, 10);
len2 = n_randint(state, 10);
exp_bits1 = n_randint(state, 100) + 2;
exp_bits2 = n_randint(state, 100) + 2;
for (j = 0; j < ctx->minfo->nvars; j++)
{
nmod_mpoly_randtest_bits(f, state, len1, exp_bits1, ctx);
nmod_mpoly_randtest_bits(g, state, len2, exp_bits2, ctx);
nmod_mpoly_mul_johnson(h, f, g, ctx);
nmod_mpoly_degree_fmpz(hdeg, h, j, ctx);
nmod_mpoly_degree_fmpz(fdeg, f, j, ctx);
nmod_mpoly_degree_fmpz(gdeg, g, j, ctx);
if (nmod_mpoly_is_zero(f, ctx) || nmod_mpoly_is_zero(g, ctx))
{
ok = fmpz_equal_si(hdeg, -WORD(1))
&& (fmpz_equal_si(fdeg, -WORD(1))
|| fmpz_equal_si(gdeg, -WORD(1)));
}
else
{
fmpz_add(gdeg, gdeg, fdeg);
if (n_is_prime(nmod_mpoly_ctx_modulus(ctx)))
{
ok = fmpz_equal(hdeg, gdeg);
}
else
{
ok = fmpz_cmp(hdeg, gdeg) <= 0;
}
}
if (!ok)
{
printf("FAIL\n");
flint_printf("Check degree adds under multiplication\ni: %wd j: %wd\n", i, j);
flint_abort();
}
}
fmpz_clear(fdeg);
fmpz_clear(gdeg);
fmpz_clear(hdeg);
nmod_mpoly_clear(f, ctx);
nmod_mpoly_clear(g, ctx);
nmod_mpoly_clear(h, ctx);
nmod_mpoly_ctx_clear(ctx);
}
FLINT_TEST_CLEANUP(state);
printf("PASS\n");
return 0;
}