We prove that the size of the product set of any finite arithmetic progression A in integers of size N is at least N2/(log N)c+o(1), where c=1-(1+log log 2)/(log 2). This matches the bound in the celebrated Erdos multiplication table problem, up to a factor of (log N)o(1) and thus confirms a conjecture of Elekes and Ruzsa. If instead A is relaxed to be a subset of a finite arithmetic progression in integers with positive constant density, we prove that the size of the product set is at least N2/(log N)2log 2-1 + o(1). This solves the typical case of another conjecture of Elekes and Ruzsa on the size of the product set of a set A whose sum set is of size O(|A|).This is joint work with Yunkun Zhou.
This video is part of the Webinar in Additive Combinatorics series, and this is
their YouTube channel.
