Search arXivSearch

arXiv · 1705.06088

Some evaluation of cubic Euler sums

Abstract

P. Flajolet and B. Salvy \cite{FS1998} prove the famous theorem that a nonlinear Euler sum $S_{i_1i_2\cdots i_r,q}$ reduces to a combination of sums of lower orders whenever the weight $i_1+i_2+\cdots+i_r+q$ and the order $r$ are of the same parity. In this article, we develop an approach to evaluate the cubic sums $S_{1^2m,p}$ and $S_{1l_1l_2,l_3}$. By using the approach, we establish some relations involving cubic, quadratic and linear Euler sums. Specially, we prove the cubic sums $S_{1^2m,m}$ and $S_{1(2l+1)^2,2l+1}$ are reducible to zeta values, quadratic and linear sums. Moreover, we prove that the two combined sums involving multiple zeta values of depth four \[\sum\limits_{\left\{ {i,j} \right\} \in \left\{ {1,2} \right\},i \ne j} {ζ\left( {{m_i},{m_j},1,1} \right)}\quad {\rm and}\quad \sum\limits_{\left\{ {i,j,k} \right\} \in \left\{ {1,2,3} \right\},i \ne j \ne k} {ζ\left( {{m_i},{m_j},{m_k},1} \right)} \] can be expressed in terms of multiple zeta values of depth $\leq 3$, here $2\leq m_1,m_2,m_3\in \N$. Finally, we evaluate the alternating cubic Euler sums ${S_{{{\bar 1}^3},2r + 1}}$ and show that it are reducible to alternating quadratic and linear Euler sums. The approach is based on Tornheim type series computations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ce Xu. 2017-10-19. Some evaluation of cubic Euler sums. https://arxiv.org/abs/1705.06088

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