FLINT3.7.0-dev

n_bpoly_mod_pfrac, n_bpoly_mod_hlift2, n_bpoly_mod_hlift2_cubic, n_bpoly_mod_hlift, n_bpoly_mod_hlift_cubic, n_polyu3_mod_hlift

Synopsis#include <flint/nmod_mpoly_factor.h>
int n_bpoly_mod_pfrac(slong r, n_bpoly_struct * C, slong * C_deg1_bound, n_bpoly_t A, n_bpoly_struct * B, nmod_t mod)source
int n_bpoly_mod_hlift2(n_bpoly_t A, n_bpoly_t B0, n_bpoly_t B1, ulong alpha, slong degree_inner, nmod_t mod, n_poly_bpoly_stack_t St)source
int n_bpoly_mod_hlift2_cubic(n_bpoly_t A, n_bpoly_t B0, n_bpoly_t B1, ulong alpha, slong degree_inner, nmod_t ctx, nmod_eval_interp_t E, n_poly_bpoly_stack_t St)source
int n_bpoly_mod_hlift(slong r, n_bpoly_t A, n_bpoly_struct * B, ulong alpha, slong degree_inner, nmod_t mod, n_poly_bpoly_stack_t St)source
int n_bpoly_mod_hlift_cubic(slong r, n_bpoly_t A, n_bpoly_struct * B, ulong alpha, slong degree_inner, nmod_t mod, nmod_eval_interp_t E, n_poly_bpoly_stack_t St)source
int n_polyu3_mod_hlift(slong r, n_polyun_struct * BB, n_polyu_t A, n_polyu_struct * B, ulong beta, slong degree_inner, nmod_t ctx)source

Hensel lifting of a factorisation of a bivariate (or, for n_polyu3_mod_hlift, trivariate) polynomial A modulo y - \alpha to a factorisation modulo (y - \alpha)^{d} with d = degree_inner + 1, for two factors B0, B1 or r factors B; the cubic versions evaluate and interpolate in the other variable. n_bpoly_mod_pfrac solves the corresponding partial fraction equation. They return 1 for success and 0 if the lifted factors do not multiply to A.

Cite this page

The FLINT team, “n_bpoly_mod_pfrac, n_bpoly_mod_hlift2, n_bpoly_mod_hlift2_cubic, n_bpoly_mod_hlift, n_bpoly_mod_hlift_cubic, n_polyu3_mod_hlift (nmod_mpoly_factor.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/nmod_mpoly_factor/n_bpoly_mod_pfrac.html (generated 2026-10-20).