论文信息 - An upper bound on the multiplicative energy - 字舞流文

An upper bound on the multiplicative energy

We prove that the sumset or the productset of any finite set of real numbers, $A,$ is at least $|A|^{4/3-\epsilon},$ improving earlier bounds. Our main tool is a new upper bound on the multiplicative energy, $E(A,A).$

Jozsef Solymosi

[1] Noga Alon,et al. An Application of Graph Theory to Additive Number Theory , 1985, Eur. J. Comb..

[2] György Elekes,et al. On the number of sums and products , 1997 .

[3] Kevin Ford,et al. Sums and Products from a Finite Set of Real Numbers , 1998 .

[4] Mei-Chu Chang. The Erdős-Szemerédi problem on sum set and product set , 2003 .

[5] W. T. Gowers,et al. A New Proof of Szemerédi's Theorem for Arithmetic Progressions of Length Four , 1998 .

[6] Melvyn B. Nathanson,et al. On sums and products of integers , 1997 .

[7] Endre Szemerédi,et al. On sums and products of integers , 1983 .

[8] Terence Tao. Product set estimates for non-commutative groups , 2008, Comb..

[9] József Solymosi,et al. On the Number of Sums and Products , 2005 .

[10] Yong-Gao Chen,et al. On sums and products of integers , 1999 .