English

Monochromatic Sums and Products over $\mathbb{Q}$

Combinatorics 2023-11-20 v5 Dynamical Systems Logic Number Theory

Abstract

Hindman's finite sums theorem states that in any finite coloring of the naturals, there is an infinite sequence all of whose finite subset sums are the same color. In 1979, Hindman showed that there is a finite coloring of the naturals so that no infinite sequence has all of its pairwise sums and pairwise products the same color. Hindman conjectured that for any nn, a finite coloring of the naturals contains nn numbers all of whose subset sums and subset products are the same color. In this paper we prove the version of this statement where we color the rationals instead of the integers. In other words, we show that the pattern {iSxi,iSxi}\{ \sum_{i \in S}x_i, \prod_{i \in S}x_i \}, where SS ranges over all nonempty subsets of [n][n], is partition regular over the rationals.

Keywords

Cite

@article{arxiv.2307.08901,
  title  = {Monochromatic Sums and Products over $\mathbb{Q}$},
  author = {Ryan Alweiss},
  journal= {arXiv preprint arXiv:2307.08901},
  year   = {2023}
}

Comments

v5; cleaned up exposition

R2 v1 2026-06-28T11:33:05.106Z