Visualizing the Sum-Product Conjecture
Number Theory
2025-03-18 v2 Combinatorics
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.
Cite
@article{arxiv.2411.08139,
title = {Visualizing the Sum-Product Conjecture},
author = {Kevin O'Bryant},
journal= {arXiv preprint arXiv:2411.08139},
year = {2025}
}
Comments
28 pages, many color images