arXiv (All)
open access
Sumsets of Ahlfors--David regular sets
We prove that there is an absolute constant $c>0$ such that for every finite $(α,M)$-Ahlfors--David regular set $A\subseteq[N]$ with $0\leqα<1$ and $M\geq2$, we have the sumset estimate \[|A+A|\geq |A|^{1+c(1-α)/\log M}.\] We also prove a corresponding statement for Ahlfors--David regular sets in $[
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
- An Explicit Ramsey Bound for de Polignac Numbers#612726
- An Explicit Ramsey Bound for de Polignac Numbers#611249
- Full-radius dimension-free maximal inequalities for discrete Euclidean balls#1070936
- A solution to the Erdős Problem #1040#973660
- An extension of the Erdős-Tetali theorem#997872
Record · ID 1013896
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