FLINT3.7.0-dev

acb_mzeta_mzv

Synopsis#include <flint/acb_mzeta.h>
void acb_mzeta_mzv(arb_t res, const ulong * s, slong r, slong prec)source

Sets res to the multiple zeta value

ζ(s1,…,sr)=∑n1>n2>⋯>nr≥11n1s1⋯nrsr,\zeta(s_1, \ldots, s_r) = \sum_{n_1 > n_2 > \cdots > n_r \ge 1} \frac{1}{n_1^{s_1} \cdots n_r^{s_r}},

with the convention of PARI/GP's zetamult (the first index belongs to the largest summation variable; s1≥2s_1 \ge 2 for convergence, otherwise the result is indeterminate). The empty index gives 1, depth 1 uses arb_zeta_ui.

For depth r≥2r \ge 2 the value is computed from the iterated integral representation by Akhilesh's double tails [Akh2017], a recursion over the subwords of the index in fixed-point arithmetic, with cost O(k2P2)O(k^2 P^2) for weight kk and PP bits; from 25000 bits it is instead reduced by Hölder convolution [BBBL2001] to multiple polylogarithms at 12\tfrac12, evaluated by binary splitting in quasi-linear time. See Double tails and Hölder convolution.

References#

  • [Akh2017] P. Akhilesh, "Double tails of multiple zeta values", Journal of Number Theory 170 (2017), 228-249, https://arxiv.org/abs/2105.12156
  • [BBBL2001] J. M. Borwein, D. M. Bradley, D. J. Broadhurst and P. Lisoněk, "Special values of multiple polylogarithms", Transactions of the American Mathematical Society 353 (2001), 907-941, https://arxiv.org/abs/math/9910045
Cite this page

The FLINT team, “acb_mzeta_mzv (acb_mzeta.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/acb_mzeta/acb_mzeta_mzv.html (generated 2026-11-07).