Gallai–van der Waerden numbers from m-th power residue colourings
Source: github.com/arhancanli/quantavane-gw-residue-power/tree/6708…
A Lean 4 and Mathlib proof of two lower-bound constructions for the Gallai–van der Waerden numbers GW(r; k, 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 k-term or a monochromatic l-term arithmetic progression), for rainbow (m + 1)-term progressions and every m. Let p > l ≥ 2 be a prime with p ≡ 1 (mod m) such that (i) for every i in {0, …, m} the m residues j − i (j ≠ i, 0 ≤ j ≤ m) do not lie in m distinct m-th power classes modulo p, and (ii) no l consecutive integers in [1, p − 1] lie in one class.…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-12-000009
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-12-000009/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-12-000009/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'