Open Research Index

JD-Jones-ASES/fs-formal

JD Jones

Palomar Registrypalomar/PALOMAR-2026-08-26-000004Aug 26, 2026math.COscore 0

A Lean 4 formalization of an explicit construction for the Furstenberg-Sárközy problem. If D(N) is the largest size of a subset of {1,...,N} with no nonzero square difference, the development proves that an explicit eleven-block constant alphaInf is at most liminf log D(N)/log N, that every exponent below alphaInf holds eventually pointwise, and that 0.7537 < alphaInf. The proof includes the finite certificates, the composite even-digit lift, CRT gluing, asymptotic passage, and kernel-checked numerical inequalities. This strictly improves Krachun's preceding explicit exponent…

SourceRepositoryJSON

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