Open Research Index

The order-six stable-marriage finite-poset bound

Myunglae Jo

Palomar Registrypalomar/PALOMAR-2026-09-20-000010Sep 20, 2026math.COscore 0

A Lean formalization of the finite-poset theorem that any finite poset with at most fifteen elements, width at most three, and the CI2 common-incomparability condition has at most forty-eight antichains.

SourceRepositoryJSON

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