Arithmetical structure of sumset intersections
Abstract
The h-fold sumset of a set A of integers is the set of all sums of h not necessarily distinct elements of A. Let (Aq)q=1∞ be a strictly decreasing sequence of sets of integers and let A = q=1∞ Aq. Then hA ⊂eq q=1∞ hAq for all h ≥ 1. Let H(Aq) = \h ≥ 1: hA = q=1∞ hAq\. The arithmetical structure of the sets H(Aq) is unknown. It is proved that for every h0 ≥ 2 there exist sequences (Aq)q=1∞ such that \1,…, h0-1\ ⊂eq H(Aq) but h0 H(Aq) and also that there exist sequences (Aq)q=1∞ such that \1, h0 \ ⊂eq H(Aq) but \2,3, …, h0-1\ H(Aq) = .
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.