Indexed metadata

Optimal large sieve for fixed order characters

Alexandre de Faveri

Source record

Source: arXiv

Published: Oct 2, 2026

arXiv: 2610.04045

Open original source ↗

Source abstract

Let n≥3n \geq 3. We improve the large sieve inequality for nn-th order Hecke characters over any number field containing the nn-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≥3n \geq 3.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.