Algorithms for some Euler-type identities for multiple zeta values (Q2375670): Difference between revisions

Summary: Multiple zeta values are the numbers defined by the convergent series \[ \zeta(s_1, s_2, \dots, s_k) = \sum_{n_1 > n_2 > \cdots > n_k > 0}\frac 1{n^{s_1}_1 n^{s_2}_2 \cdots n^{s_k}_k}, \] where \(s_1\), \(s_2\), \(\dots\), \(s_k\) are positive integers with \(s_1 > 1\). For \(k \leq n\), let \(E(2n, k)\) be the sum of all multiple zeta values with even arguments whose weight is \(2n\) and whose depth is \(k\). The well-known result \(E(2n, 2) = 3\zeta(2n)/4\) was extended to \(E(2n, 3)\) and \(E(2n, 4)\) by \textit{Z. Shen} and \textit{T. Cai} [J. Number Theory 132, No. 2, 314--323 (2012; Zbl 1229.11119)]. Applying the theory of symmetric functions, \textit{M. E. Hoffman}, Int. J. Number Theory 13, No. 3, 705--716 (2017; Zbl 1416.11132); \url{arxiv:1205.7051}] gave an explicit generating function for the numbers \(E(2n, k)\) and then gave a direct formula for \(E(2n, k)\) for arbitrary \(k \leq n\). In this paper we apply a technique introduced by \textit{A. Granville} [Lond. Math. Soc. Lect. Note Ser. 247, 95--101 (1997; Zbl 0907.11024)] to present an algorithm to calculate \(E(2n, k)\) and prove that the direct formula can also be deduced from Eisenstein's double product.