_fmpz_mod_zip_vand_solve, _fmpz_mod_zip_eval_step, fmpz_mod_polyun_product_roots, fmpz_mod_polyun_zip_start, fmpz_mod_polyu2n_zip_eval_cur_inc_coeff, fmpz_mod_polyun_zip_solve, fmpz_mod_mpoly_mock_eval_coeff, mpoly_monomial_evals_fmpz_mod, mpoly1_monomial_evals_fmpz_mod, mpoly2_monomial_evals_fmpz_mod
#include <flint/fmpz_mod_mpoly_factor.h>int _fmpz_mod_zip_vand_solve(fmpz * coeffs, const fmpz * monomials, slong mlength, const fmpz * evals, slong elength, const fmpz * master, fmpz * scratch, const fmpz_mod_ctx_t ctx)sourcevoid _fmpz_mod_zip_eval_step(fmpz_t ev, fmpz * cur, const fmpz * inc, const fmpz * coeffs, slong length, const fmpz_mod_ctx_t ctx)sourceslong fmpz_mod_polyun_product_roots(fmpz_mod_polyun_t M, const fmpz_mod_polyun_t H, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_polyun_zip_start(fmpz_mod_polyun_t Z, fmpz_mod_polyun_t H, slong req_images, const fmpz_mod_ctx_t fctx)sourcevoid fmpz_mod_polyu2n_zip_eval_cur_inc_coeff(fmpz_mod_polyun_t E, fmpz_mod_polyun_t Acur, const fmpz_mod_polyun_t Ainc, const fmpz_mod_polyun_t Acoeff, const fmpz_mod_ctx_t ctx)sourceint fmpz_mod_polyun_zip_solve(fmpz_mod_mpoly_t A, fmpz_mod_polyun_t Z, fmpz_mod_polyun_t H, fmpz_mod_polyun_t M, const fmpz_mod_mpoly_ctx_t ctx)sourcevoid fmpz_mod_mpoly_mock_eval_coeff(fmpz_mod_polyun_t mock, const fmpz_mod_mpoly_t A, const fmpz_mod_polyun_t Aeh_inc, const fmpz_mod_mpoly_ctx_t ctx)sourcevoid mpoly_monomial_evals_fmpz_mod(fmpz_mod_poly_t EH, const ulong * Aexps, slong Alen, flint_bitcnt_t Abits, fmpz_mod_poly_struct * alpha_caches, slong start, slong stop, const mpoly_ctx_t mctx, const fmpz_mod_ctx_t fpctx)sourcevoid mpoly1_monomial_evals_fmpz_mod(fmpz_mod_polyun_t EH, const ulong * Aexps, flint_bitcnt_t Abits, const ulong * Amarks, slong Amarkslen, fmpz_mod_poly_struct * alpha_caches, slong m, const mpoly_ctx_t mctx, const fmpz_mod_ctx_t fpctx)sourcevoid mpoly2_monomial_evals_fmpz_mod(fmpz_mod_polyun_t EH, const ulong * Aexps, flint_bitcnt_t Abits, ulong * Amarks, slong Amarkslen, fmpz_mod_poly_struct * alpha_caches, slong m, const mpoly_ctx_t mctx, const fmpz_mod_ctx_t fpctx)sourceSparse interpolation of polynomials with known support: the monomial evaluations at powers of the evaluation points, the master polynomials \prod (z - m_i) of the monomial values (product_roots, returning the maximum number of terms), the incremental evaluation of the next image, and the solution of the transposed Vandermonde systems (returning 1 for success and 0 or -1 if the images are inconsistent).
The FLINT team, “_fmpz_mod_zip_vand_solve, _fmpz_mod_zip_eval_step, fmpz_mod_polyun_product_roots, fmpz_mod_polyun_zip_start, fmpz_mod_polyu2n_zip_eval_cur_inc_coeff, fmpz_mod_polyun_zip_solve, fmpz_mod_mpoly_mock_eval_coeff, mpoly_monomial_evals_fmpz_mod, mpoly1_monomial_evals_fmpz_mod, mpoly2_monomial_evals_fmpz_mod (fmpz_mod_mpoly_factor.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mod_mpoly_factor/_fmpz_mod_zip_vand_solve.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-mpoly-factor-fmpz-mod-zip-vand-solve,
author = {{The FLINT team}},
title = {{\_fmpz\_mod\_zip\_vand\_solve, \_fmpz\_mod\_zip\_eval\_step, fmpz\_mod\_polyun\_product\_roots, fmpz\_mod\_polyun\_zip\_start, fmpz\_mod\_polyu2n\_zip\_eval\_cur\_inc\_coeff, fmpz\_mod\_polyun\_zip\_solve, fmpz\_mod\_mpoly\_mock\_eval\_coeff, mpoly\_monomial\_evals\_fmpz\_mod, mpoly1\_monomial\_evals\_fmpz\_mod, mpoly2\_monomial\_evals\_fmpz\_mod (fmpz\_mod\_mpoly\_factor.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mod_mpoly_factor/_fmpz_mod_zip_vand_solve.html},
note = {Generated 2026-10-20}
}