FLINT3.7.0-dev

fmpz_bpoly_resultant, _fmpz_bpoly_resultant, _fmpz_bpoly_resultant_len

Synopsis#include <flint/fmpz_mpoly_factor.h>
int fmpz_bpoly_resultant(fmpz_poly_t res, const fmpz_bpoly_t A, const fmpz_bpoly_t B, int proved)source
int _fmpz_bpoly_resultant(fmpz_poly_t res, fmpz_poly_struct * A, slong lenA, fmpz_poly_struct * B, slong lenB, int proved)source
int _fmpz_bpoly_resultant_len(fmpz_poly_t res, fmpz_poly_struct * A, slong lenA, fmpz_poly_struct * B, slong lenB, slong rlen, int proved)source

Set res to the resultant of AA and BB with respect to xx, a polynomial in yy, by reduction modulo word-size primes, resultants of the images (by _n_bpoly_mod_resultant_len, with whichever algorithm it picks) and Chinese remaindering. If proved is nonzero, enough primes are used for their product to exceed twice a Hadamard-type bound on the coefficients of the resultant, which makes the result exact; otherwise the reconstruction stops once it has been left unchanged by primes whose product exceeds 21002^{100}, which is a heuristic. Return 0 if no image could be computed. The underscore version works in place on the coefficient arrays, whose contents it removes, and requires lenA≥lenB≥2\mathit{lenA} \ge \mathit{lenB} \ge 2; _fmpz_bpoly_resultant_len is the same given that the resultant has length at most rlen, which saves evaluation points when that is less than the bound read off the degrees. This is the dense case of fmpz_mpoly_resultant and the modular resultant of the generic polynomial module; see Bivariate resultants by evaluation and interpolation.

Cite this page

The FLINT team, “fmpz_bpoly_resultant, _fmpz_bpoly_resultant, _fmpz_bpoly_resultant_len (fmpz_mpoly_factor.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mpoly_factor/fmpz_bpoly_resultant.html (generated 2026-11-20).