
TL;DR
This paper determines the nearly optimal size of subsets of [N] for which the product set has specific extremal sizes, addressing open problems in additive combinatorics.
Contribution
It provides nearly optimal bounds for the size of sets with extremal product set properties, resolving previously posed open questions.
Findings
Established bounds for |A| when |AA| is approximately |A|^2/2.
Determined the size of A for |AA| close to |[N][N]|.
Solved open problems from Cilleruelo, Ramana, and Ramare.
Abstract
We find nearly the optimal size of a set so that the product set satisfies either (i) or (ii) . This settles problems raised in a recent article of Cilleruelo, Ramana and Ramare.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
