Delphi.science

The Lennon–Pittel conjecture on random stable matchings

Source: github.com/bocowgill/lennon-pittel/tree/74c5030bb5499503502…

Bo Cowgill

Palomar Registrypalomar/PALOMAR-2026-11-07-000001Nov 7, 2026math.COscore 0

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.

RepositoryJSONText

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