Search arXivSearch

arXiv · 2003.09026

Almost all primes satisfy the Atkin-Serre conjecture and are not extremal

Abstract

Let $f(z)=\sum_{n=1}^{\infty} a_f(n)e^{2πi n z}$ be a non-CM holomorphic cupsidal newform of trivial nebentypus and even integral level $k\geq 2$. Deligne's proof of the Weil conjectures shows that $|a_f(p)|\leq 2p^{\frac{k-1}{2}}$ for all primes $p$. We prove for 100% of primes $p$ that $2p^{\frac{k-1}{2}}\frac{\log\log p}{\sqrt{\log p}}<|a_f(p)|<\lfloor 2p^{\frac{k-1}{2}}\rfloor$. Our proof gives an effective upper bound for the size of the exceptional set. The lower bound shows that the Atkin-Serre conjecture is satisfied for 100% of primes, and the upper bound shows that $|a_f(p)|$ is as large as possible (i.e., $p$ is extremal for $f$) for 0% of primes. Our proofs use the effective form of the Sato-Tate conjecture proved by the second author, which relies on the recent proof of the automorphy of the symmetric powers of $f$ due to Newton and Thorne.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ayla Gafni, Jesse Thorner, Peng-Jie Wong. 2021-03-25. Almost all primes satisfy the Atkin-Serre conjecture and are not extremal. https://doi.org/10.1007/s40993-021-00258-w

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