Search arXivSearch

arXiv · 2603.06997

Quadratic Congruences for half-integral weight cusp forms with the eta multiplier

Abstract

Let $\ell \geq 5$ be a prime, and let $ν_η$ denote the Dedekind eta multiplier. For an odd integer $r$, and a real Dirichlet character $ψ$, recent work of Ahlgren, Andersen, and the author showed that quadratic congruences modulo $\ell$ hold for a wide range of half-integral weight cusp forms with multiplier $ψν_η^r$, vastly generalizing certain congruences discovered by Atkin for the partition function. In this paper, we show that such congruences hold when $ψ$ is an arbitrary character. Our methods rely on the theory of modular Galois representations. For primes $\ell \geq 5$, the core of our work is the study of modular Galois representations modulo $\ell$ attached to integer-weight eigenforms with arbitrary Nebentypus whose images are large in a precise sense. Our key new result is that, given a finite set of such representations and $γ\in \SL_2(\F_\ell)$, there exists $σ\in \Gal(\bar{\Q}/\Q(ζ_\ell))$ whose images under the representations are in the conjugacy class of $γ^2$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Robert Dicks. 2026-03-07. Quadratic Congruences for half-integral weight cusp forms with the eta multiplier. https://arxiv.org/abs/2603.06997

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