fmpz_mpoly_resultant
Synopsis
#include <flint/fmpz_mpoly.h>int fmpz_mpoly_resultant(fmpz_mpoly_t R, const fmpz_mpoly_t A, const fmpz_mpoly_t B, slong var, const fmpz_mpoly_ctx_t ctx)sourceSets R to the resultant of A and B with respect to the variable of index var, and returns 1, or returns 0 on failure. If the context has two variables and the inputs are dense enough and of large enough degree, the resultant is computed by a dense multimodular algorithm (fmpz_bpoly_resultant, which uses the evaluation and interpolation algorithm of Bivariate resultants by evaluation and interpolation modulo each prime); otherwise by Ducos' subresultant algorithm on the univariate forms [Duc2000].
References#
- [Duc2000] L. Ducos. Optimizations of the subresultant algorithm. Journal of Pure and Applied Algebra 145 (2000), 149–163. https://doi.org/10.1016/S0022-4049(98)00081-4
Cite this page
The FLINT team, “fmpz_mpoly_resultant (fmpz_mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mpoly/fmpz_mpoly_resultant.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mpoly-fmpz-mpoly-resultant,
author = {{The FLINT team}},
title = {{fmpz\_mpoly\_resultant (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_resultant.html},
note = {Generated 2026-10-20}
}