Iterating the Gupta–Ndiaye–Norin–Wei method: a computer-verified bound $R(k)\le 3.7698^{k+o(k)}$
Source: hexagonmath.org/abs/2611.00026v1
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…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00026
curl -X POST /api/v1/records/hexagon/2611.00026/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00026/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'