_acb_poly_rising_ui_series, acb_poly_rising_ui_series
Synopsis
#include <flint/acb_poly.h>void _acb_poly_rising_ui_series(acb_ptr res, acb_srcptr f, slong flen, ulong r, slong trunc, slong prec)sourcevoid acb_poly_rising_ui_series(acb_poly_t res, const acb_poly_t f, ulong r, slong trunc, slong prec)sourceSet res to the rising factorial f (f+1) \cdots (f+r-1) truncated to length trunc, by binary splitting. The underscore version requires flen, r and trunc to be positive and no aliasing.
Cite this page
The FLINT team, “_acb_poly_rising_ui_series, acb_poly_rising_ui_series (acb_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/acb_poly/_acb_poly_rising_ui_series.html (generated 2026-10-20).
@misc{flint-doc-acb-poly-acb-poly-rising-ui-series,
author = {{The FLINT team}},
title = {{\_acb\_poly\_rising\_ui\_series, acb\_poly\_rising\_ui\_series (acb\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/acb_poly/_acb_poly_rising_ui_series.html},
note = {Generated 2026-10-20}
}