fq_nmod_poly_iterated_frobenius_preinv
#include <flint/fq_nmod_poly_factor.h>void fq_nmod_poly_iterated_frobenius_preinv(fq_nmod_poly_t * rop, slong n, const fq_nmod_poly_t v, const fq_nmod_poly_t vinv, const fq_nmod_ctx_t ctx)Sets rop[i] to x^{q^i} \bmod v for 0 \le i < n, where vinv is the inverse of the reversal of v (see fq_nmod_poly_reverse and fq_nmod_poly_inv_series). The array rop must contain n initialised polynomials. If FQ_NMOD_POLY_ITERATED_FROBENIUS_CUTOFF returns 1, the powers after the first are computed by modular composition with a precomputed Brent–Kung matrix (x^{q^{i}} = x^{q^{i-1}}(x^q)), otherwise by exponentiation.
Generated from the same template as fq_poly_iterated_frobenius_preinv, whose documentation has the details.
The FLINT team, “fq_nmod_poly_iterated_frobenius_preinv (fq_nmod_poly_factor.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_nmod_poly_factor/fq_nmod_poly_iterated_frobenius_preinv.html (generated 2026-10-20).
@misc{flint-doc-fq-nmod-poly-factor-fq-nmod-poly-iterated-frobenius-preinv,
author = {{The FLINT team}},
title = {{fq\_nmod\_poly\_iterated\_frobenius\_preinv (fq\_nmod\_poly\_factor.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq_nmod_poly_factor/fq_nmod_poly_iterated_frobenius_preinv.html},
note = {Generated 2026-10-20}
}