๐Ÿ“–
A new lower bound for the sixth Schur number: $S(6)\ge 537$
Zhiyang Chen, Ligeng Zhu, Fan Long

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

Author / Organization:
Science & Mathematics Published 2026 Verification Pending

Overview & Synopsis

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.

Indexed from repository: arXiv (arxiv.org)
Loading document from verified source...
Keyboard Shortcuts: ← / → for pages • + / - for zoom • 0 to fit width Powered by Mozilla PDF.js v3.11

Document Information

Document Title A new lower bound for the sixth Schur number: $S(6)\ge 537$
Author / Organization Zhiyang Chen, Ligeng Zhu, Fan Long
Subject & Discipline math.CO
Categories Science & Mathematics
Publication Year 2026
License / Rights arXiv Open Access / Creative Commons
Resource Verification Listed PDF (Verification Pending)
Original Host Website arXiv (arxiv.org)
File Format application/pdf (Portable Document Format)
Language EN
Catalog ID DOC-263443
Original Source Link Visit Source Page on arxiv.org »