FLINT3.7.0-dev

acb_hypgeom_pfq_series_sum_forward, acb_hypgeom_pfq_series_sum_bs, acb_hypgeom_pfq_series_sum_rs, acb_hypgeom_pfq_series_sum

Synopsis#include <flint/acb_hypgeom.h>
void acb_hypgeom_pfq_series_sum_forward(acb_poly_t s, acb_poly_t t, const acb_poly_struct * a, slong p, const acb_poly_struct * b, slong q, const acb_poly_t z, int regularized, slong n, slong len, slong prec)source
void acb_hypgeom_pfq_series_sum_bs(acb_poly_t s, acb_poly_t t, const acb_poly_struct * a, slong p, const acb_poly_struct * b, slong q, const acb_poly_t z, int regularized, slong n, slong len, slong prec)source
void acb_hypgeom_pfq_series_sum_rs(acb_poly_t s, acb_poly_t t, const acb_poly_struct * a, slong p, const acb_poly_struct * b, slong q, const acb_poly_t z, int regularized, slong n, slong len, slong prec)source
void acb_hypgeom_pfq_series_sum(acb_poly_t s, acb_poly_t t, const acb_poly_struct * a, slong p, const acb_poly_struct * b, slong q, const acb_poly_t z, int regularized, slong n, slong len, slong prec)source

Sets s = \sum_{k=0}^{n-1} T(k) and t = T(n) for parameters and argument that are power series, with all arithmetic truncated to length len. Requires n \ge 0 and \mathit{len} \ge 1. The outputs must not alias the inputs.

If regularized is set, the terms are those of the regularized series, divided by \prod_i \Gamma(b_i), computed so that a lower parameter whose constant term is a nonpositive integer causes no division by zero. The forward, bs and rs versions use the forward recurrence, binary splitting and rectangular splitting, and the default version chooses automatically.

Cite this page

The FLINT team, “acb_hypgeom_pfq_series_sum_forward, acb_hypgeom_pfq_series_sum_bs, acb_hypgeom_pfq_series_sum_rs, acb_hypgeom_pfq_series_sum (acb_hypgeom.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/acb_hypgeom/acb_hypgeom_pfq_series_sum_forward.html (generated 2026-10-20).