WorksMathematics
A new lower bound for the sixth Schur number:
Abstract
We give an explicit partition of into six sum-free sets, establishing . This improves the lower bound 536 of Fredricksen and Sweet (2000). Known recursive constructions then give the improved lower bounds , , , and . 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.
Introduction
A set of integers is sum-free if there are no , not necessarily distinct, with . The Schur number is the largest for which can be partitioned into sum-free sets. The values are known, the last one determined by Heule [8]. For the record has been since 2000, when Fredricksen and Sweet [7] found it by a search over symmetric sum-free partitions; it has been quoted as the best known bound ever since. We improve it by one.
Theorem 1. .
Proof. The following six sets are pairwise disjoint, their union is , and none of them contains , and . We list every element, as in the explicit constructions of Fredricksen and Sweet [7]. These properties are verified by checking all sums within each set, including .
Color 1 (76 integers).
1 5 12 15 19 21 23 25 29 32 39 43 45 49 95 102 106 108 112 119 122 126 128 130 132 136 139 146 150 152 156 163 166 170 172 174 176 180 358 362 364 366 368 372 375 382 386 388 392 399 402 406 408 410 412 416 419 426 430 432 436 443 489 493 495 499 506 509 513 515 517 519 523 526 533 537
Color 2 (76 integers).
2 6 7 17 18 22 27 37 41 42 46 51 66 70 81 89 90 100 101 105 109 110 113 114 124 125 129 133 134 144 145 149 153 157 158 168 169 192 346 369 370 380 381 385 389 393 394 404 405 409 413 414 424 425 428 429 433 437 438 448 449 457 468 472 487 492 496 497 501 511 516 520 521 531 532 536 Color 3 (88 integers).
3 8 9 14 20 24 26 30 31 36 47 53 59 63 65 69 76 82 86 88 92 98 104 115 120 121 127 131 137 142 143 148 154 159 160 165 171 177 181 182 187 188 193 204 334 345 350 351 356 357 361 367 373 378 379 384 390 395 396 401 407 411 417 418 423 434 440 446 450 452 456 462 469 473 475 479 485 491 502 507 508 512 514 518 524 529 530 535
Color 4 (70 integers).
4 10 11 13 16 28 33 34 35 40 55 57 79 93 94 96 99 111 116 117 118 123 135 138 140 141 147 155 161 162 164 167 179 185 203 335 353 359 371 374 376 377 383 391 397 398 400 403 415 420 421 422 427 439 442 444 445 459 481 483 498 503 504 505 510 522 525 527 528 534
Color 5 (76 integers).
38 44 48 50 52 54 56 58 60 61 62 64 67 68 71 72 73 74 75 77 78 80 83 84 85 87 91 97 103 107 173 189 196 197 201 209 212 236 302 326 329 337 341 342 349 365 431 435 441 447 451 453 454 455 458 460 461 463 464 465 466 467 470 471 474 476 477 478 480 482 484 486 488 490 494 500
Color 6 (151 integers).
151 175 178 183 184 186 190 191 194 195 198 199 200 202 205 206 207 208 210 211 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 327 328 330 331 332 333 336 338 339 340 343 344 347 348 352 354 355 360 363 387
Theorem 1 needs only this one partition. Section 2 lists what it implies for other Schur and Ramsey numbers. In Section 3 we describe all 131 partitions of into six sum-free sets that our search produced. Section 4 describes the construction of the families. The complete partitions and supplementary tables are available at https://github.com/jeffchen006/Schur-Number-6.
Throughout, , , and a colouring of is palindromic if for all . We number the colours in the order of their least elements. We write for the -th color class.
Consequences for other bounds
Classical recurrences of Schur and Abbott–Hanson [1, 2], and the template constructions of Rowley and Ageron et al. [3, 4], turn smaller partitions into larger ones. We use
A sum-free -partition of also gives an edge coloring of without monochromatic triangles: color by the class of . Consequently, .
Corollary 2. The lower bounds in the column headed “This work” in Table 1 hold.
Table 1. Lower bounds in the cited literature and the bounds obtained here. The six- and eight-color bounds are supported by explicit partitions.
Proof. , , , and . For we also built the partition explicitly: apply the width-10 template of [5, Table II] to the partition of Theorem 1, with colours 7 and 8 for the labels and . This gives a partition of into eight sum-free sets.
Bounds for larger that are derived through these recurrences change in the same way; we list only the four cases in which we checked the previously published values.
The 537-partitions and their families
The example above is palindromic, and each of its classes is even sum-free modulo 538. The least elements of its classes are 1, 2, 3, 4, 38, 151, and the sixth class contains the whole interval [237, 301]. These features are captured by the following family of colourings.
Definition 3. A colouring whose classes are sum-free modulo 538 is in frame if, with and ,
In words: the sixth colour does not occur below 151 and fills the middle of the interval, and the fifth colour does not occur below 38 or just below 151.
The first class of the example has a simple description as well. Put
a set of 38 numbers, and , a set of 76 numbers. The first class of the example is exactly .
Proposition 4. The 131 partitions of into six sum-free sets listed in the supplementary material are pairwise distinct, every class of each of them is sum-free modulo 538, and no one of them is obtained from another by a map with followed by renaming the colours. They form the five families summarized in Table 2. The example of Theorem 1 is . Each partition in – agrees with the example in at least 462 of the 537 positions.
| Family | Count | |||
| 107 | 0 | 0 | 0 | |
| 14 | 0 | 2 | 0 | |
| 5 | 2–12 | 0 | 0 | |
| 4 | 0 | 2–8 | 1–13 | |
| 1 | 5 | 3 | 5 | |
| Total | 131 |
Table 2. The 131 retained partitions. Intervals give the observed minimum and maximum within a family. Features of use the normalization stated in the text. The quantity counts folded values, not individual positions. All entries are computed from the 131 explicit partitions.
Proof. For each partition, check all sums within each class modulo 538. To check inequivalence, compare all images under multiplication by units modulo 538, with colors renumbered in the order of their least elements. The family properties follow by counting the quantities in Table 2.
For Table 2, counts pairs with different colors, , and
Thus counts each folded value once if either corresponding position is outside color 6, including the single central position . Family is measured after and color renumbering; its original class minima are 1, 2, 3, 4, 7, 16. Families – satisfy frame . Family satisfies the frame with the solid-middle condition removed. These families describe the retained sample, not all possible 537-partitions.
Construction of the families
The palindromic families are obtained by imposing reflection symmetry and the sum-free conditions modulo 538. For and , we also impose frame . The two families are distinguished by whether the first class is or differs from it in one reflected pair. For , we retain the frame conditions but remove reflection symmetry. For , we retain reflection symmetry but remove the condition that color 6 contains every position with .
For , let be the coloring in Theorem 1 and put
with the colors of each renamed to maximize agreement with . We then require a new coloring to satisfy
together with sum-freeness modulo 538. This construction does not impose reflection symmetry or the solid-middle condition.
The example in Theorem 1 is sufficient for the new lower bound. The other partitions describe variations of its structure; they do not form an exhaustive classification of six-color partitions of $[1,537]`.
References
- [1]I. Schur, Über die Kongruenz x^m + y^m ≡ z^m (mod p), Jahresber. Deutsch. Math.-Verein. 25 (1916), 114–117.
- [2]H. L. Abbott and D. Hanson, A problem of Schur and its generalizations, Acta Arith. 20 (1972), 175–187.DOI
- [3]F. Rowley, An improved lower bound for S(7) and some interesting templates, arXiv:2107.03560 (2021).arxiv.org/abs/2107.03560
- [4]R. Ageron, P. Casteras, T. Pellerin, Y. Portella, A. Rimmel and J. Tomasik, New lower bounds for Schur and weak Schur numbers, arXiv:2112.03175 (2021).arxiv.org/abs/2112.03175
- [5]N. Bengone, A. Brouk, M. Grinsztajn, T. Helbert, B. Lugherini, A. Rimmel and J. Tomasik, Shifted S-templates and improved lower bounds for Schur numbers, arXiv:2607.15034 (2026).arxiv.org/abs/2607.15034
- [6]X. Xu, Z. Xie, G. Exoo and S. P. Radziszowski, Constructive lower bounds on classical multicolor Ramsey numbers, Electron. J. Combin. 11 (2004), #R35.DOI
- [7]H. Fredricksen and M. M. Sweet, Symmetric sum-free partitions and lower bounds for Schur numbers, Electron. J. Combin. 7 (2000), #R32. doi:10.37236/1510.DOI
- [8]M. J. H. Heule, Schur number five, Proc. AAAI 32 (2018). doi:10.1609/aaai.v32i1.12209.DOI