Explicit sumset sizes in additive number theory
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917384322809856 |
|---|---|
| author | Nathanson, Melvyn B. |
| author_facet | Nathanson, Melvyn B. |
| contents | 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 constructs certain infinite families of finite sets of size $k$ and computes their $h$-fold sumset sizes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_05329 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Explicit sumset sizes in additive number theory Nathanson, Melvyn B. Number Theory 11B75, 11B05, 11B13, 11B30, 11P70, 11Y16, 11Y55 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 constructs certain infinite families of finite sets of size $k$ and computes their $h$-fold sumset sizes. |
| title | Explicit sumset sizes in additive number theory |
| topic | Number Theory 11B75, 11B05, 11B13, 11B30, 11P70, 11Y16, 11Y55 |
| url | https://arxiv.org/abs/2505.05329 |