Paperlane

no. 1 · Friday 23 October 2026

A new lower bound for the sixth Schur number: $S(6)\ge 537$

Zhiyang Chen, Ligeng Zhu and Fan Long

math.CO

Abstract

We give an explicit partition of $\{1,\ldots,537\}$ into six sum-free sets, establishing $S(6)\ge 537$. This improves the lower bound 536 of Fredricksen and Sweet (2000). Known recursive constructions then give the improved lower bounds $S(8)\ge 5\,372$, $S(11)\ge 204\,208$, $S(13)\ge 2\,042\,082$, and $R_6(3)\ge 539$. We also report 131 pairwise inequivalent partitions found by the search. We describe their structure and provide the complete partitions in the supplementary material. These partitions provide starting points for future searches and structural studies of Schur partitions.

fields
Combinatorics
pdf ↗ page arXiv:2610.31362 ↗