Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2605.05498 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914536714403840 |
|---|---|
| author | Carpenter, Ruben Defant, Colin Kravitz, Noah |
| author_facet | Carpenter, Ruben Defant, Colin Kravitz, Noah |
| contents | It is a classical fact that every $n$-element set of positive reals has at least $\binom{n+1}{2}+1$ distinct subset sums, with equality exactly for homogeneous arithmetic progressions (when $n\geq 4$). We establish stability versions of this inverse theorem in two regimes. First, for any parameter $M \leq n-4$, we precisely characterize the $n$-element sets of positive reals with at most $\binom{n+1}{2}+1+M$ subset sums. Second, for any constant $C$, we provide a characterization, sharp up to constants, of the $n$-element sets of positive reals with at most $Cn^2$ distinct subset sums. Along the way, we constrain (for any fixed $d \geq 2$) the structure of $n$-element subsets of $\mathbb{R}^d$ with $o(n^{d+1})$ subset sums. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_05498 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Sets with Few Subset Sums Carpenter, Ruben Defant, Colin Kravitz, Noah Combinatorics It is a classical fact that every $n$-element set of positive reals has at least $\binom{n+1}{2}+1$ distinct subset sums, with equality exactly for homogeneous arithmetic progressions (when $n\geq 4$). We establish stability versions of this inverse theorem in two regimes. First, for any parameter $M \leq n-4$, we precisely characterize the $n$-element sets of positive reals with at most $\binom{n+1}{2}+1+M$ subset sums. Second, for any constant $C$, we provide a characterization, sharp up to constants, of the $n$-element sets of positive reals with at most $Cn^2$ distinct subset sums. Along the way, we constrain (for any fixed $d \geq 2$) the structure of $n$-element subsets of $\mathbb{R}^d$ with $o(n^{d+1})$ subset sums. |
| title | Sets with Few Subset Sums |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2605.05498 |