arXiv (All)
open access
An Improved Upper Bound for Finite Sidon Sets via Vector-Valued Smoothing
Let $F(N)$ denote the largest cardinality of a Sidon subset of $\{0,1,\ldots,N-1\}$. We prove \[ F(N)\le N^{1/2}+γ_0N^{1/4}+O(1), \qquad γ_0=0.94349\ldots<0.9435. \] This improves the previously published coefficient $0.98183$. Our argument develops a vector-valued smoothing method that combines sev
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
- A New Approach to Code Smoothing Bounds#927259
- A sharp norm inequality for entanglement-breaking channels#1064450
- Sharp Poincaré interpolation along Wasserstein geodesics#820548
- Sharp Operator Khintchine inequality and $Z_2$ Property#1013402
- Smooth-Number Matchings and an Upper Bound#454409
Record · ID 927368
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