_fq_nmod_poly_shift_right, fq_nmod_poly_shift_right
Synopsis
#include <flint/fq_nmod_poly.h>void _fq_nmod_poly_shift_right(fq_nmod_struct * rop, const fq_nmod_struct * op, slong len, slong n, const fq_nmod_ctx_t ctx)void fq_nmod_poly_shift_right(fq_nmod_poly_t rop, const fq_nmod_poly_t op, slong n, const fq_nmod_ctx_t ctx)Set rop to \lfloor \mathit{op} / x^n \rfloor, dropping the n lowest coefficients; the result is zero if n is at least the length. The underscore version requires len > n, writes len - n coefficients and allows aliasing (the top n coefficients of op are then permuted, not zeroed).
Generated from the same template as _fq_poly_shift_right, whose documentation has the details.
Cite this page
The FLINT team, “_fq_nmod_poly_shift_right, fq_nmod_poly_shift_right (fq_nmod_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_nmod_poly/_fq_nmod_poly_shift_right.html (generated 2026-10-20).
@misc{flint-doc-fq-nmod-poly-fq-nmod-poly-shift-right,
author = {{The FLINT team}},
title = {{\_fq\_nmod\_poly\_shift\_right, fq\_nmod\_poly\_shift\_right (fq\_nmod\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq_nmod_poly/_fq_nmod_poly_shift_right.html},
note = {Generated 2026-10-20}
}