An upper bound on the multiplicative energy

MaRDI QIDQ6209820zbMATH OpenFDO

Authors József Solymosi

Publication date 5 June 2008

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Other combinatorial number theory (11B75)

Abstract: 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).$

This page was built for publication: An upper bound on the multiplicative energy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6209820)