Progressions in every two-coloration of \(Z_ n\) (Q1199996)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Progressions in every two-coloration of \(Z_ n\) |
scientific article |
Statements
Progressions in every two-coloration of \(Z_ n\) (English)
0 references
17 January 1993
0 references
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)\).
0 references
two-coloration
0 references
colouring
0 references
monochromatic arithmetic progression
0 references
van der Waerden numbers
0 references