Erdős–Szemerédi sum-product conjecture
Erdős–Szemerédi sum-product conjecture
Let be a finite subset of . For , define
Erdős–Szemerédi conjecture. For any , any and any set , one should have
The conjecture asserts that additive and multiplicative structure cannot coexist too strongly. It generalizes the assertion that either the sumset or product set of a finite complex set must be close in size to ; the supplied text gives no resolution status.
Equivalent formulations 1
Other statements of this same problem, merged from separate entries. Each is equivalent to the statement above — proving any one settles them all.
Erdős–Szemerédi sum-product conjecture
Let be a finite set. For a finite set , write and . Write when for some constant and all relevant . Erdős–Szemerédi conjecture. For every ,
This is a classical sum-product conjecture in additive combinatorics; the source uses it to motivate lower bounds for sets of spectral radii.
source: J. A. Dias da Silva and Pedro J. Freitas, “Counting Spectral Radii of Matrices with Positive Entries”, arXiv:1305.1139 (2013).
Sources & referencesView supporting material
Primary source
Joseph Harrison, Akshat Mudgal and Harry Schmidt, “Uniform sum-product phenomenon for algebraic groups and Bremner's conjecture”, arXiv:2603.06483 (2026).
Additional references
26 papers in this index state this conjecture (2006–2026). The statement above is taken from the most recent of them; the others are arXiv:2601.03797, arXiv:2512.13849, arXiv:2410.20618, arXiv:2310.07964, arXiv:2303.15910, arXiv:2207.08221, arXiv:2111.03586, arXiv:2109.04932, arXiv:2102.05446, arXiv:2010.01377, arXiv:2005.09893, arXiv:2005.11145, and 13 more.
Progress summary
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.