A note on disjunctive Rado numbers. (Q1415387)

Let \(L_0\) and \(L_1\) be linear equations over the integers. The disjunctive Rado number \(r_d\left(L_0,L_1\right)\), introduced by B. Johnson and the second author, is the least integer \(n\), if one exists, such that, for every colouring of the set \(\{1,2,\dots,n\}\), there exists either a monochromatic solution to \(L_0\) or a monochromatic solution to \(L_1\); if neither solution exists, the number is said to be infinite. \(S(k)\) denotes the equation \(\sum\limits_{i=1}^{k-1}x_i=x_k\). Theorem 1.1. Let \(3\leq m\leq n\) be integers. Then \[ r_d(S(m),S(n))=\begin{cases} m^2-m-1&\text{ for } m\leq n\leq m+1,\\ m^2-2m+1&\text{ for } m+2\leq n\leq m^2-2m+2,\\ n-1&\text{ for } m^2-2m+3\leq n\leq m^2-m-1,\\ m^2-m-1&\text{ for } n\leq m^2-m.\end{cases} \]