Problems in additive number theory, VII: The structure of additive $h$-bases for $n$
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866911724319277056 |
|---|---|
| author | Nathanson, Melvyn B. |
| author_facet | Nathanson, Melvyn B. |
| contents | In additive number theory, a finite set $A$ of integers is an $h$-basis for $n$ if every integer in $\{0,1,2,\ldots, n\}$ can be represented as the sum of exactly $h$ not necessarily distinct elements of $A$. This paper introduces a new class of problems for these and related additive bases. The problems are designed, in part, to be susceptible to solution by AI. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_26425 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Problems in additive number theory, VII: The structure of additive $h$-bases for $n$ Nathanson, Melvyn B. Number Theory Combinatorics 11B13, 11B05, 11B30, 11B75, 11P70, 11Y55 In additive number theory, a finite set $A$ of integers is an $h$-basis for $n$ if every integer in $\{0,1,2,\ldots, n\}$ can be represented as the sum of exactly $h$ not necessarily distinct elements of $A$. This paper introduces a new class of problems for these and related additive bases. The problems are designed, in part, to be susceptible to solution by AI. |
| title | Problems in additive number theory, VII: The structure of additive $h$-bases for $n$ |
| topic | Number Theory Combinatorics 11B13, 11B05, 11B30, 11B75, 11P70, 11Y55 |
| url | https://arxiv.org/abs/2605.26425 |