HackerPapers

arXiv:2605.28781math.NT

The sum-product conjecture is false for real numbers

Thomas F Bloom, Will Sawin, Carl Schildkraut, Dmitrii Zhelezov

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

We disprove the sum-product conjecture for real numbers by constructing arbitrarily large $A\subset \mathbb{R}$ (whose elements are algebraic integers in a number field of degree $\asymp \log\lvert A\rvert$) such that \[\max(\lvert A+A\rvert ,\lvert AA\rvert)\leq \lvert A\rvert^{2-c}\] where $c>0$ is an absolute constant. We also disprove the many sums and products conjecture by constructing, for any $k\geq 3$, arbitrarily large $A\subset \mathbb{R}$ such that \[\max(\lvert kA\rvert,\lvert A^{(k)}\rvert)\leq \lvert A\rvert^{C\frac{\log k}{\log\log k}}\] for some constant $C>0$. We obtain similar constructions for $p$-adics, finite fields, and function fields in positive characteristic, and also obtain new lower bounds for the number of solutions to linear equations in a multiplicative group and the number of solutions to the unit equation in sufficiently many variables.

arXiv comments
25 pages
Journal reference
DOI
Subjects
math.NTNumber Theory math.COCombinatorics

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Jun 2026 to Jun 2026. Found in 2 HN submissions from May 2026 to Jun 2026. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments1 thread

    • Looking at LLMs applications to math might be instructive. A year ago when they had some preliminary claims/results, people would hypothesize they had the answer implicit in their training data (and so were being "better search", but fundamentally doing derivative work). This…

      mswphdView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.