arXiv (All)
open access
A converse to the Erdős-Fuchs theorem
We prove that there exists $A\subseteq \mathbb{N}$ such that \[ R_A(N)=\fracπ{4}N+ O\!\left(N^{1/4}\sqrt{\log N}\right), \] where $R_A(N)=\#\{(a,b)\in A^2:a+b\le N\}$. This improves the record $O(N^{1/4}\log N)$ obtained by Ruzsa in 1997.
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
- Square root cancellation in the hyperbolic lattice counting problem over cocompact groups#1118902
- An extension of the Erdős-Tetali theorem#997872
- Asymptotic counting of integers with prime factors $p_{r^a s^b}$#1014028
- A lattice family with kissing numbers $τ(\mathcal{L}_n) \ge e^{2 \sqrt{n}}$#1156454
- The large sieve for square moduli under Hooley's hypothesis $R^*$#1035161
Record · ID 1064217
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