Counting sets with given doubling via dimension

Marcelo Campos, Gabriel Dahia, João Pedro Marciano

Source record

Source: arXiv

Published: Sep 4, 2026

arXiv: 2609.05384

Open original source ↗

Source abstract

We determine, up to a factor of $2^{o(k)}$ , the number of $k$ -sets $A \subset \{1, \ldots, n\}$ such that $|A + A| \leq m$ , where $k = Θ(\log n)$ and $m \leq k^{1 + α}$ , for small $α> 0$ , answering a question of Green and Morris.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.