FLINT3.7.0-dev
/

_fq_nmod_mpoly_add, _fq_nmod_mpoly_mul_johnson, _fq_nmod_mpoly_divides_monagan_pearce, _fq_nmod_mpoly_eval_all_fq_nmod, _fq_nmod_mpoly_compose_mat

Synopsis#include <flint/fq_nmod_mpoly.h>
slong _fq_nmod_mpoly_add(ulong * coeff1, ulong * exp1, ulong * coeff2, const ulong * exp2, slong len2, ulong * coeff3, const ulong * exp3, slong len3, slong N, const ulong * cmpmask, const fq_nmod_ctx_t fqctx)source
void _fq_nmod_mpoly_mul_johnson(fq_nmod_mpoly_t A, const ulong * Bcoeffs, const ulong * Bexps, slong Blen, const ulong * Ccoeffs, const ulong * Cexps, slong Clen, flint_bitcnt_t bits, slong N, const ulong * cmpmask, const fq_nmod_ctx_t ctx)source
int _fq_nmod_mpoly_divides_monagan_pearce(fq_nmod_mpoly_t A, const ulong * coeff2, const ulong * exp2, slong len2, const ulong * coeff3, const ulong * exp3, slong len3, flint_bitcnt_t bits, slong N, const ulong * cmpmask, const fq_nmod_ctx_t fqctx)source
void _fq_nmod_mpoly_eval_all_fq_nmod(fq_nmod_t ev, const ulong * Acoeffs, const ulong * Aexps, slong Alen, flint_bitcnt_t Abits, fq_nmod_struct * const * alphas, const mpoly_ctx_t mctx, const fq_nmod_ctx_t fqctx)source
void _fq_nmod_mpoly_compose_mat(fq_nmod_mpoly_t A, const fq_nmod_mpoly_t B, const fmpz_mat_t M, const fq_nmod_mpoly_ctx_t ctxB, const fq_nmod_mpoly_ctx_t ctxAC)source

Kernels on term arrays: merge-addition, heap multiplication and exact division (returning 0 if not exact), evaluation at a point, and substitution of monomials by a matrix acting on exponent vectors.

Cite this page

The FLINT team, “_fq_nmod_mpoly_add, _fq_nmod_mpoly_mul_johnson, _fq_nmod_mpoly_divides_monagan_pearce, _fq_nmod_mpoly_eval_all_fq_nmod, _fq_nmod_mpoly_compose_mat (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_add.html (generated 2026-10-20).