On Squares in Sumsets
<-- Return to the list
Date: 04-07-2009
Start Time:
5:30pm
End Time: 6:30pm
Speaker: Hoi H. Nguyen, Rutgers University
Location: 507 Math
ABSTRACT
A finite set $A$ of integers is square-sum-free if no subset of $A$ sums up to a square. In 1986, Erd\"{o}s posed the problem of determining the largest cardinality of a square-sum-free subset of $\{1,...,n\}$. In this talk, we shall try to answer this question, showing that this maximum cardinality is of order $n^{{\frac{1}{3}}+o(1)}$.