Delphi.science

A tight bound for Green's arithmetic triangle removal lemma in vector spaces

Source: github.com/gdahia/ArithmeticTriangleRemovalInVectorSpaces/t…

Gabriel Dahia

Palomar Registrypalomar/PALOMAR-2026-11-07-000005Nov 7, 2026math.COscore 0

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).

RepositoryJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

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}'