_fmpz_mpoly_mul_array_chunked_LEX, _fmpz_mpoly_mul_array_chunked_DEG
Synopsis
#include <flint/fmpz_mpoly.h>void _fmpz_mpoly_mul_array_chunked_LEX(fmpz_mpoly_t P, const fmpz_mpoly_t A, const fmpz_mpoly_t B, const ulong * mults, const fmpz_mpoly_ctx_t ctx)sourcevoid _fmpz_mpoly_mul_array_chunked_DEG(fmpz_mpoly_t P, const fmpz_mpoly_t A, const fmpz_mpoly_t B, ulong degb, const fmpz_mpoly_ctx_t ctx)sourceThe array multiplication proper: split both inputs into chunks by the main variable (lex, with array bases mults) or by total degree (degree orderings, with base degb), and compute the chunks of the product one after another, each in a dense array, with coefficients accumulated in one, two or three words when a bound on their size allows it.
Cite this page
The FLINT team, “_fmpz_mpoly_mul_array_chunked_LEX, _fmpz_mpoly_mul_array_chunked_DEG (fmpz_mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mpoly/_fmpz_mpoly_mul_array_chunked_LEX.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mpoly-fmpz-mpoly-mul-array-chunked-LEX,
author = {{The FLINT team}},
title = {{\_fmpz\_mpoly\_mul\_array\_chunked\_LEX, \_fmpz\_mpoly\_mul\_array\_chunked\_DEG (fmpz\_mpoly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mpoly/_fmpz_mpoly_mul_array_chunked_LEX.html},
note = {Generated 2026-10-20}
}