Stability versions of the inverse theorem for subset sums are proved: n-element positive real sets with at most binom(n+1,2)+1+M subset sums are characterized for M up to n-4, and sets with O(n^2) subset sums are characterized up to constants.
arXiv preprint arXiv:2510.17743 , year=
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Introduces the extensible no-(k(n)+1)-in-line problem on infinite grids, constructs optimal sets for linear k(n) and positive-density sets for power k(n), proves any high-density configuration requires k(n) growing polynomially, and reduces the constant-k case to regular functions.
citing papers explorer
-
Sets with Few Subset Sums
Stability versions of the inverse theorem for subset sums are proved: n-element positive real sets with at most binom(n+1,2)+1+M subset sums are characterized for M up to n-4, and sets with O(n^2) subset sums are characterized up to constants.
-
The extensible no-$(k(n)+1)$-in-line problem
Introduces the extensible no-(k(n)+1)-in-line problem on infinite grids, constructs optimal sets for linear k(n) and positive-density sets for power k(n), proves any high-density configuration requires k(n) growing polynomially, and reduces the constant-k case to regular functions.