fmpz_mpoly_resultant_kronecker
#include <flint/fmpz_mpoly.h>int fmpz_mpoly_resultant_kronecker(fmpz_mpoly_t R, const fmpz_mpoly_t A, const fmpz_mpoly_t B, slong var, const fmpz_mpoly_ctx_t ctx)sourceTries to set to the resultant of and with respect to the variable of index var by packing the other variables into one by Kronecker substitution, after removing monomial factors and deflating, and computing the bivariate resultant 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). Returns 1 for success, and 0, leaving unchanged, if an input has exponents of more than one word or degree 0 in the variable of index var, or if the dense box of the resultant has more than coefficients.
The FLINT team, “fmpz_mpoly_resultant_kronecker (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_kronecker.html (generated 2026-11-20).
@misc{flint-doc-fmpz-mpoly-fmpz-mpoly-resultant-kronecker,
author = {{The FLINT team}},
title = {{fmpz\_mpoly\_resultant\_kronecker (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_kronecker.html},
note = {Generated 2026-11-20}
}