Wiki
Wiki

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

Updated


Statement

Remark 1. "The proof gives a quantitative bound. For each fixed k≥2k\ge2, there is a constant ck>0c_k>0 such that

R(k,ℓ+1)R(k,ℓ)≤1+ℓ−ck\frac{R(k,\ell+1)}{R(k,\ell)}\le1+\ell^{-c_k}

for all sufficiently large ℓ\ell. We do not attempt to optimize ckc_k." (p. 1, quoted as printed.)

Discrepancy of form, recorded here. The site's commentary on Problem 1014 and the formal-conjectures variant erdos_1014.variants.upper_bound print R(k,ℓ+1)≤(1+O(ℓ−c/k2))R(k,ℓ)R(k,\ell+1)\le(1+O(\ell^{-c/k^2}))R(k,\ell) with one constant c>0c>0 for all kk. The manuscript states only ck>0c_k>0 depending on kk; the k2k^2 in the denominator is a reading of its proof, which takes a qq-th root with q=k2q=k^2 of a quantity bounded by a fixed negative power of ℓ\ell. No value of ckc_k is stated for any kk, and nothing in the manuscript claims c3≥1c_3\ge1.

Source. OpenAI, On the ratio of R(k,ℓ)R(k,\ell) and R(k,ℓ+1)R(k,\ell+1), three-page manuscript hosted at cdn.openai.com (retrieved 2026-09-18); Remark 1 on p. 1, read on the page image and in the text layer; the same provenance and attribution as Theorem 1.

Read depth. Claims checked: the remark was read clause by clause on the page image. Its justification is the last display of the proof of Theorem 1 (p. 2), read for structure and not checked.

Proof pointer

The proof of Theorem 1 (pp. 2--3): the right side of display (3) is bounded by fixed negative powers of ℓ\ell through Lemmas 1--2, and the qq-th root with q=k2q=k^2 gives the rate; the manuscript does not write the exponent out.

Dependencies

The proof of Theorem 1 and its three lemmas.

Bears on

  • Problem 544: with k=3k=3 (the manuscript's first argument) and the problem's kk as ℓ\ell, the remark reads R(3,k+1)−R(3,k)≤k−c3R(3,k)R(3,k+1)-R(3,k)\le k^{-c_3}R(3,k) for all large kk, the site's consequence R(3,k+1)−R(3,k)≪k−cR(3,k)R(3,k+1)-R(3,k)\ll k^{-c}R(3,k); an authored one-line specialization made on the problem page. It bounds the increment above by O(k2−c3/log⁡k)O(k^{2-c_3}/\log k) and gives no lower bound, so it decides neither question of the problem unless c3≥1c_3\ge1, which is not claimed.
  • Problem 1014: the quantitative form the site's commentary reports, in the manuscript's own words.