{"id":"palomar/PALOMAR-2026-11-21-000003","url":"https://github.com/xliu2022/sharp-tail-matching-lean/tree/c9903fa4df457a1075ef2fc8f6b98afeb4734308","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-21-000003-v1.json","repo":"https://github.com/xliu2022/sharp-tail-matching-lean","tags":["math.CO","math.PR","msc:05C65","msc:05C70","msc:60E15","msc:68V15"],"score":0,"title":"Sharp i.i.d. tail probabilities and large hypergraph matchings","trust":"high","domain":"math.CO","source":"palomar","authors":["Heng Li","Xizhi Liu"],"reviews":0,"subject":"math.CO","summary":"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).","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-21","reactions":{},"formalized":true,"formalizes":[{"title":"A proof of the Erdős matching conjecture for large matchings via sharp tail probability for sums of i.i.d. nonnegative random variables","identifier":"arXiv:2610.16203v1","relationship":"formalizes"},{"title":"Simplified proofs of sharp tail bounds and the Erdős matching theorem for large matchings","identifier":"","relationship":"adapts"},{"title":"A near-optimal linear range for the Erdős matching conjecture","identifier":"arXiv:2608.19118v2","relationship":"formalizes"}]}