fq_nmod_mpolyn_gcd_brown_smprime, fq_nmod_mpolyn_gcd_brown_lgprime
Synopsis
#include <flint/fq_nmod_mpoly.h>int fq_nmod_mpolyn_gcd_brown_smprime(fq_nmod_mpolyn_t G, fq_nmod_mpolyn_t Abar, fq_nmod_mpolyn_t Bbar, fq_nmod_mpolyn_t A, fq_nmod_mpolyn_t B, slong var, const fq_nmod_mpoly_ctx_t ctx)sourceint fq_nmod_mpolyn_gcd_brown_lgprime(fq_nmod_mpolyn_t G, fq_nmod_mpolyn_t Abar, fq_nmod_mpolyn_t Bbar, fq_nmod_mpolyn_t A, fq_nmod_mpolyn_t B, slong var, const fq_nmod_mpoly_ctx_t ctx)sourceBrown's algorithm with evaluation points in \mathbb{F}_q, or with reduction of the variable var modulo irreducible polynomials of increasing degree over \mathbb{F}_q (images over \mathbb{F}_{q^n}). Return 1 for success, also setting the cofactors.
Cite this page
The FLINT team, “fq_nmod_mpolyn_gcd_brown_smprime, fq_nmod_mpolyn_gcd_brown_lgprime (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_mpolyn_gcd_brown_smprime.html (generated 2026-10-20).
@misc{flint-doc-fq-nmod-mpoly-fq-nmod-mpolyn-gcd-brown-smprime,
author = {{The FLINT team}},
title = {{fq\_nmod\_mpolyn\_gcd\_brown\_smprime, fq\_nmod\_mpolyn\_gcd\_brown\_lgprime (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_mpolyn_gcd_brown_smprime.html},
note = {Generated 2026-10-20}
}