Accessible Requires Authentication Published by De Gruyter November 5, 2010

Sums and Products of Distinct Sets and Distinct Elements in ℂ

Karsten Chipeniuk
From the journal


Let A and B be finite subsets of ℂ such that |B| = C|A|. We show the following variant of the sum product phenomenon: If |AB| < α|A| and α ≪ log |A|, then |k A + l B| ≫ |A|k|B|l. This is an application of a result of Evertse, Schlickewei, and Schmidt on linear equations with variables taking values in multiplicative groups of finite rank, in combination with an earlier theorem of Ruzsa about sumsets in . As an application of the case A = B we give a lower bound on |A+|+|A×|, where A+ is the set of sums of distinct elements of A and A× is the set of products of distinct elements of A.

Received: 2009-03-11
Revised: 2010-01-05
Accepted: 2010-07-01
Published Online: 2010-11-05
Published in Print: 2010-November

© de Gruyter 2010