fmpz_mpoly_interp_reduce_p_mpolyn, fmpz_mpoly_interp_lift_p_mpolyn, fmpz_mpoly_interp_crt_p_mpolyn
Synopsis
#include <flint/fmpz_mpoly_factor.h>void fmpz_mpoly_interp_reduce_p_mpolyn(nmod_mpolyn_t E, const nmod_mpoly_ctx_t pctx, const fmpz_mpoly_t A, const fmpz_mpoly_ctx_t ctx)sourcevoid fmpz_mpoly_interp_lift_p_mpolyn(fmpz_mpoly_t A, const fmpz_mpoly_ctx_t ctx, const nmod_mpolyn_t B, const nmod_mpoly_ctx_t pctx)sourceint fmpz_mpoly_interp_crt_p_mpolyn(fmpz_mpoly_t F, fmpz_mpoly_t T, const fmpz_mpoly_ctx_t ctx, fmpz_t modulus, const nmod_mpolyn_t A, const nmod_mpoly_ctx_t pctx)sourceThe same operations with the image in recursive form \mathbb{F}_p[x_0, \ldots, x_{n-2}][x_{n-1}] (an nmod_mpolyn_t, whose coefficients are univariate in the last variable), as used by Brown's algorithm. The CRT version updates F so that it is unchanged modulo modulus and congruent to A modulo p, without assuming that the monomials match; it uses T as scratch space, returns whether F changed, and does not update modulus.
Cite this page
The FLINT team, “fmpz_mpoly_interp_reduce_p_mpolyn, fmpz_mpoly_interp_lift_p_mpolyn, fmpz_mpoly_interp_crt_p_mpolyn (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_interp_reduce_p_mpolyn.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mpoly-factor-fmpz-mpoly-interp-reduce-p-mpolyn,
author = {{The FLINT team}},
title = {{fmpz\_mpoly\_interp\_reduce\_p\_mpolyn, fmpz\_mpoly\_interp\_lift\_p\_mpolyn, fmpz\_mpoly\_interp\_crt\_p\_mpolyn (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_interp_reduce_p_mpolyn.html},
note = {Generated 2026-10-20}
}