Shifted S-templates and improved lower bounds for Schur numbers

Abstract

We present an extension of the template-based approach for Schur numbers developed by Rowley. This new form of template construction, which we call shifted S-templates, was discovered during a conversation with ChatGPT 5.5 Pro, then refined, verified, and extended to multiple shifted S-templates. These new templates generalize the first ones by giving more flexibility in the coloring. Using this added flexibility with the new way to color the special label cells of the template, we exhibit a template which yields the recurrence $S(k+2) \geq 10S(k)+2$, improving on the classical Abbott-Hanson recurrence $S(k+2) \geq 9S(k)+4$ for the same step. Combined with the known bounds $S(6) \geq 536$ and $S(11) \geq 203\,828$, this implies $S(8) \geq 5\,362$ and $S(13) \geq 2\,038\,282$, improving the previously listed lower bounds $5\,286$ and $2\,011\,290$.

Disclosure

“828 [5], S(8) ≥ 10 · 536 + 2 = 5 362 S(13) ≥ 10 · 203 828 + 2 = 2 038 282 improving the previously listed lower bounds 5 286 and 2 011 290. V. C ONCLUSION From an original idea of GPT 5.5 Pro, we have produced an extension of the S-templates originally designed by Rowley [1]. These shifted S-templates provide new inequalities of the form S(k + r) ≥ aS(k) + b and broaden the search space for lower bounds of Schur numbers. We”

PDF page 4

Classification

Substantial mathematical content or result generation

Multiplier

10

Verified

2026-08-23T18:55:36.974817Z

Structural counts