arXiv (OAI Expanded)
open access
One Arithmetic Gadget, Two Problems
There is an absolute constant $c>0$ such that, for every $0<\varepsilon\leq1$, arbitrarily large finite sets $A\subset\mathbb{C}$ satisfy \[ |A+A|\leq |A|^{1+\varepsilon},\qquad |AA|\leq |A|^{2-c\varepsilon},\qquad ν_1(A)\geq |A|^{1+c\varepsilon}, \] where $ν_1(A)$ counts unordered unit-distan
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
- Quantum expanders and dimension-free commutator bounds#1033932
- Indefinite theta vectors and generalized Nahm sums of arbitrary rank#1155902
- The obstruction to intrinsic perturbation for $A$-hypergeometric series#1035591
- Quantum Change Interval: Exact Asymptotics for Minimum Error Localization#926189
- Density one for lattice point visibility along polynomials with at least two distinct roots#996959
Record · ID 1123814
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