{"id":"palomar/PALOMAR-2026-11-06-000014","url":"https://github.com/lacey-gatech/restricted-polynomials-lean/tree/74d50a348e889711901a77defee87b92f94c89db","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-06-000014-v1.json","repo":"https://github.com/lacey-gatech/restricted-polynomials-lean","tags":["math.NT","math.CO","msc:11B30","msc:05D10","msc:11T06","msc:11R06"],"score":0,"title":"Reasonable bounds for restricted polynomial progressions in F_p^n","trust":"high","domain":"math.NT","source":"palomar","authors":["Michael Lacey"],"reviews":0,"subject":"math.NT","summary":"A complete Lean 4 / Mathlib formalization of Theorem 1.1 of Burgin, Fragkos, Kruzel, Lacey and Stokolosa (arXiv:2610.12831). For k ≥ 2 there are M_k ≤ exp(7 k log k) and P_k ≤ exp exp(25 k² log k), and an absolute constant C₁, such that for every prime p ≥ P_k there are C, c > 0 with the following property. Every A ⊆ F_p^n with n > exp^{(K)}(1) and density at least C / (log^{(K)} n)^c, where K = k^{C₁ k}, contains a restricted polynomial progression x, x + P_1(y), …, x + P_{k-1}(y), with P_j(y) = (y_1^j, …, y_n^j) and y ∈ {0, 2, 3, …, M_k}^n \\ {0}. Moreover, the k points of any such…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-06","reactions":{},"formalized":true,"formalizes":[{"title":"Reasonable bounds for Restricted Polynomial Progressions in F_p^n","identifier":"arXiv:2610.12831","relationship":"formalizes"},{"title":"On approximability of satisfiable k-CSPs: VII","identifier":"arXiv:2411.15136","relationship":"formalizes"},{"title":"On approximability of satisfiable k-CSPs: VI","identifier":"arXiv:2411.15133","relationship":"formalizes"},{"title":"On approximability of satisfiable k-CSPs: IV","identifier":"arXiv:2307.16248","relationship":"formalizes"},{"title":"A proof of the Schinzel-Zassenhaus conjecture on polynomials","identifier":"arXiv:1912.12545","relationship":"formalizes"}]}