Robust additive bases without minimal subbases
Abstract
There exists a set $A$ of positive integers such that the number of representations of a large positive integer $m$ as a sum of two elements of $A$ grows with a lower bound of order $\log m$, but for which there is no subset $D$ of $A$ minimal for the property that $D+D$ contains all sufficiently large positive integers.
Fields of Study & Subjects
Analytic Number Theory Research
Limits and Structures in Graph Theory
Advanced Combinatorial Mathematics
Publication details
- Journal / source
- arXiv (Cornell University)
- Publication date
- 26 January 2026
- Document type
- Preprint