OpenAlex ·
Optimal large sieve for fixed order characters
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2610.04045
- Original
- Read it at the publisher
- Topics
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$.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Combinatorics
Get the few papers worth your time in Combinatorics every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.