{"id":"palomar/PALOMAR-2026-11-07-000001","url":"https://github.com/bocowgill/lennon-pittel/tree/74c5030bb54995035028e11ca8806890c2e9a6b7","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-07-000001-v1.json","repo":"https://github.com/bocowgill/lennon-pittel","tags":["math.CO","math.PR","msc:05C70","msc:60C05"],"score":0,"title":"The Lennon–Pittel conjecture on random stable matchings","trust":"high","domain":"math.CO","source":"palomar","authors":["Bo Cowgill"],"reviews":0,"subject":"math.CO","summary":"We prove the Lennon–Pittel conjecture for balanced stable marriage with independent, uniform strict preferences. Let S_n count the stable complete matchings between two sides of size n. For every positive nonincreasing sequence epsilon_n tending to zero, the probability that S_n is at least epsilon_n times its expectation tends to one. This gives a lower-tail estimate at the scale of Pittel's first-moment asymptotic.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-07","reactions":{},"formalized":true}