An upper bound for van der Waerden-like numbers using \(k\) colors (Q2366957)

Given a function \(f\) upper bounds are given for the least natural number \(N\) such that if \([1,N]\) is \(k\)-partitioned then there are monocolored elements \(x_ 1,\dots,x_ n\) such that for \(i\geq 3\) either \(x_ 1,\dots,x_ i\) is an arithmetic progression or else satisfies \(x_{j+1}=p(x_ j)\) \((j<i)\) with a polynomial \(p\) of degree \(i-2\) and leading coefficient at least \(f(i)\). The bound is \(O(k!k^ 2)\) for \(n=3\) and for the general case \(n^{n^{\cdot^{\cdot^{\cdot^ n}}}}\) (a tower of height \(k+1)\), if \(f(i)\leq\max(i!,i^{(i-2)!})\).