Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2007.07800

Mean value of real characters using a double Dirichlet series

Martin Čech
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the double character sum $\sum\limits_{\substack{m\leq X,\\m\odd}}\sum\limits_{\substack{n\leq Y,\\n\odd}}\leg mn$ and its smoothly weighted counterpart. An asymptotic formula with power saving error term was obtained by Conrey, Farmer and Soundararajan by applying the Poisson summation formula. The result is interesting, because the main term involves a non-smooth function. In this paper, we apply the inverse Mellin transform twice and study the resulting double integral that involves a double Dirichlet series. This method has two advantages -- it leads to a better error term, and the surprising main term naturally arises from three residues of the double Dirichlet series.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Martin Čech. 2021-01-18. Mean value of real characters using a double Dirichlet series. https://arxiv.org/abs/2007.07800

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗