Sharp i.i.d. tail probabilities and large hypergraph matchings
Source: github.com/xliu2022/sharp-tail-matching-lean/tree/c9903fa4d…
A Lean formalization of the sharp upper tail bound for sums of independent identically distributed nonnegative random variables, including all maximizing laws and boundary cases, and the exact Erdős matching bound with its equality classification for every fixed uniformity k >= 3 and all sufficiently large matching parameters, uniformly over n >= k(s+1).
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-21-000003
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-21-000003/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-21-000003/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'