Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 70 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 27 tok/s Pro
GPT-5 High 24 tok/s Pro
GPT-4o 75 tok/s Pro
Kimi K2 175 tok/s Pro
GPT OSS 120B 447 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

Monochromatic Sums and Products over $\mathbb{Q}$ (2307.08901v5)

Published 18 Jul 2023 in math.CO, math.DS, math.LO, and math.NT

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

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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

X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets

This paper has been mentioned in 1 post and received 0 likes.