{"id":"palomar/PALOMAR-2026-09-06-000001","url":"https://github.com/zakharov2k/EGZ-formal-proof/tree/7c82267c43a51dd5cb3e440412780ff82aff7500","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-09-06-000001-v1.json","repo":"https://github.com/zakharov2k/EGZ-formal-proof","tags":["math.CO","msc:11B30","msc:11H06","additive-combinatorics","convex-geometry","lean-formalization"],"score":0,"title":"Convex geometry and the Erdős–Ginzburg–Ziv problem: Theorem 1.2","trust":"high","domain":"math.CO","source":"palomar","authors":["Dmitrii Zakharov"],"reviews":0,"subject":"math.CO","summary":"A Lean 4 formalization of Theorem 1.2 of Dmitrii Zakharov's Convex geometry and the Erdős–Ginzburg–Ziv problem. For every fixed positive dimension d, as p tends to infinity through the primes, the Erdős–Ginzburg–Ziv constant s(F_p^d) satisfies s(F_p^d) = p w(F_p^d) + o(p), where w is the weak Erdős–Ginzburg–Ziv constant. Supporting proofs include the convex-flag Helly and centerpoint theorems, flag decomposition lemma, balanced convex combinations, relative set expansion, and the polynomial method bound for w. This submission covers Theorem 1.2 and its upper-bound formulation, not every…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-09-06","reactions":{},"formalized":true,"formalizes":[{"title":"Convex geometry and the Erdős–Ginzburg–Ziv problem","identifier":"https://doi.org/10.19086/da.165216","relationship":"formalizes"}]}