Search arXivSearch

arXiv · 1903.05811

Signs of Fourier coefficients of half-integral weight modular forms

Abstract

Let $g$ be a Hecke cusp form of half-integral weight, level $4$ and belonging to Kohnen's plus subspace. Let $c(n)$ denote the $n$th Fourier coefficient of $g$, normalized so that $c(n)$ is real for all $n \geq 1$. A theorem of Waldspurger determines the magnitude of $c(n)$ at fundamental discriminants $n$ by establishing that the square of $c(n)$ is proportional to the central value of a certain $L$-function. The signs of the sequence $c(n)$ however remain mysterious. Conditionally on the Generalized Riemann Hypothesis, we show that $c(n) < 0$ and respectively $c(n) > 0$ holds for a positive proportion of fundamental discriminants $n$. Moreover we show that the sequence $\{c(n)\}$ where $n$ ranges over fundamental discriminants changes sign a positive proportion of the time. Unconditionally, it is not known that a positive proportion of these coefficients are non-zero and we prove results about the sign of $c(n)$ which are of the same quality as the best known non-vanishing results. Finally we discuss extensions of our result to general half-integral weight forms $g$ of level $4 N$ with $N$ odd, square-free.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Stephen Lester, Maksym Radziwiłł. 2019-03-14. Signs of Fourier coefficients of half-integral weight modular forms. https://arxiv.org/abs/1903.05811

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