Euler sums in terms of generalized polylogarithm values
Euler sums in terms of generalized polylogarithm values
Let be a positive integer. An alternating multiple zeta value is a value of the alternating multiple zeta function of weight . For a vector , write for its weight, and let , denote the generalized polylogarithms used in the paper. Also write for the alternating multiple zeta function with signs . Euler-sums conjecture. Any value of the alternating multiple zeta function of weight is a rational linear combination of numbers of any one of the following forms: , , , , with , or with arbitrary for . This conjecture proposes that alternating multiple zeta values can be expressed through any one of several families of generalized polylogarithm values of the same weight.
Sources & referencesView supporting material
Primary source
S. A. Zlobin, “Special Values of Generalized Polylogarithms”, arXiv:0712.1656 (2007).
Progress summary
Zlobin’s conjecture remains unproved in general, with only low-length proofs and numerical checks through weight .
S. A. Zlobin formulated the Euler-sums conjecture in 2007: every alternating multiple zeta value of weight should be expressible using any one of five specified families of generalized polylogarithm or alternating zeta values. The paper proves equivalence among the five formulations but does not claim a proof in all weights.
Known results
- Alternating multiple zeta values of length at most : proved by Zlobin (2007).
- The conjecture was checked computationally through weight using high-precision evaluation and PSLQ (Zlobin, 2007).
- Related basis conjectures for generalized polylogarithm values were numerically checked through weight (Zlobin, 2007).
Current status (as of August 2026): the conjecture is open beyond the proved length- cases and the reported computational checks, with no publicly retrieved proof, counterexample, or subsequent verification.
Sources
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.