gr_ctx_init_gr_poly_transformed_cyclic_repr
#include <flint/gr.h>int gr_ctx_init_gr_poly_transformed_cyclic_repr(gr_ctx_t ctx, gr_ctx_t base, slong * len, slong terms_bound, const gr_transformed_poly_workload_struct * workload)sourceConstructs a ring of transformed polynomials modulo x^L - 1 over base, in which products wrap around. The implementation may round the requested cyclic length *len up (for example to a power of two) and writes the actual L back. Conversions in require length at most L; conversions out give the coefficients of the reduced representative. This is the CTX_INIT_TRANSFORMED_POLY_CYCLIC_REPR method of the base ring (GR_UNABLE by default); it is used for middle products and for products whose high part is known, such as the remainder step of division by a precomputed modulus.
The FLINT team, “gr_ctx_init_gr_poly_transformed_cyclic_repr (gr.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/gr/gr_ctx_init_gr_poly_transformed_cyclic_repr.html (generated 2026-10-20).
@misc{flint-doc-gr-gr-ctx-init-gr-poly-transformed-cyclic-repr,
author = {{The FLINT team}},
title = {{gr\_ctx\_init\_gr\_poly\_transformed\_cyclic\_repr (gr.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/gr/gr_ctx_init_gr_poly_transformed_cyclic_repr.html},
note = {Generated 2026-10-20}
}