Sum-product exponent conjecture for positive integers
Sum-product exponent conjecture for positive integers
Let be a set of positive integers, and define
Sum-product exponent conjecture. Then
This conjecture proposes a quantitative lower bound on the combined additive and multiplicative expansion of a finite set. The paper presents it as one of several dataset-motivated conjectures, with no resolution supplied.
Sources & referencesView supporting material
Primary source
Kevin O'Bryant, “Visualizing the Sum-Product Conjecture”, arXiv:2411.08139 (2025).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.