A tight bound for Green's arithmetic triangle removal lemma in vector spaces
Source: github.com/gdahia/ArithmeticTriangleRemovalInVectorSpaces/t…
Lean 4 formalisation of the main results of Jacob Fox and László Miklós Lovász, A tight bound for Green's arithmetic triangle removal lemma in vector spaces (arXiv:1606.01230): the arithmetic triangle removal lemma in F_p^n with a polynomial bound (Theorem 1), the Kleinberg–Sawin–Speyer bound on multicolored sum-free families (Theorem 2), the count of triangles spanned by vertex-disjoint triangles (Theorem 3), and the tightness of the exponent in Theorem 1 (the second part of Theorem 1).
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-07-000005
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-07-000005/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-07-000005/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'