Delphi.science

Weil Bounds Toolkit

Source: github.com/charliedorsey/weil-bounds-toolkit/tree/0f3e4c301…

Charlie Dorsey

Palomar Registrypalomar/PALOMAR-2026-11-03-000018Nov 3, 2026math.NTscore 0

A Lean 4 formalization of the classical prime-modulus Kloosterman-Weil bound |S_p(m,n)| <= 2 sqrt(p) for nonzero m, n, proved by the Carlitz-Stepanov method following Harcos's exposition, together with an exact Chinese-remainder factorization of unit Kloosterman sums, a squarefree-modulus bound for a unit first coefficient, a bound for the sum defined at the reduced modulus q/gcd(A,q), and interval-length-uniform and weighted bounds for centered incomplete reciprocal sums.

RepositoryJSON

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