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.
On subsets of lattice cubes avoiding affine and spherical degeneracies.arXiv preprint arXiv:2509.06935, 2025
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
A random construction produces a no-three-collinear set in Z squared with Omega(n over square root of log n) points inside [n] squared, improving the prior lower bound by a square root of log n factor.
AlphaEvolve rediscovered best-known solutions for most of 67 tested math problems and found improved solutions in several cases using LLM-guided evolutionary search.
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.
-
A note on the extensible no-three-in-line problem
A random construction produces a no-three-collinear set in Z squared with Omega(n over square root of log n) points inside [n] squared, improving the prior lower bound by a square root of log n factor.
-
Mathematical exploration and discovery at scale
AlphaEvolve rediscovered best-known solutions for most of 67 tested math problems and found improved solutions in several cases using LLM-guided evolutionary search.