mpoly_monomial_max1, mpoly_monomial_min1, mpoly_monomial_max, mpoly_monomial_min, mpoly_monomial_max_mp, mpoly_monomial_min_mp
Synopsis
#include <flint/mpoly.h>void mpoly_monomial_max(ulong * exp1, const ulong * exp2, const ulong * exp3, flint_bitcnt_t bits, slong N, ulong mask)sourcevoid mpoly_monomial_min(ulong * exp1, const ulong * exp2, const ulong * exp3, flint_bitcnt_t bits, slong N, ulong mask)sourcevoid mpoly_monomial_max_mp(ulong * exp1, const ulong * exp2, const ulong * exp3, flint_bitcnt_t bits, slong N)sourcevoid mpoly_monomial_min_mp(ulong * exp1, const ulong * exp2, const ulong * exp3, flint_bitcnt_t bits, slong N)sourceSet exp1 to the field-wise maximum (least common multiple) or minimum (greatest common divisor) of exp2 and exp3. The single precision versions take the overflow mask and compute all fields of a word at once without branches: the guard bit of each field of mask + exp2 - exp3 records whether that field of exp2 is at least that of exp3.
Cite this page
The FLINT team, “mpoly_monomial_max1, mpoly_monomial_min1, mpoly_monomial_max, mpoly_monomial_min, mpoly_monomial_max_mp, mpoly_monomial_min_mp (mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/mpoly/mpoly_monomial_max1.html (generated 2026-10-20).
@misc{flint-doc-mpoly-mpoly-monomial-max1,
author = {{The FLINT team}},
title = {{mpoly\_monomial\_max1, mpoly\_monomial\_min1, mpoly\_monomial\_max, mpoly\_monomial\_min, mpoly\_monomial\_max\_mp, mpoly\_monomial\_min\_mp (mpoly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/mpoly/mpoly_monomial_max1.html},
note = {Generated 2026-10-20}
}