Visualizing the Sum-Product Conjecture
Kevin O'Bryant

TL;DR
This paper visualizes the sum-product pairs of sets of natural numbers, constructs a large dataset covering most such pairs for small set sizes, and finds no evidence supporting Erdős's Sum-Product Conjecture within this dataset.
Contribution
The paper introduces a large dataset of sum-product pairs for small sets, visualizations, and proves exact values for small set sizes, challenging existing conjectures.
Findings
No evidence supporting Erdős's Sum-Product Conjecture in the dataset
Constructed a dataset covering at least 84% of sum-product pairs for n ≤ 32
Proved exact sum-product pairs for sets with size up to 6
Abstract
Let be the set of sum-product pairs, where is the sumset and is the product set . We construct a dataset consisting of 1162868 sets whose sum-product pairs are at least of for each . Notably, we do **not** see evidence in favor of Erd\H{o}s's Sum-Product Conjecture in our dataset. For , we prove the exact value of . We include a number of conjectures, open problems, and observations motivated by this dataset, a large number of color visualizations.
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.
Taxonomy
Topicsgraph theory and CDMA systems · Mathematics and Applications · Advanced Graph Theory Research
