Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 18 Jul 2023 in math.CO, math.DS, math.LO, and math.NT | (2307.08901v5)

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 $n$, a finite coloring of the naturals contains $n$ 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 ${ \sum_{i \in S}x_i, \prod_{i \in S}x_i }$, where $S$ ranges over all nonempty subsets of $[n]$, is partition regular over the rationals.

Citations (1)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.