FLINT3.7.0-dev

n_polyun_zip_start, n_polyu2n_add_zip_must_match, n_polyun_zip_solve

Synopsis#include <flint/nmod_mpoly_factor.h>
void n_polyun_zip_start(n_polyun_t Z, n_polyun_t H, slong req_images)source
int n_polyu2n_add_zip_must_match(n_polyun_t Z, const n_bpoly_t A, slong cur_length)source
int n_polyun_zip_solve(nmod_mpoly_t A, n_polyun_t Z, n_polyun_t H, n_polyun_t M, const nmod_mpoly_ctx_t ctx)source

Sparse interpolation of the coefficients of a polynomial with known monomial structure H: start collecting req_images images in Z, add the image A (returning 0 if its support does not match), and solve the transposed Vandermonde systems, returning 1 for success and 0 or -1 if the images are inconsistent with the assumed structure.

Cite this page

The FLINT team, “n_polyun_zip_start, n_polyu2n_add_zip_must_match, n_polyun_zip_solve (nmod_mpoly_factor.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/nmod_mpoly_factor/n_polyun_zip_start.html (generated 2026-10-20).