Progressions in every two-coloration of Z_ n
Defie \(G(n)\) to be the largest integer such that in any two colouring of \(\mathbb{Z}/n\mathbb{Z}\), there is a \(G(n)\) term monochromatic arithmetic progression of distinct elements. The main theorem here implies that \(G(n)\leq G(rn)\leq\max\{r,G(n)\}\) unless, in any two colouring of \(\mathbb{Z}/n\mathbb{Z}\) where the longest monochromatic arithmetic progression of distinct elements has exactly \(G(n)\) elements, we have that the \(G(n)+1\)st element always coincides with the first element (which seems very unlikely). The authors also point out and use the connection between \(G(n)\) and the van der Waerden numbers \(W(k)\), so that \(G(n)\geq k\) if \(n\geq W(k)\).
- MSS sequences, colorings of necklaces, and periodic points of f(z)=z^ 2-2
- Certain sequences of Wythoffian matrices, and maximal geometric progressions therein
- Arithmetic progressions in sequences with bounded gaps
- Zero-sum analogues of van der Waerden's theorem on arithmetic progressions
- A partition of the non-negative integers, with applications
- Monochromatic 4-term arithmetic progressions in 2-colorings of Z_n
- scientific article; zbMATH DE number 2166219 (Why is no real title available?)
- On the cyclic van der Waerden numbers
- The minimum number of monochromatic 4-term progressions in Z_p
This page was built for publication: Progressions in every two-coloration of \(Z_ n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1199996)