scientific article; zbMATH DE number 1315267
Let \(A\) be a finite set of integers, \( |A |=k\), such that the number of sums \(a_1+a_2: a_1, a_2\in A\) is at most \(3k-4\). It is shown that in this case the number of different products \(a_1a_2\) is at least \( c ( k/ \log k)^2\). A similar result is shown for two different sets, provided the quotient of their cardinalities stays between positive bounds. The proof starts by recalling a theorem of G. Freiman, which yields that \(A\) is contained in a short arithmetical progression. Then the number of coincidences in the products taken from arithmetical progressions is estimated. For the entire collection see [Zbl 0919.00044].
- Direct and inverse theorems on signed sumsets of integers
- A polynomial bound in Freiman's theorem.
- Inverse Turán numbers
- A sum-product estimate in algebraic division algebras
- Sum-product theorems in algebraic number fields
- Some inverse results of sumsets
- Sums and products with smooth numbers
- Few sums, many products
- scientific article; zbMATH DE number 3254152 (Why is no real title available?)
- On sums and products of integers
- Large sumsets from small subsets
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4256482)