The sum-product problem for integers with few prime factors

arXiv2305.04038MaRDI QIDQ6435596FDOQ6435596

Authors: Brandon Hanson, Misha Rudnev, Ilya D. Shkredov, Dmitry Zhelezov 

Publication date: 6 May 2023

Abstract: It was asked by E. Szemer'edi if, for a finite set $AsubsetmathbbZ$, one can improve estimates for $max|A+A|,|AcdotA|$, under the constraint that all integers involved have a bounded number of prime factors -- that is, each $ainA$ satisfies $omega(a)leqk$. In this paper, answer Szemer'edi's question in the affirmative by showing that this maximum is of order $|A{|}^{frac53-o(1)}$ provided $kleq(log|A|{)}^{1-epsilon}$ for some $epsilon>0$. In fact, this will follow from an estimate for additive energy which is best possible up to factors of size $|A{|}^{o(1)}$.

This page was built for publication: The sum-product problem for integers with few prime factors

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