Search arXivSearch

arXiv · 1411.5871

Differentiability of arithmetic Fourier series arising from Eisenstein series

Abstract

Let $k$ be even. We consider two series $F_k(x)= \sum_{n=1}^\infty \frac{σ_{k-1}(n)}{n^{k+1}} \sin(2πn x)$ and $G_k(x)= \sum_{n=1}^\infty \frac{σ_{k-1}(n)}{n^{k+1}} \cos(2πn x)$, where $σ_{k-1}$ is the divisor function. They converge on $\mathbb{R}$ to continuous functions. In this paper, we examine the differentiability of $F_k$ and $G_k$. These functions are related to Eisenstein series and their (quasi-)modular properties allow us to apply the method proposed by Itatsu in 1981 in the study of the Riemann series. We focus on the case $k=2$ and we show that the sine series exhibits different behaviour with respect to differentiability than the cosine series. We prove that the differentiability of $F_2$ at an irrational $x$ is related to the fine diophantine properties of $x$. We estimate the modulus of continuity of $F_2$. We formulate a conjecture concerning differentiability of $F_k$ and $G_k$ for any $k$ even.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Izabela Petrykiewicz. 2014-11-21. Differentiability of arithmetic Fourier series arising from Eisenstein series. https://doi.org/10.1007/s11139-015-9748-y

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