Search arXivSearch

arXiv · 2609.19649

Simultaneous nonvanishing of quadratic twists via Rankin-Cohen brackets

Abstract

Let $D$ be an odd fundamental discriminant, with $D=1$ permitted, and let $r\geq 1$ be fixed. We prove that, for every sufficiently large integer $\ell$ satisfying $(-1)^\ell D>0$, the first $r$ traced diagonal Rankin--Cohen brackets \[ \mathrm{Tr}_1^{|D|}[G_{\ell-2e,D},G_{\ell-2e,D}]_{2e}, \qquad 1\leq e\leq r, \] are linearly independent in $S_{2\ell}(SL_2(\mathbb Z))$. Here $G_{k,D}$ is the Eisenstein series of weight $k$, level $|D|$, and nebentypus $χ_D$. The Petersson formula of Kayath, Lane, Neifeld, Ni, and Xue then implies that at least $r$ normalized Hecke eigenforms $f\in S_{2\ell}(SL_2(\mathbb Z))$ satisfy $L(f\otimesχ_D,\ell)\neq 0$. For $D=1$, this gives, for every fixed $r$ and every sufficiently large $K\equiv 0\pmod 4$, at least $r$ level-one eigenforms of weight $K$ with nonzero central value.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ramin Takloo-Bighash. 2026-09-17. Simultaneous nonvanishing of quadratic twists via Rankin-Cohen brackets. https://arxiv.org/abs/2609.19649

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