Ramsey functions related to the van der Waerden numbers
Van der Waerden's problem was to find to each positive integer \(n\) an interval \(S=[1,\dots,m]\) of positive integers such that if \(S\) is 2- colored, then there exists a monochromatic arithmetic progression of length \(n\) in \(S\), this means, if \(S\) is partitioned into two sets, at least one of these sets contains an arithmetic progression of length \(n\). The least \(m\) with this property is denoted by \(w(n)\). The known upper bounds of \(w(n)\) are very large. The author wants to find smaller upper bounds. The idea is to consider classes \(A'\) of sequences which include the \(n\)- term arithmetic progressions. Then he defines \(w'(n)\) to be the least positive integer which guarantees that if the interval \([1,\dots,w'(n)]\) is 2-colored, then there exists a monochromatic member of \(A'\). For various \(A'\) upper bounds are given for the corresponding \(w'(n)\). It is clear that \(w'(n)\leq w(n)\). In addition, it is shown that the existence of somewhat stronger upper bounds on \(w'(n)\) would imply similar bounds for \(w(n)\).
- A Construction for Partitions Which Avoid Long Arithmetic Progressions
- A Short Proof of van der Waerden's Theorem on Arithmetic Progressions
- Computer-Generated van der Waerden Partitions
- Generalized van der Waerden numbers
- scientific article; zbMATH DE number 3711961 (Why is no real title available?)
- scientific article; zbMATH DE number 3380629 (Why is no real title available?)
- scientific article; zbMATH DE number 3385632 (Why is no real title available?)
- On the existence of a reasonable upper bound for the van der Waerden numbers
- Primitive Recursive Bounds for Van Der Waerden Numbers
- Values and bounds for Ramsey numbers associated with polynomial iteration
- Generalized van der Waerden numbers
- Values and bounds for Ramsey numbers associated with polynomial iteration
- Progressions in every two-coloration of \(Z_ n\)
- A pseudo upper bound for the van der Waerden function
- The Ramsey property for collections of sequences not containing all arithmetic progressions
- An upper bound for van der Waerden-like numbers using \(k\) colors
- Lower bounds on some certain van der Waerden functions.
- Primitive Recursive Bounds for Van Der Waerden Numbers
- Monochromatic sequences whose gaps belong to {d, 2d, …, md}
- scientific article; zbMATH DE number 637296 (Why is no real title available?)
- scientific article; zbMATH DE number 1741762 (Why is no real title available?)
- scientific article; zbMATH DE number 1123807 (Why is no real title available?)
- scientific article; zbMATH DE number 2033289 (Why is no real title available?)
- Bounding some Ramsey functions
- Ramsey Functions for Generalized Progressions
This page was built for publication: Ramsey functions related to the van der Waerden numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1193448)