fmpz_mpoly_factor_lcc_wang
#include <flint/fmpz_mpoly_factor.h>int fmpz_mpoly_factor_lcc_wang(fmpz_mpoly_struct * lc_divs, const fmpz_mpoly_factor_t lcAfac, const fmpz_t Auc, const fmpz_poly_struct * Auf, slong r, const fmpz * alpha, const fmpz_mpoly_ctx_t ctx)sourceWang's leading coefficient determination [Wan1978]. Given the irreducible factorisation lcAfac of the leading coefficient of A in x_0 and the factorisation \mathit{Auc} \prod_{i < r} \mathit{Auf}_i of A(x_0, \alpha), sets lc_divs[i] to the predicted leading coefficient of the i-th factor of A: the product of the powers of the factors of the leading coefficient whose values at \alpha divide the leading coefficient of \mathit{Auf}_i, times an integer. Returns 0 if the evaluation point fails Wang's condition, that each factor of the leading coefficient evaluates to an integer with a prime divisor not dividing \mathit{Auc} times the constant and the values of the other factors.
References#
- [Wan1978] P. S. Wang. An improved multivariate polynomial factoring algorithm. Mathematics of Computation 32 (1978), 1215–1231. https://doi.org/10.1090/S0025-5718-1978-0568284-3
The FLINT team, “fmpz_mpoly_factor_lcc_wang (fmpz_mpoly_factor.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mpoly_factor/fmpz_mpoly_factor_lcc_wang.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mpoly-factor-fmpz-mpoly-factor-lcc-wang,
author = {{The FLINT team}},
title = {{fmpz\_mpoly\_factor\_lcc\_wang (fmpz\_mpoly\_factor.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mpoly_factor/fmpz_mpoly_factor_lcc_wang.html},
note = {Generated 2026-10-20}
}