FLINT3.7.0-dev

gr_mpoly_divrem_ideal, gr_mpoly_divrem_ideal_heap_threaded, gr_mpoly_divrem_ideal_weak, gr_mpoly_divrem_ideal_weak_heap_threaded

Synopsis#include <flint/gr_mpoly.h>
int gr_mpoly_divrem_ideal(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)source
int gr_mpoly_divrem_ideal_heap_threaded(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)source
int gr_mpoly_divrem_ideal_weak(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)source
int gr_mpoly_divrem_ideal_weak_heap_threaded(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)source

Division by a vector of divisors B_1, \ldots, B_k: A = \sum_i Q_i B_i + R, where no monomial of R is divisible by any leading monomial \operatorname{lm}(B_i) (the multivariate division algorithm, [CLO2015, §2.3]); the result depends on the order of the divisors unless they form a Gröbner basis. The weak versions accumulate inexact coefficient remainders as for gr_mpoly_divrem_weak. The output vector Q is resized to k entries.

Guides#

References#

Cite this page

The FLINT team, “gr_mpoly_divrem_ideal, gr_mpoly_divrem_ideal_heap_threaded, gr_mpoly_divrem_ideal_weak, gr_mpoly_divrem_ideal_weak_heap_threaded (gr_mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/gr_mpoly/gr_mpoly_divrem_ideal.html (generated 2026-10-20).