Polynomial extensions of Raimi's theorem
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914226560303104 |
|---|---|
| author | Hegyvari, Norbert Pach, Janos Pham, Thang |
| author_facet | Hegyvari, Norbert Pach, Janos Pham, Thang |
| contents | Raimi's theorem guarantees the existence of a partition of $\mathbb{N}$ into two parts with an unavoidable intersection property: for any finite coloring of $\mathbb{N}$, some color class intersects both parts infinitely many times, after an appropriate shift (translation). We establish a polynomial extension of this result, proving that such intersections persist under polynomial shifts in any dimension. Let $P^{(1)},\dots,P^{(f)}\in\mathbb{Z}[x]$ be non-constant polynomials with positive leading coefficients and $P^{(j)}(0)=0$ for every $j$. We construct a partition of $\mathbb{N}^k$ into an arbitrarily fixed finite number of pieces such that for any coloring of $\mathbb{N}^k$ with finitely many colors, there exist $x_0\in \mathbb{N}$ and a single color class that meets all partition pieces after shifts by $x_0+P^{(j)}(h)$ in each of the $k$ coordinate directions, for every $j$ and infinitely many values $h\in \mathbb{N}$. Our proof exploits Weyl's equidistribution theory, Pontryagin duality, and the structure of polynomial relation lattices. We also prove some finite analogues of the above results for abelian groups and $SL_2(\mathbb{F}_q)$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_06650 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Polynomial extensions of Raimi's theorem Hegyvari, Norbert Pach, Janos Pham, Thang Combinatorics Number Theory Raimi's theorem guarantees the existence of a partition of $\mathbb{N}$ into two parts with an unavoidable intersection property: for any finite coloring of $\mathbb{N}$, some color class intersects both parts infinitely many times, after an appropriate shift (translation). We establish a polynomial extension of this result, proving that such intersections persist under polynomial shifts in any dimension. Let $P^{(1)},\dots,P^{(f)}\in\mathbb{Z}[x]$ be non-constant polynomials with positive leading coefficients and $P^{(j)}(0)=0$ for every $j$. We construct a partition of $\mathbb{N}^k$ into an arbitrarily fixed finite number of pieces such that for any coloring of $\mathbb{N}^k$ with finitely many colors, there exist $x_0\in \mathbb{N}$ and a single color class that meets all partition pieces after shifts by $x_0+P^{(j)}(h)$ in each of the $k$ coordinate directions, for every $j$ and infinitely many values $h\in \mathbb{N}$. Our proof exploits Weyl's equidistribution theory, Pontryagin duality, and the structure of polynomial relation lattices. We also prove some finite analogues of the above results for abelian groups and $SL_2(\mathbb{F}_q)$. |
| title | Polynomial extensions of Raimi's theorem |
| topic | Combinatorics Number Theory |
| url | https://arxiv.org/abs/2511.06650 |