Few products, many h-fold sums
From MaRDI portal
Publication:4582734
DOI10.1142/S1793042118501270zbMath1407.11021arXiv1409.7349OpenAlexW2963011007WikidataQ129890925 ScholiaQ129890925MaRDI QIDQ4582734
Publication date: 24 August 2018
Published in: International Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.7349
additive combinatoricssum-product problemdependent random choicePlünnecke-Ruzsa inequalitysumset and product set
Other combinatorial number theory (11B75) Arithmetic combinatorics; higher degree uniformity (11B30)
Related Items (3)
Higher convexity and iterated sum sets ⋮ Higher convexity and iterated second moment estimates ⋮ Some remarks on sets with small quotient set
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New results on sums and products in \(\mathbb{R}\)
- Bounding multiplicative energy by the sumset
- On sum sets of sets having small product set
- Sums and products from a finite set of real numbers
- On multiple sum and product sets of finite sets of integers.
- The Erdős-Szemerédi problem on sum set and product set
- \(h\)-fold sums from a set with few products
- Multigrade efficient congruencing and Vinogradov's mean value theorem
- Dependent random choice
- On sums and products of integers
- On the number of sums and products
- h-Fold Sums from a Set with Few Products
- On sums and products of integers
- ON THE NUMBER OF SUMS AND PRODUCTS
This page was built for publication: Few products, many h-fold sums