Table of Contents
Fetching ...

A direct approach to the Gallai-Schur numbers

Fred Rowley

TL;DR

Problem: determine exact $GS(r)$ and $WGS(r)$ and the structure of maximal Gallai-Schur partitions for both strong and weak variants. Method: develop two constructive liftings $^{2}\Theta$ and $^{5}\Theta$, analyze maximal partitions under a color-order and a modulo-$5$ residue structure, and derive closed-form expressions for $GS(r)$ and $WGS(r)$ with respect to the parity of $r$. Contributions: exact, parity-dependent formulas for $GS(r)$ and $WGS(r)$; a complete, unique-for-even-$r$ classification of maximal partitions; and a self-contained proof extending Budden's strong-case results to the weak case (where $WGS(r)=(9/5)\,GS(r)$ for $r>1$). Significance: deepens understanding of sum-free colorings on intervals and provides explicit bounds that are directly applicable to combinatorial number theory questions surrounding monochromatic and rainbow $a+b=c$ configurations.

Abstract

This paper characterises the structure of every maximal weak or strong Gallai-Schur partition. The results confirm the exact values of Gallai-Schur numbers provided by Budden (2020) in the strong case, and provide corresponding values for weak Gallai-Schur numbers. The proofs are elementary and standalone.

A direct approach to the Gallai-Schur numbers

TL;DR

Problem: determine exact and and the structure of maximal Gallai-Schur partitions for both strong and weak variants. Method: develop two constructive liftings and , analyze maximal partitions under a color-order and a modulo- residue structure, and derive closed-form expressions for and with respect to the parity of . Contributions: exact, parity-dependent formulas for and ; a complete, unique-for-even- classification of maximal partitions; and a self-contained proof extending Budden's strong-case results to the weak case (where for ). Significance: deepens understanding of sum-free colorings on intervals and provides explicit bounds that are directly applicable to combinatorial number theory questions surrounding monochromatic and rainbow configurations.

Abstract

This paper characterises the structure of every maximal weak or strong Gallai-Schur partition. The results confirm the exact values of Gallai-Schur numbers provided by Budden (2020) in the strong case, and provide corresponding values for weak Gallai-Schur numbers. The proofs are elementary and standalone.

Paper Structure

This paper contains 6 sections, 3 theorems.

Key Result

Theorem 1

(2-fold / 5-fold Construction) If there is a (weak) Gallai-Schur partition of the integers $[1, m]$ into $r$ non-empty subsets, then there is a (weak) Gallai-Schur partition of $[1, 2m+1]$ into $r+1$ non-empty subsets; and a (weak) Gallai-Schur partition of $[1, 5m+4]$ into $r+2$ non-empty subsets.

Theorems & Definitions (5)

  • Theorem 1
  • proof
  • Theorem 2
  • proof
  • Theorem 3