acb_theta_ql_lower_dim
Synopsis
#include <flint/acb_theta.h>int acb_theta_ql_lower_dim(acb_ptr * new_zs, acb_ptr * cofactors, slong ** pts, slong * nb, arf_t err, slong * fullprec, acb_srcptr z, const acb_mat_t tau, arb_srcptr distances, slong s, ulong a, slong prec)sourceImplements the dimension-lowering step: writes the normalised theta values whose last bits of equal a as short linear combinations of theta values in dimension (). The pair should be exact (and ideally reduced), and distances its output of acb_theta_eld_distances.
The outputs are:
fullprec: the precision at which the theta values in dimension must be computed,precplus guard bits from the largest relevant distance;err: the tail bound ofacb_theta_sum_radiusat precisionfullprecfor a squared radius (the ellipsoid itself is not computed);pts,nb: writing and with , , the possible lie in an ellipsoid of squared radius in dimension whose Cholesky matrix is the lower right block of that of ; its points are listed inpts(allocated by the function) and their number innb;new_zs,cofactors: writing and , the terms of the series with a given sum to ;new_zs(allocated) receives thenbvectors (still exact) andcofactors(allocated) the exponential factors.
The caller frees new_zs, cofactors and pts. The return value is 0 if the computation fails (for instance if the ellipsoid cannot be computed), and 1 otherwise.
Cite this page
The FLINT team, “acb_theta_ql_lower_dim (acb_theta.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/acb_theta/acb_theta_ql_lower_dim.html (generated 2026-11-02).
@misc{flint-doc-acb-theta-acb-theta-ql-lower-dim,
author = {{The FLINT team}},
title = {{acb\_theta\_ql\_lower\_dim (acb\_theta.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/acb_theta/acb_theta_ql_lower_dim.html},
note = {Generated 2026-11-02}
}