Delphi.science

Reasonable bounds for restricted polynomial progressions in F_p^n

Source: github.com/lacey-gatech/restricted-polynomials-lean/tree/74…

Michael Lacey

Palomar Registrypalomar/PALOMAR-2026-11-06-000014Nov 6, 2026math.NTscore 0

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…

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-06-000014
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-06-000014/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-06-000014/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'