FLINT3.7.0-dev

fq_nmod_mpoly_divides_monagan_pearce, fq_nmod_mpoly_div_monagan_pearce, fq_nmod_mpoly_divrem_monagan_pearce, fq_nmod_mpoly_divrem_ideal_monagan_pearce

Synopsis#include <flint/fq_nmod_mpoly.h>
int fq_nmod_mpoly_divides_monagan_pearce(fq_nmod_mpoly_t poly1, const fq_nmod_mpoly_t poly2, const fq_nmod_mpoly_t poly3, const fq_nmod_mpoly_ctx_t ctx)source
void fq_nmod_mpoly_div_monagan_pearce(fq_nmod_mpoly_t q, const fq_nmod_mpoly_t poly2, const fq_nmod_mpoly_t poly3, const fq_nmod_mpoly_ctx_t ctx)source
void fq_nmod_mpoly_divrem_monagan_pearce(fq_nmod_mpoly_t q, fq_nmod_mpoly_t r, const fq_nmod_mpoly_t poly2, const fq_nmod_mpoly_t poly3, const fq_nmod_mpoly_ctx_t ctx)source
void fq_nmod_mpoly_divrem_ideal_monagan_pearce(fq_nmod_mpoly_struct ** q, fq_nmod_mpoly_t r, const fq_nmod_mpoly_t poly2, fq_nmod_mpoly_struct * const * poly3, slong len, const fq_nmod_mpoly_ctx_t ctx)source

The heap implementations [MonPea2011] behind the division functions.

References#

Cite this page

The FLINT team, “fq_nmod_mpoly_divides_monagan_pearce, fq_nmod_mpoly_div_monagan_pearce, fq_nmod_mpoly_divrem_monagan_pearce, fq_nmod_mpoly_divrem_ideal_monagan_pearce (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_divides_monagan_pearce.html (generated 2026-10-20).