OpenAlex ·
A new lower bound for the sixth Schur number: $S(6)\ge 537$
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2610.31362
- Original
- Read it at the publisher
- Topics
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.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Combinatorics
Contributions to the Stable Derived Categories of Gorenstein Rings
BCC optimality for the three-dimensional Coulomb lattice energy
Proofs of strong forms of the Bovdi--Geche universality conjecture and a complex analogue
Near optimal gap in the Lonely Runner Conjecture
Spectral delocalization and central limit theorems for Fourier functionals of stationary Gaussian fields
Get the few papers worth your time in Combinatorics every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.