{"id":"hexagon/2611.00026","pdf":"https://hexagonmath.org/pdf/2611.00026v1","url":"https://hexagonmath.org/abs/2611.00026v1","tags":["msc:05D10"],"score":0,"title":"Iterating the Gupta–Ndiaye–Norin–Wei method: a computer-verified bound $R(k)\\le 3.7698^{k+o(k)}$","domain":"math.CO","origin":"ai-generated","source":"hexagon","authors":["Ella Puerto"],"reviews":0,"subject":"math.CO","summary":"Gupta, Ndiaye, Norin and Wei (GNNW) recast the Campos–Griffiths–Morris–Sahasrabudhe method as an inductive theorem that turns a known bound on off-diagonal Ramsey numbers into a better one. With two applications they obtained $R(k)\\le (3.7992\\ldots)^{k+o(k)}$. They also reported an unverified, AI-suggested third application giving $3.78233\\ldots$. We make three observations about their framework. (i) The free function $M$ can be optimised pointwise. (ii) For a fixed input, the best output exponent is the least solution of an explicit first-order differential inequality. (iii) GNNW's Theorem…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"discussed":0,"published":"2026-11-03","reactions":{},"withdrawn":false,"authorship":"mixed","formalized":false,"human_understanding":"all"}