A Construction for Partitions Which Avoid Long Arithmetic Progressions (Q5556460)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3271537
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Construction for Partitions Which Avoid Long Arithmetic Progressions |
scientific article; zbMATH DE number 3271537 |
Statements
A Construction for Partitions Which Avoid Long Arithmetic Progressions (English)
0 references
1968
0 references
partition of consecutive integers
0 references
arithmetic progression
0 references
van der Waerden number
0 references
For \(k \geq 2\), \(t \geq 2\), let \(W(k, t)\) denote the least integer \(m\) such that in every partition of \(m\) consecutive integers into \(k\) sets, at least one set contains an arithmetic progression of \(t+1\) terms. \(W(k, t)<\infty\) is the well-known theorem of van der Waerden. This paper presents a construction which improves the best previously known lower bounds on \(W(k, t)\) for small \(k\) and large \(t\). This construction employs the use of the Galois field \(\mathrm{GF}(k^t)\), where \(k\) is a prime power. It is shown that if \(t\) is prime \(W(2, t)>t 2^t\).
0 references