One-Sided Affine Obstructions in Complete Bipartite Hat Guessing
A Lean 4 formalization of manuscript Theorem 2.4: for every finite field K with |K| at least 4 and every m at least 1, a coordinatewise-affine strategy on the class of size |K|-1 cannot be completed to a winning strategy by arbitrary deterministic rules on the opposite class of size m, with respect to the fixed finite-field labeling.
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-09-20-000013
curl -X POST /api/v1/records/palomar/PALOMAR-2026-09-20-000013/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-09-20-000013/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'