mpoly_test_irreducible, _mpoly_test_irreducible
#include <flint/mpoly.h>int mpoly_test_irreducible(ulong * Aexps, flint_bitcnt_t Abits, slong Alen, const mpoly_ctx_t ctx)sourceint _mpoly_test_irreducible(slong * Aexps, slong stride, slong Alen, slong nvars, flint_rand_t state, slong tries_left)sourceTry to prove that a polynomial with the given monomials is absolutely irreducible from its Newton polytope alone, independently of the coefficients, following Gao and Lauder [GaoLau2001]. The exponents are projected onto random planes, and the projection of the polytope is tested for integral indecomposability, at most tries_left times. Return 1 if irreducibility was proved and 0 if not; a return of 0 says nothing. The underscore version takes the exponent matrix with row stride stride; the public version returns 0 for multiprecision packing or fewer than two terms.
References#
- [GaoLau2001] S. Gao and A. G. B. Lauder. Decomposition of polytopes and polynomials. Discrete and Computational Geometry 26 (2001), 89–104. https://doi.org/10.1007/s00454-001-0024-0
The FLINT team, “mpoly_test_irreducible, _mpoly_test_irreducible (mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/mpoly/mpoly_test_irreducible.html (generated 2026-10-20).
@misc{flint-doc-mpoly-mpoly-test-irreducible,
author = {{The FLINT team}},
title = {{mpoly\_test\_irreducible, \_mpoly\_test\_irreducible (mpoly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/mpoly/mpoly_test_irreducible.html},
note = {Generated 2026-10-20}
}