Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1305.5443

On conjectures of Sato-Tate and Bruinier-Kohnen

Sara Arias-de-Reyna·Ilker Inam·Gabor Wiese
View original source ↗Read source document ↗Export metadata ↓

Abstract

This article covers three topics. (1) It establishes links between the density of certain subsets of the set of primes and related subsets of the set of natural numbers. (2) It extends previous results on a conjecture of Bruinier and Kohnen in three ways: the CM-case is included; under the assumption of the same error term as in previous work one obtains the result in terms of natural density instead of Dedekind-Dirichlet density; the latter type of density can already be achieved by an error term like in the prime number theorem. (3) It also provides a complete proof of Sato-Tate equidistribution for CM modular forms with an error term similar to that in the prime number theorem.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sara Arias-de-Reyna, Ilker Inam, Gabor Wiese. 2013-11-19. On conjectures of Sato-Tate and Bruinier-Kohnen. https://doi.org/10.1007/s11139-013-9547-2

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↗