Nathanson’s Problem 1 and related Kravitz problems on dilate sums
Let and be finite multisets of nonzero integers. For a finite set , define . Say that -dominates , for , if there are pairwise disjoint submultisets of such that for every . Determine whether, for all such , the following are equivalent: there exists such that -dominates ; and for every finite set (equivalently, if no such exists, there is a finite with ).
References
- The Dilate Rollercoaster — arXiv — Luke Pebody
Source: arXiv
Progress summary
A new unrefereed paper claims substantial progress on comparing sizes of sums of dilated sets and says it resolves several named subproblems, but the claims have not been independently assessed.
The problem concerns when cardinalities of generalized sums of dilated sets can be compared, including questions posed by Nathanson and Kravitz. The latest paper claims a broad converse construction and resolutions of several previously named questions.
October 2026 multi-set converse
Luke Pebody’s preprint The Dilate Rollercoaster claims a converse to the dilate-domination principle for several inequalities and sets under a non-domination condition. It reports resolving Nathanson’s Problem 1 and related Kravitz problems, but the retrieved evidence provides no independent mathematical assessment.
Current status (as of November 2026): The preprint claims progress and resolutions of several named subproblems, while the broader problem entry remains unverified.
Sources
Solutions 0
No solutions have been posted yet.