arXiv (All)
open access
On a problem of Nathanson related to minimal asymptotic bases and maximal asymptotic nonbases
Let $\mathbb{N}_0=\{0,1,2,\ldots\}$ and let $h\ge2$ be an integer. For a set $A\subseteq\mathbb{N}_0$, write $hA$ for the set of all sums of $h$, not necessarily distinct, elements of $A$. In this paper, we prove that for every $h\ge2$, there is a partition $\mathbb{N}_0=A\sqcup B$ such that $A$ is
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
- On a problem of Nathanson related to strongly minimal asymptotic bases of order $h$#1143466
- On a problem of Erdős and Nathanson related to minimal asymptotic bases of order $h$#986036
- Strongly Pseudoperfect Numbers#1130910
- A Proof of Füredi's Conjecture#999431
- Deficit bounds and equality cases in the Tu--Deng problem#1122479
Record · ID 984288
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