n_polyun_product_roots, n_fq_polyun_product_roots
Synopsis
#include <flint/n_poly.h>slong n_polyun_product_roots(n_polyun_t M, const n_polyun_t H, nmod_t ctx)sourceslong n_fq_polyun_product_roots(n_fq_polyun_t M, const n_fq_polyun_t H, const fq_nmod_ctx_t ctx, n_poly_stack_t St)sourceFor each term of H, set the corresponding term of M (with the same exponent) to the product \prod_j (x - h_j) over the coefficients h_j of that term's coefficient polynomial, and return the largest length of these products. Used to build the master polynomials of Zippel's interpolation.
Cite this page
The FLINT team, “n_polyun_product_roots, n_fq_polyun_product_roots (n_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/n_poly/n_polyun_product_roots.html (generated 2026-10-20).
@misc{flint-doc-n-poly-n-polyun-product-roots,
author = {{The FLINT team}},
title = {{n\_polyun\_product\_roots, n\_fq\_polyun\_product\_roots (n\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/n_poly/n_polyun_product_roots.html},
note = {Generated 2026-10-20}
}