Search arXivSearch

arXiv · 1602.05745

On the gaps between non-zero Fourier coefficients of cusp forms of higher weight

Abstract

We show that if a modular cuspidal eigenform $f$ of weight $2k$ is $2$-adically close to an elliptic curve $E/\mathbb{Q}$, which has a cyclic rational $4$-isogeny, then $n$-th Fourier coefficient of $f$ is non-zero in the short interval $(X, X + cX^{\frac{1}{4}})$ for all $X \gg 0$ and for some $c > 0$. We use this fact to produce non-CM cuspidal eigenforms $f$ of level $N>1$ and weight $k > 2$ such that $i_f(n) \ll n^{\frac{1}{4}}$ for all $n \gg 0$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Narasimha Kumar. 2016-12-26. On the gaps between non-zero Fourier coefficients of cusp forms of higher weight. https://doi.org/10.1007/s11139-016-9837-6

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