/* Copyright (C) 2021 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 "fmpz_mpoly_factor.h" int compute_gcd( fmpz_mpoly_t G, const fmpz_mpoly_t A, const fmpz_mpoly_t B, const fmpz_mpoly_ctx_t ctx) { int success; slong * perm; ulong * shift, * stride; slong i; flint_bitcnt_t wbits; fmpz_mpoly_ctx_t lctx; fmpz_mpoly_t Al, Bl, Gl, Abarl, Bbarl; if (fmpz_mpoly_is_zero(A, ctx)) { if (fmpz_mpoly_is_zero(B, ctx)) { fmpz_mpoly_zero(G, ctx); return 1; } if (fmpz_sgn(B->coeffs + 0) < 0) { fmpz_mpoly_neg(G, B, ctx); return 1; } else { fmpz_mpoly_set(G, B, ctx); return 1; } } if (fmpz_mpoly_is_zero(B, ctx)) { if (fmpz_sgn(A->coeffs + 0) < 0) { fmpz_mpoly_neg(G, A, ctx); return 1; } else { fmpz_mpoly_set(G, A, ctx); return 1; } } if (A->bits > FLINT_BITS || B->bits > FLINT_BITS) { return 0; } perm = (slong *) flint_malloc(ctx->minfo->nvars*sizeof(slong)); shift = (ulong *) flint_malloc(ctx->minfo->nvars*sizeof(ulong)); stride = (ulong *) flint_malloc(ctx->minfo->nvars*sizeof(ulong)); for (i = 0; i < ctx->minfo->nvars; i++) { perm[i] = i; shift[i] = 0; stride[i] = 1; } if (ctx->minfo->nvars == 1) { fmpz_poly_t a, b, g; fmpz_poly_init(a); fmpz_poly_init(b); fmpz_poly_init(g); _fmpz_mpoly_to_fmpz_poly_deflate(a, A, 0, shift, stride, ctx); _fmpz_mpoly_to_fmpz_poly_deflate(b, B, 0, shift, stride, ctx); fmpz_poly_gcd(g, a, b); _fmpz_mpoly_from_fmpz_poly_inflate(G, A->bits, g, 0, shift, stride, ctx); fmpz_poly_clear(a); fmpz_poly_clear(b); fmpz_poly_clear(g); success = 1; goto cleanup1; } wbits = FLINT_MAX(A->bits, B->bits); fmpz_mpoly_ctx_init(lctx, ctx->minfo->nvars, ORD_LEX); fmpz_mpoly_init3(Al, 0, wbits, lctx); fmpz_mpoly_init3(Bl, 0, wbits, lctx); fmpz_mpoly_init3(Gl, 0, wbits, lctx); fmpz_mpoly_init3(Abarl, 0, wbits, lctx); fmpz_mpoly_init3(Bbarl, 0, wbits, lctx); fmpz_mpoly_to_mpolyl_perm_deflate(Al, lctx, A, ctx, perm, shift, stride); fmpz_mpoly_to_mpolyl_perm_deflate(Bl, lctx, B, ctx, perm, shift, stride); success = fmpz_mpolyl_gcd_brown(Gl, Abarl, Bbarl, Al, Bl, lctx, NULL); if (!success) goto cleanup; fmpz_mpoly_from_mpolyl_perm_inflate(G, wbits, ctx, Gl, lctx, perm, shift, stride); if (fmpz_sgn(G->coeffs + 0) < 0) fmpz_mpoly_neg(G, G, ctx); cleanup: fmpz_mpoly_clear(Al, lctx); fmpz_mpoly_clear(Bl, lctx); fmpz_mpoly_clear(Gl, lctx); fmpz_mpoly_clear(Abarl, lctx); fmpz_mpoly_clear(Bbarl, lctx); fmpz_mpoly_ctx_clear(lctx); cleanup1: flint_free(perm); flint_free(shift); flint_free(stride); return success; } void gcd_check( fmpz_mpoly_t g, fmpz_mpoly_t a, fmpz_mpoly_t b, const fmpz_mpoly_t gdiv, fmpz_mpoly_ctx_t ctx, slong i, slong j, const char * name) { int res; fmpz_mpoly_t ca, cb, cg; fmpz_mpoly_init(ca, ctx); fmpz_mpoly_init(cb, ctx); fmpz_mpoly_init(cg, ctx); res = compute_gcd(g, a, b, ctx); fmpz_mpoly_assert_canonical(g, ctx); if (!res) { flint_printf("FAIL: Check gcd can be computed\n"); flint_printf("i = %wd, j = %wd, %s\n", i, j, name); flint_abort(); } if (!fmpz_mpoly_is_zero(gdiv, ctx)) { if (!fmpz_mpoly_divides(ca, g, gdiv, ctx)) { flint_printf("FAIL: Check divisor of gcd\n"); flint_printf("i = %wd, j = %wd, %s\n", i, j, name); flint_abort(); } } if (fmpz_mpoly_is_zero(g, ctx)) { if (!fmpz_mpoly_is_zero(a, ctx) || !fmpz_mpoly_is_zero(b, ctx)) { flint_printf("FAIL: Check zero gcd\n"); flint_printf("i = %wd, j = %wd, %s\n", i, j, name); flint_abort(); } goto cleanup; } if (fmpz_sgn(g->coeffs + 0) <= 0) { flint_printf("FAIL: Check gcd has positive lc\n"); flint_printf("i = %wd, j = %wd, %s\n", i, j, name); flint_abort(); } res = 1; res = res && fmpz_mpoly_divides(ca, a, g, ctx); res = res && fmpz_mpoly_divides(cb, b, g, ctx); if (!res) { flint_printf("FAIL: Check divisibility\n"); flint_printf("i = %wd, j = %wd, %s\n", i, j, name); flint_abort(); } res = compute_gcd(cg, ca, cb, ctx); fmpz_mpoly_assert_canonical(cg, ctx); if (!res) { flint_printf("FAIL: Check gcd of cofactors can be computed\n"); flint_printf("i = %wd, j = %wd, %s\n", i, j, name); flint_abort(); } if (!fmpz_mpoly_is_one(cg, ctx)) { flint_printf("FAIL: Check gcd of cofactors is one\n"); flint_printf("i = %wd, j = %wd, %s\n", i, j, name); flint_abort(); } cleanup: fmpz_mpoly_clear(ca, ctx); fmpz_mpoly_clear(cb, ctx); fmpz_mpoly_clear(cg, ctx); } int main(void) { slong i, j, tmul = 15; FLINT_TEST_INIT(state); flint_printf("gcd_brown...."); fflush(stdout); for (i = 0; i < tmul * flint_test_multiplier(); i++) { fmpz_mpoly_ctx_t ctx; fmpz_mpoly_t a, b, g, t; flint_bitcnt_t coeff_bits; slong len, len1, len2; slong degbound; fmpz_mpoly_ctx_init_rand(ctx, state, 5); fmpz_mpoly_init(g, ctx); fmpz_mpoly_init(a, ctx); fmpz_mpoly_init(b, ctx); fmpz_mpoly_init(t, ctx); len = n_randint(state, 40) + 1; len1 = n_randint(state, 60); len2 = n_randint(state, 60); degbound = 1 + 50/ctx->minfo->nvars/ctx->minfo->nvars; coeff_bits = n_randint(state, 300); for (j = 0; j < 4; j++) { fmpz_mpoly_randtest_bound(t, state, len, coeff_bits + 1, degbound, ctx); if (fmpz_mpoly_is_zero(t, ctx)) fmpz_mpoly_one(t, ctx); fmpz_mpoly_randtest_bound(a, state, len1, coeff_bits, degbound, ctx); fmpz_mpoly_randtest_bound(b, state, len2, coeff_bits, degbound, ctx); fmpz_mpoly_mul(a, a, t, ctx); fmpz_mpoly_mul(b, b, t, ctx); fmpz_mpoly_scalar_mul_ui(a, a, n_randint(state, 10) + 1, ctx); fmpz_mpoly_scalar_mul_ui(b, b, n_randint(state, 10) + 1, ctx); fmpz_mpoly_randtest_bits(g, state, len, coeff_bits, FLINT_BITS, ctx); gcd_check(g, a, b, t, ctx, i, j, "random dense"); } fmpz_mpoly_clear(g, ctx); fmpz_mpoly_clear(a, ctx); fmpz_mpoly_clear(b, ctx); fmpz_mpoly_clear(t, ctx); fmpz_mpoly_ctx_clear(ctx); } flint_printf("PASS\n"); FLINT_TEST_CLEANUP(state); return 0; }