fmpz_mpoly_to_mpolyv, fmpz_mpoly_from_mpolyv
Synopsis
#include <flint/fmpz_mpoly_factor.h>void fmpz_mpoly_to_mpolyv(fmpz_mpolyv_t A, const fmpz_mpoly_t B, const fmpz_mpoly_t xalpha, const fmpz_mpoly_ctx_t ctx)sourcevoid fmpz_mpoly_from_mpolyv(fmpz_mpoly_t A, flint_bitcnt_t Abits, const fmpz_mpolyv_t B, const fmpz_mpoly_t xalpha, const fmpz_mpoly_ctx_t ctx)sourceThe first writes B = \sum_i A_i \cdot \mathit{xalpha}^i by repeated division with remainder by xalpha; for \mathit{xalpha} = x_j - \alpha the A_i are the Taylor coefficients of B at x_j = \alpha. The second evaluates such an expansion by Horner's rule and packs the result into Abits bits.
Cite this page
The FLINT team, “fmpz_mpoly_to_mpolyv, fmpz_mpoly_from_mpolyv (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_to_mpolyv.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mpoly-factor-fmpz-mpoly-to-mpolyv,
author = {{The FLINT team}},
title = {{fmpz\_mpoly\_to\_mpolyv, fmpz\_mpoly\_from\_mpolyv (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_to_mpolyv.html},
note = {Generated 2026-10-20}
}