FLINT3.7.0-dev

gr_ore_poly_mul_ui, gr_ore_poly_mul_si, gr_ore_poly_mul_fmpz, gr_ore_poly_mul_fmpq, gr_ore_poly_other_mul

Synopsis#include <flint/gr_ore_poly.h>
int gr_ore_poly_mul_ui(gr_ore_poly_t res, const gr_ore_poly_t poly, ulong c, gr_ore_poly_ctx_t ctx)source
int gr_ore_poly_mul_si(gr_ore_poly_t res, const gr_ore_poly_t poly, slong c, gr_ore_poly_ctx_t ctx)source
int gr_ore_poly_mul_fmpz(gr_ore_poly_t res, const gr_ore_poly_t poly, const fmpz_t c, gr_ore_poly_ctx_t ctx)source
int gr_ore_poly_mul_fmpq(gr_ore_poly_t res, const gr_ore_poly_t poly, const fmpq_t c, gr_ore_poly_ctx_t ctx)source
int gr_ore_poly_other_mul(gr_ore_poly_t res, gr_srcptr x, gr_ctx_t x_ctx, const gr_ore_poly_t poly, gr_ore_poly_ctx_t ctx)source

Multiply by an integer or rational constant (which commutes with D), or multiply on the left by x, that is compute x L: an Ore polynomial with the same context is multiplied with gr_ore_poly_mul, and the other kinds of elements accepted by gr_ore_poly_set_other are constants c with c L = \sum_i (c a_i) D^i.

Cite this page

The FLINT team, “gr_ore_poly_mul_ui, gr_ore_poly_mul_si, gr_ore_poly_mul_fmpz, gr_ore_poly_mul_fmpq, gr_ore_poly_other_mul (gr_ore_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/gr_ore_poly/gr_ore_poly_mul_ui.html (generated 2026-10-20).