The sum-product problem for small sets
From MaRDI portal
For \(k \in \mathbb N\), consider the minimum value of \(\max \{|A+A|, |AA| \}\) over real sets \(A\) of size \(k\). The sum-product conjecture predicts almost quadratic growth of this quantity, as \(k \to \infty\). For smaller values of \(k\), one can compute it precisely. The authors do this for \(k \le 9\).
Cites work
- Additive combinatorics
- An update on the sum-product problem
- Bounding multiplicative energy by the sumset
- Few sums, many products
- Freiman's inverse problem with small doubling property
- scientific article; zbMATH DE number 3834055 (Why is no real title available?)
- scientific article; zbMATH DE number 3425719 (Why is no real title available?)
- scientific article; zbMATH DE number 3157217 (Why is no real title available?)
- scientific article; zbMATH DE number 3170408 (Why is no real title available?)
- New results on sums and products in \(\mathbb{R}\)
- On higher energy decompositions and the sum-product phenomenon
- On subsets with small product in torsion-free groups
- On sum sets of sets having small product set
- On sums and products of integers
- On the cardinality of sumsets in torsion-free groups.
- On the energy variant of the sum-product conjecture
- On the few products, many sums problem
- On the number of sums and products
- Sets of integers with no large sum-free subset
- Sums and products from a finite set of real numbers
- The distribution of integers with a divisor in a given interval
This page was built for publication: The sum-product problem for small sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7033733)
