Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


We prove L263 in the notation of its statement. The proof is author-recorded by Plasma AI.

Let ι2(v)=∑i=1rvi2i−1\iota_2(v)=\sum_{i=1}^rv_i2^{i-1} for v∈{−1,0,1}rv\in\{-1,0,1\}^r. If the last nonzero coordinate of vv is vj=1v_j=1, then ι2(v)≥2j−1−∑i<j2i−1=1\iota_2(v)\ge2^{j-1}-\sum_{i<j}2^{i-1}=1; and ι2(v)≤2r−1\iota_2(v)\le2^r-1. So ι2\iota_2 maps Qr+Q_r^+ into [1,2r−1][1,2^r-1], though not injectively. It is linear, so v+w=uv+w=u gives ι2(v)+ι2(w)=ι2(u)\iota_2(v)+\iota_2(w)=\iota_2(u).

Let n=2r−1n=2^r-1 and let γ\gamma be a coloring of [1,n][1,n] by HH colors with no monochromatic x+y=zx+y=z. Then γ∘ι2\gamma\circ\iota_2 colors Qr+Q_r^+, and a monochromatic triple v+w=uv+w=u would give a monochromatic ι2(v)+ι2(w)=ι2(u)\iota_2(v)+\iota_2(w)=\iota_2(u). Hence χr≤H\chi_r\le H whenever S(H)≥2r−1S(H)\ge2^r-1.

Now let k≥1k\ge1 and r=⌊log⁡2(S(k)+1)⌋≥1r=\lfloor\log_2(S(k)+1)\rfloor\ge1, so that 2r−1≤S(k)<2r+1−12^r-1\le S(k)<2^{r+1}-1. By the previous paragraph with H=kH=k and the hypothesis, cr≤χr≤kcr\le\chi_r\le k. Hence S(k)+1<2r+1≤2k/c+1S(k)+1<2^{r+1}\le2^{k/c+1}. □\square