Search arXivSearch

arXiv · 1808.02311

Nonvanishing modulo $\ell$ of Fourier coefficients of Jacobi forms

Abstract

Let $ϕ= \sum_{r^{2} \leq 4mn}c(n,r)q^{n}ζ^{r}$ be a Jacobi form of weight $k$ (with $k > 2$ if $ϕ$ is not a cusp form) and index $m$ with integral algebraic coefficients which is an eigenfunction of all Hecke operators $T_{p}, (p,m) = 1,$ and which has at least one nonvanishing coefficient $c(n,r)$ with $r$ prime to $m$. We prove that for almost all primes $\ell$ there are infinitely many fundamental discriminants $D = r^{2}-4mn < 0$ prime to $m$ with $ν_{\ell}(c(n,r)) = 0$, where $ν_{\ell}$ denotes a continuation of the $\ell$-adic valuation on $\mathbb{Q}$ to an algebraic closure. As applications we show indivisibility results for special values of Dirichlet $L$-series and for the central critical values of twisted $L$-functions of even weight newforms.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Markus Schwagenscheidt. 2018-08-07. Nonvanishing modulo $\ell$ of Fourier coefficients of Jacobi forms. https://doi.org/10.1007/s40993-015-0035-1

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