gr_mpoly_quasidivrem, gr_mpoly_quasidivrem_heap, gr_mpoly_quasidiv, gr_mpoly_quasidivrem_ideal
Synopsis
#include <flint/gr_mpoly.h>int gr_mpoly_quasidivrem(gr_ptr scale, gr_mpoly_t Q, gr_mpoly_t R, const gr_mpoly_t A, const gr_mpoly_t B, gr_mpoly_ctx_t ctx)sourceint gr_mpoly_quasidivrem_heap(gr_ptr scale, gr_mpoly_t Q, gr_mpoly_t R, const gr_mpoly_t A, const gr_mpoly_t B, gr_mpoly_ctx_t ctx)sourceint gr_mpoly_quasidiv(gr_ptr scale, gr_mpoly_t Q, const gr_mpoly_t A, const gr_mpoly_t B, gr_mpoly_ctx_t ctx)sourceint gr_mpoly_quasidivrem_ideal(gr_ptr scale, gr_mpoly_vec_t Q, gr_mpoly_t R, const gr_mpoly_t A, const gr_mpoly_vec_t B, gr_mpoly_ctx_t ctx)sourcePseudo-division: compute a scalar scale (an element of the coefficient ring, a product of powers of leading coefficients of the divisors) with \mathit{scale} \cdot A = QB + R, respectively \mathit{scale} \cdot A = \sum_i Q_i B_i + R, and no monomial of R divisible by a leading monomial of the divisors. This divides over the fraction field of an integral domain without leaving the ring.
Cite this page
The FLINT team, “gr_mpoly_quasidivrem, gr_mpoly_quasidivrem_heap, gr_mpoly_quasidiv, gr_mpoly_quasidivrem_ideal (gr_mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/gr_mpoly/gr_mpoly_quasidivrem.html (generated 2026-10-20).
@misc{flint-doc-gr-mpoly-gr-mpoly-quasidivrem,
author = {{The FLINT team}},
title = {{gr\_mpoly\_quasidivrem, gr\_mpoly\_quasidivrem\_heap, gr\_mpoly\_quasidiv, gr\_mpoly\_quasidivrem\_ideal (gr\_mpoly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/gr_mpoly/gr_mpoly_quasidivrem.html},
note = {Generated 2026-10-20}
}