Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
157 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Infinite polynomial patterns in large subsets of the rational numbers (2506.19667v1)

Published 24 Jun 2025 in math.CO and math.DS

Abstract: Inspired by a question of Kra, Moreira, Richter, and Robertson, we prove two new results about infinite polynomial configurations in large subsets of the rational numbers. First, given a finite coloring of $\mathbb{Q}$, we show that there exists an infinite set $B = {b_n : n \in \mathbb{N}} \subseteq \mathbb{Q}$ such that ${b_i, b_i2 + b_j : i < j}$ is monochromatic. Second, we prove that every subset of positive density in the rational numbers contains a translate of such an infinite configuration. The proofs build upon methods developed in a series of papers by Kra, Moreira, Richter, and Robertson to translate from combinatorics into dynamics, where the core of the argument reduces to understanding the behavior of certain polynomial ergodic averages. The new dynamical tools required for this analysis are a Wiener--Wintner theorem for polynomially-twisted ergodic averages in $\mathbb{Q}$-systems and a structure theorem for Abramov $\mathbb{Q}$-systems. The end of the paper includes a discussion of related problems in the integers.

Summary

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