arXiv (All)
open access
Explicit sumset sizes in additive number theory
It is an open problem in additive number theory to compute and understand the full range of sumset sizes of finite sets of integers, that is, the set $\mathcal{R}_{\mathbf{Z}}(h,k)= \{|hA|:A \subseteq {\mathbf{Z}} \text{ and } |A|=k\}$ for all integers $h \geq 3$ and $k \geq 3$. This paper construct
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
- Sidon sets with $Δ$-separated sumsets in additive number theory#800128
- Sumsets of Ahlfors--David regular sets#1013896
- On (n,k)-Simple Random Integer Lattices.#315711
- A Uniform Product-Difference Theorem for Dense Subsets of $\mathbb Z^2$#974871
- An Explicit Ramsey Bound for de Polignac Numbers#612726
Record · ID 1061601
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