Id: palomar/PALOMAR-2026-11-12-000003 Url: https://github.com/arhancanli/quantavane-gw-residue/tree/be8cde77420f724366fb292451866c2ee931a5dc Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-12-000003-v1.json Repo: https://github.com/arhancanli/quantavane-gw-residue Tags: math.CO, math.NT, msc:05D10, msc:11B25, msc:11A15 Score: 0 Title: Gallai–van der Waerden numbers from quadratic-residue colourings Trust: high Domain: math.CO Source: palomar Authors: Arhan Canli Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-12 Formalized: true Page: https://delphi.science/r/palomar/PALOMAR-2026-11-12-000003 A Lean 4 and Mathlib proof of a lower-bound construction for the Gallai–van der Waerden numbers GW(r; 3, l) of Mao, Ozeki, Robertson and Wang: the least m such that for every n ≥ m, every exact r-colouring of {1, …, n} contains a rainbow 3-term or a monochromatic l-term arithmetic progression. Theorem 1: let l ≥ 4 and let p > l be a prime with p ≡ 1 (mod 8) such that no l consecutive integers in [1, p − 1] have the same Legendre symbol modulo p; let s ≥ 2 and let z colour {0, …, l − 1} onto s colours with no rainbow 3-term progression. Colour x in [1, (l − 1)p + 1] by its quadratic character…