arXiv (All)
open access
Optimal large sieve for fixed order characters
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 o
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The weighted large sieve through Parseval#1061512
- A new upper bound for the irrationality exponent of $ζ(2)$#1187590
- Some Bounds on the Lehmer Index#1344766
- Horizontal moments of Kloosterman sums and a density version of sieves#1248010
- Omega bound for the Piltz divisor problem#1118893
Record · ID 1199319
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive