REVIEW 3 cited by
A note on iterated sumsets races
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
This short note answers a question raised by Nathanson \cite{Nath25} about "races" between iterated sumsets. We prove that for any integer $n$, there are finite sets of integers $A$ and $B$ with same diameter such that the signs of the elements of the sequence $(|hA|-|hB|)_h$ changes at least $n$ times. Kravitz proved in \cite{Kravitz} a much better result. This brief and modest note may serve as a stepping stone towards his work.
Forward citations
Cited by 3 Pith papers
-
Finer control on relative sizes of iterated sumsets
For any infinite abelian group G and any integers m_1,...,m_H, finite sets A,B exist such that |hA| - |hB| = m_h for every h.
-
Additive sumset sizes with tetrahedral differences
For each h and i0 from 0 to h-1, the set {0,1,h+1,(h+1-i0)(h+1)} has h-fold sumset size binomial(h+3,3) minus binomial(i0+2,3).
-
Triangular and tetrahedral number differences of sumset sizes in additive number theory
For 4-element sets of integers, the most popular h-fold sumset sizes appear to equal C(h+3,3) minus the first h tetrahedral numbers, but only computer experiments are given.
Discussion (0). Continue with ORCID to comment.