Paperlane

no. 17 · Wednesday 18 November 2026

More lower bounds for Hales–Jewett and van der Waerden numbers

Younes Mouhib

math.CO · code · 6 pp

Abstract

We give explicit colourings improving the comparison lower bounds assembled here for several Hales–Jewett and van der Waerden numbers. The main algebraic tool generalises Rabung's power-residue colouring from arithmetic progressions to arbitrary sets. If every translate of a t-element set S in F_p meets at least two classes of the r-th power character, and the integer weights have both parities, then a period-2p one-weight colouring of [t]^p has no monochromatic combinatorial line. The 19 displayed algebraic certificates comprise 18 improvements and one closed-form reproduction; they include HJ(4,3)>=164, HJ(5,4)>=7418, and HJ(5,6)>=34034. The underlying period-p construction also proves kappa_ow(t,r)>=p-1 for the one-weight bracket ceiling, in particular kappa_ow(5,4)>=7416 and kappa_ow(5,6)>=34032. Warm breakout-weighted tabu search on the type simplex gives HJ(3,4)>=51. Whole-colouring local search gives W(8,3)>522, W(11,3)>1193, and W(17,3)>3620. All accepted certificates are available separately and are checked by direct enumeration; unresolved searches are reported as UNKNOWN, not UNSAT.

code
github.com/ysmouhib/hj-vdw-reproducibility
comments
6 pages. Explicit certificates, search algorithms, and verification code are available at https://github.com/ysmouhib/hj-vdw-reproducibility and in the ancillary files
fields
Combinatorics
pdf ↗ page arXiv:2611.22205 ↗