The growth-ratio conjecture for van der Waerden numbers in the number of colours

Let W(r,k)W(r,k) denote the van der Waerden number, and write W(r,k)=(r)nrW(r,k) = (r)^{n_r} and W(r+1,k)=(r+1)nr+1W(r+1,k)=(r+1)^{n_{r+1}} for the corresponding exponents. Growth-ratio conjecture. As rr grows large with r>kr>k,

W(r+1,k)W(r,k)<rnr+1nr(r+1).\frac{W(r+1,k)}{W(r,k)}<r^{n_{r+1}-n_r}(r+1).

The conjecture proposes an upper bound for the ratio of successive van der Waerden numbers as the number of colours increases; the source gives no resolution.

Sources & referencesView supporting material

Primary source

Robert J Betts, “Two Upper Bounds for both the van der Waerden Numbers W(r, k + 1) and W(r + 1, k), that show the Existence of a Recurrence Relation”, arXiv:1603.01831 (2016).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.