fmpz_mod_mpoly_resultant, fmpz_mod_mpoly_discriminant
Synopsis
#include <flint/fmpz_mod_mpoly.h>int fmpz_mod_mpoly_resultant(fmpz_mod_mpoly_t R, const fmpz_mod_mpoly_t A, const fmpz_mod_mpoly_t B, slong var, const fmpz_mod_mpoly_ctx_t ctx)sourceint fmpz_mod_mpoly_discriminant(fmpz_mod_mpoly_t R, const fmpz_mod_mpoly_t A, slong var, const fmpz_mod_mpoly_ctx_t ctx)sourceSet R to the resultant of A and B, or the discriminant of A, with respect to the variable of index var, by the subresultant algorithm of Ducos [Duc2000]. Return 1 for success. The modulus must be prime.
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_mod_mpoly_resultant, fmpz_mod_mpoly_discriminant (fmpz_mod_mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mod_mpoly/fmpz_mod_mpoly_resultant.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-mpoly-fmpz-mod-mpoly-resultant,
author = {{The FLINT team}},
title = {{fmpz\_mod\_mpoly\_resultant, fmpz\_mod\_mpoly\_discriminant (fmpz\_mod\_mpoly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mod_mpoly/fmpz_mod_mpoly_resultant.html},
note = {Generated 2026-10-20}
}