`_fmpz_mod_poly_reduce_matrix_mod_poly`

Synopsis#include <flint/fmpz_mod_poly.h>

void _fmpz_mod_poly_reduce_matrix_mod_poly(fmpz_mat_t A, const fmpz_mat_t B, const fmpz_mod_poly_t f, const fmpz_mod_ctx_t ctx)

source

Initialises $A$ and sets its rows to the rows of $B$ reduced modulo $f$ : $B$ is a matrix of powers $g^i \bmod h$ as above and $f$ a divisor of $h$ , so that $A$ is the corresponding matrix modulo $f$ , with $\lfloor \sqrt{\deg f} \rfloor + 1$ rows and $\deg f$ columns.

Cite this page

The FLINT team, “_fmpz_mod_poly_reduce_matrix_mod_poly (fmpz_mod_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mod_poly/_fmpz_mod_poly_reduce_matrix_mod_poly.html (generated 2026-11-02).

@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-reduce-matrix-mod-poly,
  author       = {{The FLINT team}},
  title        = {{\_fmpz\_mod\_poly\_reduce\_matrix\_mod\_poly (fmpz\_mod\_poly.h)}},
  howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
  year         = {2026},
  url          = {https://flintlib.org/doc/fmpz_mod_poly/_fmpz_mod_poly_reduce_matrix_mod_poly.html},
  note         = {Generated 2026-11-02}
}

Edit this page · PDF version · Built with fdoc from 0a4634bf95