fq_nmod_mpoly_gcd, fq_nmod_mpoly_gcd_cofactors
Synopsis
#include <flint/fq_nmod_mpoly.h>int fq_nmod_mpoly_gcd(fq_nmod_mpoly_t G, const fq_nmod_mpoly_t A, const fq_nmod_mpoly_t B, const fq_nmod_mpoly_ctx_t ctx)sourceint fq_nmod_mpoly_gcd_cofactors(fq_nmod_mpoly_t G, fq_nmod_mpoly_t Abar, fq_nmod_mpoly_t Bbar, const fq_nmod_mpoly_t A, const fq_nmod_mpoly_t B, const fq_nmod_mpoly_ctx_t ctx)sourceSet G to the monic GCD of A and B (zero if both are zero), and fq_nmod_mpoly_gcd_cofactors also \bar{A} = A/G and \bar{B} = B/G. The algorithm is chosen as for nmod_mpoly_gcd; when \mathbb{F}_q is too small, Brown's and Zippel's algorithms continue with images over \mathbb{F}_q[x]/(h) \cong \mathbb{F}_{q^n} for irreducible h in one of the variables.
Cite this page
The FLINT team, “fq_nmod_mpoly_gcd, fq_nmod_mpoly_gcd_cofactors (fq_nmod_mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_nmod_mpoly/fq_nmod_mpoly_gcd.html (generated 2026-10-20).
@misc{flint-doc-fq-nmod-mpoly-fq-nmod-mpoly-gcd,
author = {{The FLINT team}},
title = {{fq\_nmod\_mpoly\_gcd, fq\_nmod\_mpoly\_gcd\_cofactors (fq\_nmod\_mpoly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq_nmod_mpoly/fq_nmod_mpoly_gcd.html},
note = {Generated 2026-10-20}
}