Skip to content
Preprint

Optimal large sieve for fixed order characters

Oct 2026 · 2 citations · ⚡ 2 influential · 31 references
Mathematics

Abstract

Let $n \geq 3$. We improve the large sieve inequality for $n$-th order Hecke characters over any number field containing the $n$-th roots of unity. Our bound is expected to be optimal in all ranges of parameters. Several applications are deduced, including a tight upper bound for the second moment of cubic characters ordered by conductor, asymptotics with lower order terms for the cubic second moment over squarefree moduli, and improved moment and zero density estimates for every $n \geq 3$.

View source

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.