The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index; none of the 6 sources its claims cite is checked for support yet.
Monochromatic sums and products in $\mathbb{N}$
Open accessAbstract
An old question in Ramsey theory asks whether any finite coloring of the natural numbers admits a monochromatic pair $\{x+y,xy\}$. We answer this question affirmatively in a strong sense by exhibiting a large new class of nonlinear patterns that can be found in a single cell of any finite partition of $\mathbb{N}$. Our proof involves a correspondence principle that transfers the problem into the language of topological dynamics. As a corollary of our main theorem we obtain partition regularity for new types of equations, such as $x^2-y^2=z$ and $x^2+2y^2-3z^2=w$.
Overview
CoChat Summary
TL;DR
The paper proves that any finite coloring of \(\mathbb N\) contains infinitely many \(x,y\in\mathbb N\) such that \(\{x,x+y,xy\}\) is monochromatic, answering the long-standing question for the pair \(\{x+y,xy\}\) in a strong form. It does so via a new affine topological correspondence principle and derives partition regularity for broader polynomial configurations and equations such as \(a^2-b^2=c\).
Key findings
- Corollary 1.5: for any finite coloring of \(\mathbb N\), there exist infinitely many \(x,y\in\mathbb N\) with \(\{x,xy,x+y\}\) monochromatic; in particular, \(\{x+y,xy\}\) is monochromatic.
- Theorem 1.4 gives a general class: for any \(s\in\mathbb N\) and finite sets \(F_i\) of functions \(\mathbb N^i\to\mathbb Z\) whose last-variable functions are polynomial with zero constant term, any finite coloring yields a color \(C\) and infinitely many \((s+1)\)-tuples \(x_0,\dots,x_s\in\mathbb N\) such that \(x_0\cdots x_s\in C\) and \(x_1\cdots x_j+f(x_{j+1},\dots,x_i)\in C\) for all \(0\le j<i\le s\) and \(f\in F_{i-j}\).
- Corollary 1.7: if \(c_1+\cdots+c_k=0\) with \(c_i\in\mathbb Z\setminus\{0\}\), then any finite coloring of \(\mathbb N\) has pairwise distinct \(a_0,\dots,a_k\) of the same color satisfying the corresponding partition-regular equation; Corollary 1.8 specializes to a monochromatic solution of \(a^2-b^2=c\).
- Theorem 7.5 extends the main combinatorial result to large ideal domains (LIDs), a class including fields, \(\mathbb Z\), rings of integers of number fields, and \(\mathbb F[x]\).
Methods
- The proof is mathematical/combinatorial, with no empirical data or sample. It first transfers the problem to topological dynamics via an affine correspondence principle (Theorem 3.2), using ultrafilters and the Stone–Čech compactification, reducing Theorem 1.4 to a dynamical statement (Theorem 3.1).
- The dynamical proof uses a “complexity reduction” technique inspired by Bergelson–Leibman, the polynomial van der Waerden theorem (Theorem 4.1/Corollary 4.2), and a multiplicative-derivative identity for expressions \(M_nA_{f(n)}\).
- Section 5 also gives a short, purely combinatorial proof of Corollary 1.5 using piecewise syndetic sets and a van der Waerden-type theorem (Theorem 5.1).
Limitations
- Stated: the paper says a complete solution to Problem 1.2—characterizing all polynomial Ramsey families—is still very far from reach; the results cover a large class, not a full classification.
- Stated: the methods of earlier work on infinite fields cannot be directly used for \(\mathbb N\), because the affine semigroup of \(\mathbb N\) is not amenable.
- Stated: the LID extension relies on Lemma 7.4, which fails in general rings, even some principal ideal domains; the paper gives \(\mathbb Q[x]\) as an example where \(x\mathbb Q[x]\) has infinite additive index and cannot be piecewise syndetic. Also, \(\mathbb N\) is not strictly a LID, and LID semirings are not pursued.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
0 Valid · 0 Not valid · 6 Not checked · 18 Own results and interpretations
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Remark 3.3. It follows from the proof of Theorem 3.2 that the system ( X, ( T g ) g ∈A -N ) also has the property that for any piecewise syndetic set C t ⊂ N there exists a nonempty open set U t ⊂ X such that (2) holds for any g 1 , . . . , g k ∈ A -N .”
plainstates an association- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Theorem 7.5. Let R be a LID, let s ∈ N and, for each i = 1 , . . . , s , let F i be a finite set of functions R i → R such that for all f ∈ F i and any x 1 , . . . , x i -1 ∈ R , the function x ↦→ f ( x 1 , . . . , x i -1 , x ) is polynomial with 0 constant term. Then for any finite coloring of R there exists a color C ⊂ R and (infinitely many) ( s +1) -tuples x 0 , . . . , x s ∈ R such that”
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Theorem 7.2. Let R be a LID and let A R denote the semigroup of all affine transformations of R . There exists an A R -topological system ( X, ( T g ) g ∈A R ) with a dense set of additively minimal points, such that each map T g : X → X is open and injective, and with the property that for any finite coloring R = C 1 ∪ · · · ∪ C r there exists an open cover X = U 1 ∪··· ∪ U r such that for any g”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Proof of Corollary 1.5. Let r ∈ N and let N = C 1 ∪·· ·∪ C r be an arbitrary coloring (or partition) of N . We need to find t ∈ { 1 , . . . , r } and (infinitely many) x, y ∈ N satisfying”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Theorem 1.4. Let s ∈ N and, for each i = 1 , . . . , s , let F i be a finite set of functions N i → Z such that for all f ∈ F i and any x 1 , . . . , x i -1 ∈ N , the function x ↦→ f ( x 1 , . . . , x i -1 , x ) is polynomial with 0 constant term. Then for any finite coloring of N there exists a color C ⊂ N and (infinitely many) ( s +1) -tuples x 0 , . . . , x s ∈ N such that”
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
13 more claims
Create a free account to see all 24 claims and every source verdict.
- The quote only partly states this claim. 1
- Probably not a substantial claim. 4
- It may state two separate claims as one. 2
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ 7. Extensions to LID · p. 16
“Then for any finite coloring of R there exists a color C ⊂ R and (infinitely many) ( s +1) -tuples x 0 , . . . , x s ∈ R such that”
§ 7. Extensions to LID · p. 15
“Examples of LID's include all fields, the ring Z (and more generally the ring of integers of any number field), and the ring F [ x ] of polynomials over a finite field.”
Citations
Cites
Recurrence in Ergodic Theory and Combinatorial Number Theory
Furstenberg, H. (1981) · Princeton University Press eBooks · doi:10.1515/9781400855162 · Cited by 1,364
Graham, R. L. (1990) · Cited by 938
Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions
Furstenberg, H. (1977) · Journal d Analyse Mathématique · doi:10.1007/bf02813304 · Cited by 804
On sets of integers containing k elements in arithmetic progression
Szemerédi, E. (1975) · Acta Arithmetica · doi:10.4064/aa-27-1-199-245 · Cited by 798
Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
Bergelson, V., & Leibman, A. (1996) · Journal of the American Mathematical Society · doi:10.1090/s0894-0347-96-00194-4 · Cited by 354
Rado, R. (1933) · Mathematische Zeitschrift · doi:10.1007/bf01188632 · Cited by 292
Topological dynamics and combinatorial number theory
Fürstenberg, H., & Weiss, B. (1978) · Journal d Analyse Mathématique · doi:10.1007/bf02790008 · Cited by 197
Algebra in the Stone-Čech Compactification: Theory and Applications
Hindman, N., & Strauss, D. (1998) · De Gruyter eBooks · doi:10.1515/9783110809220 · Cited by 177
On difference sets of sequences of integers. I
Sárközy, A. (1978) · Acta Mathematica Academiae Scientiarum Hungaricae · doi:10.1007/bf01896079 · Cited by 128
Higher order Fourier analysis of multiplicative functions and applications
Frantzikinakis, N., & Host, B. (2016) · Journal of the American Mathematical Society · doi:10.1090/jams/857 · Cited by 75
Research works printed but not linked: 3
- 10.2307/1998782 · doi:10.2307/1998782
- Schur, 1916, Über die kongruenz x^m+y^m\equiv z^m(mod p), Jahresbericht der Deutschen Math. Verein., 25, 114
- van~der Waerden, 1927, Beweis einer baudetschen vermutung, Nieuw. Arch. Wisk., 15, 212
Cited by
Ramsey properties of nonlinear Diophantine equations
Nasso, M. D., & Baglini, L. L. (2017) · Advances in Mathematics · doi:10.1016/j.aim.2017.11.003 · Cited by 29
Infinite sumsets in sets with positive density
Kra, B., Moreira, J., Richter, F., & Robertson, D. (2023) · Journal of the American Mathematical Society · doi:10.1090/jams/1030 · Cited by 26
Self-citationProblems on infinite sumset configurations in the integers and beyond
Kra, B., Moreira, J., Richter, F., & Robertson, D. (2025) · Bulletin of the American Mathematical Society · doi:10.1090/bull/1868 · Cited by 20
Self-citationExponential patterns in arithmetic Ramsey theory
Sahasrabudhe, J. (2017) · Acta Arithmetica · doi:10.4064/aa8603-9-2017 · Cited by 15
On Rado conditions for nonlinear Diophantine equations
Barrett, J. M., Lupini, M., & Moreira, J. (2020) · European Journal of Combinatorics · doi:10.1016/j.ejc.2020.103277 · Cited by 14
Self-citationMultiplicative combinatorial properties of return time sets in minimal dynamical systems
Glasscock, D., Koutsogiannis, A., & Richter, F. K. (2019) · Discrete and Continuous Dynamical Systems · doi:10.3934/dcds.2019258 · Cited by 13
Fermat-Like Equations that are not Partition Regular
Nasso, M. D., & Riggio, M. (2017) · COMBINATORICA · doi:10.1007/s00493-016-3640-2 · Cited by 11
Nonstandard characterisations of tensor products and monads in the theory of ultrafilters
Baglini, L. L. (2019) · Mathematical logic quarterly · doi:10.1002/malq.201800089 · Cited by 8
Rado's theorem for rings and modules
Byszewski, J., & Krawczyk, E. (2021) · Journal of Combinatorial Theory Series A · doi:10.1016/j.jcta.2021.105402 · Cited by 6
Counting monochromatic solutions to diagonal Diophantine equationsPreprint
Prendiville, S. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.10161 · Cited by 6
Revisiting sums and products in countable and finite fields
Kousek, I. (2025) · Ergodic Theory and Dynamical Systems · doi:10.1017/etds.2025.10244 · Cited by 4
Liu, H., Pach, P. P., & Sándor, C. (2022) · COMBINATORICA · doi:10.1007/s00493-021-4815-z · Cited by 4
Infinite monochromatic patterns in the integers
Nasso, M. D. (2022) · Journal of Combinatorial Theory Series A · doi:10.1016/j.jcta.2022.105610 · Cited by 4
Sums and products in sets of positive densityPreprint
Richter, F. C. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2507.00515 · Cited by 4
Monochromatic quotients, products and polynomial sums in the rationals
Xiao, R. (2023) · Discrete Mathematics · doi:10.1016/j.disc.2023.113795 · Cited by 3
Monochromatic sums and quotients in $\mathbb N$Preprint
Nasso, M. D., Baglini, L. L., Mennuni, R., Ragosta, M., & Vegnuti, A. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2603.03115 · Cited by 3
Polynomial extension of some symmetric partition regular structures
Chakraborty, A., & Goswami, S. (2024) · Bulletin des Sciences Mathématiques · doi:10.1016/j.bulsci.2024.103415 · Cited by 2
Finding Product and Sum Patterns in Non-commutative Settings
Tao, T., & Yang, N. (2025) · Frontiers of Mathematics · doi:10.1007/s11464-024-0166-6 · Cited by 2
Monochromatic solutions to systems of exponential equations
Sahasrabudhe, J. (2018) · Journal of Combinatorial Theory Series A · doi:10.1016/j.jcta.2018.04.002 · Cited by 2
Schoen, T. (2020) · COMBINATORICA · doi:10.1007/s00493-020-4482-5 · Cited by 1
Parallels Between Topological Dynamics and Ergodic Theory
Huang, W., Shao, S., & Ye, X. (2020) · Springer eBooks · doi:10.1007/978-3-642-27737-5_748-1 · Cited by 1
Parallels Between Topological Dynamics and Ergodic Theory
Huang, W., Shao, S., & Ye, X. (2023) · Encyclopedia of complexity and systems science series · doi:10.1007/978-1-0716-2388-6_748 · Cited by 1
Nonlinear Kernel Partition Regularity: Necessary and Sufficient ConditionsPreprint
Goswami, S. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2407.05542 · Cited by 1
Bergelson, V., & Richter, F. K. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2603.25922 · Cited by 1
Partition regular polynomial patterns in commutative semigroups
Moreira, J. (2016) · OhioLink ETD Center (Ohio Library and Information Network)
Self-citationPartition Regularity of Equations
Nasso, M. D., Goldbring, I., & Lupini, M. (2019) · Lecture notes in mathematics · doi:10.1007/978-3-030-17956-4_9
A General Framework for Studying Finite Rainbow Configurations
Desgrottes, M., Senger, S., Soukup, D., & Zhu, R. (2019) · Springer proceedings in mathematics & statistics · doi:10.1007/978-3-030-31106-3_5
Grechuk, B. (2021) · Springer eBooks · doi:10.1007/978-3-030-80627-9_2
Rado functionals and applicationsPreprint
Arruda, P. H., & Baglini, L. L. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2209.07844
Towards characterizing the 2-Ramsey equations of the form ax + by = p(z)
Baja, Z., Dobák, D., Kovács, B., Pach, P. P., & Pigler, D. (2023) · Discrete Mathematics · doi:10.1016/j.disc.2023.113324
Eisner, T., & Farkas, B. (2025) · Birkhäuser advanced texts. Basler Lehrbücher · doi:10.1007/978-3-031-96506-7_13
SOME MONOCHROMATIC PATTERNS IN NATURAL NUMBERS
GHOSH, A., & GHOSH, S. (2026) · Bulletin of the Australian Mathematical Society · doi:10.1017/s0004972726100975
MONOCHROMATIC SUMS AND QUOTIENTS NEAR ZERO
Shaikh, M. M., Patra, S. K., & Kumar, M. (2026) · Bulletin of the Australian Mathematical Society · doi:10.1017/s0004972726101774
Density regularity of $\{x,x+y,xy\}$ in the integersPreprint
Richter, F. K., & Tsinas, K. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2609.30410
Timeline of 21st Century Mathematics
Grechuk, B. (2026) · Springer eBooks · doi:10.1007/978-3-032-26888-4_10
Grechuk, B. (2026) · Springer eBooks · doi:10.1007/978-3-032-26888-4_2
Metadata
- Authors
- Moreira, J.
- Affiliations
- Northwestern University (US)
- Corresponding author
- Moreira, Joel
- ORCID
- Moreira, Joel
- Venue
- Annals of Mathematics
- Publisher
- Annals of Mathematics
- Published
- 2017-05-01
- Volume
- 185
- Issue
- 3
- Pages
- 1069-1090
- ISSN
- 0003-486X (ISSN-L)
- 1939-8980
- OpenAlex
- W2345368044
- Cited by
- 36
- References
- 33
- Citations by year
- 2026: 7 · 2025: 5 · 2024: 2 · 2023: 4 · 2022: 3 · 2021: 2 · 2020: 4 · 2019: 4 · 2018: 1 · 2017: 3
- FWCI
- 4.05
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Annals of Mathematics (publishedVersion)
- Warwick Research Archive Portal (University of Warwick) (acceptedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Limits and Structures in Graph Theory
- Physical Sciences › Mathematics › Geometry and Topology › Advanced Topology and Set Theory
- Physical Sciences › Mathematics › Mathematical Physics › Mathematical Dynamics and Fractals
- Keywords
- partition regularity, nonlinear patterns, Ramsey theory, correspondence principle, topological dynamics
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
A language model drew the claims from the paper on 2026-11-14, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-11-14 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
