REVIEW
On an inverse problem for restricted sumsets
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
On an inverse problem for restricted sumsets
classification
math.NT
math.CO
keywords
restrictedtextattainedboundcdotsdeterminefracinteger
read the original abstract
Let $n$ be a positive integer, and let $A$ be a set of $k\ge 2n-1$ integers. For the restricted sumset $$ S_n(A)=\{a_1+\cdots +a_n:\ a_1,\ldots,a_n\in A,\ \text{and}\ a_i^2\neq a_j^2\ \text{for} \ 1\le i<j\le n\}, $$ by a 2002 result of Liu and Sun we have $$|S_n(A)|\ge (k-1)n-\frac 32n(n-1)+1.$$ In this paper, we determine the structure of $A$ when the lower bound is attained.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.