Search arXivSearch

arXiv · 1609.05863

Multiple zeta values and Euler sums

Abstract

In this paper, we establish some expressions of series involving harmonic numbers and Stirling numbers of the first kind in terms of multiple zeta values, and present some new relationships between multiple zeta values and multiple zeta star values. The relationships obtained allow us to find some nice closed form representations of nonlinear Euler sums through Riemann zeta values and linear sums. Furthermore, we show that the combined sums \[H\left( {a,b;m,p} \right) := \sum\limits_{a + b = m - 1} {ζ\left( {{\left\{ p \right\}_a},p + 1,{\left\{ p \right\}_b}} \right)}\quad (m\in \N,p>1) \] and \[{H^ \star }\left( {a,b;m,p} \right) := \sum\limits_{a + b = m - 1} {{ζ^ \star }\left( {{\left\{ p \right\}_a},p + 1,{\left\{ p \right\}_b}} \right)}\quad (m\in \N,p>1) \] are reducible to polynomials in zeta values, and give explicit recurrence formulas. Some interesting (known or new) consequences and illustrative examples are considered.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ce Xu. 2017-04-09. Multiple zeta values and Euler sums. https://doi.org/10.1016/j.jnt.2017.01.018

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT