nmod_mpoly_resultant
Synopsis
#include <flint/nmod_mpoly.h>int nmod_mpoly_resultant(nmod_mpoly_t R, const nmod_mpoly_t A, const nmod_mpoly_t B, slong var, const nmod_mpoly_ctx_t ctx)sourceSets R to the resultant of A and B with respect to the variable of index var, that is, the determinant of their Sylvester matrix as polynomials in that variable. Returns 1 for success. The modulus must be prime. For polynomials in exactly two variables of sufficient size the resultant is computed by evaluating the other variable at many points and interpolating (Bivariate resultants by evaluation and interpolation); otherwise by the subresultant algorithm of Ducos on the univariate forms.
Guides#
Cite this page
The FLINT team, “nmod_mpoly_resultant (nmod_mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/nmod_mpoly/nmod_mpoly_resultant.html (generated 2026-10-20).
@misc{flint-doc-nmod-mpoly-nmod-mpoly-resultant,
author = {{The FLINT team}},
title = {{nmod\_mpoly\_resultant (nmod\_mpoly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/nmod_mpoly/nmod_mpoly_resultant.html},
note = {Generated 2026-10-20}
}