_gr_poly_iterated_frobenius_preinv, gr_poly_iterated_frobenius_preinv
Synopsis
#include <flint/gr_poly.h>int _gr_poly_iterated_frobenius_preinv(gr_poly_struct * h, slong n, const gr_poly_t frob, const gr_poly_preinv_t P, const fmpz_t q, gr_ctx_t ctx)sourceint gr_poly_iterated_frobenius_preinv(gr_poly_struct * h, slong n, const gr_poly_preinv_t P, gr_ctx_t ctx)sourceSet h_i = x^{q^i} \bmod v for 0 \le i < n, where P holds the modulus v. The underscore version takes x^q \bmod v as frob. Depending on the size of q relative to the degree of v, the powers are computed by repeated exponentiation or by modular composition with a precomputed matrix of powers of frob.
Cite this page
The FLINT team, “_gr_poly_iterated_frobenius_preinv, gr_poly_iterated_frobenius_preinv (gr_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/gr_poly/_gr_poly_iterated_frobenius_preinv.html (generated 2026-10-20).
@misc{flint-doc-gr-poly-gr-poly-iterated-frobenius-preinv,
author = {{The FLINT team}},
title = {{\_gr\_poly\_iterated\_frobenius\_preinv, gr\_poly\_iterated\_frobenius\_preinv (gr\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/gr_poly/_gr_poly_iterated_frobenius_preinv.html},
note = {Generated 2026-10-20}
}