arXiv (All)
open access
The large sieve through Parseval, Large sifted sets are regular
We modify the approach to the arithmetical form of the large sieve by relying on the Parseval identity rather than on an approximate Bessel inequality and as a consequence, we prove that sifted sets are either small or the attached Fourier polynomial is very regular at the origin. We also discuss th
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
- Trace-defect bounds for discrete Fourier concentration operators#1000189
- A note on large clusters of $E_2$-numbers#1130129
- Stein quotients via Patterson-Sullivan theory and the Shafarevich conjecture#482481
- An extension of the Erdős-Tetali theorem#997872
Record · ID 1061506
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