Metraipolis › archive › dc_87babc2b66af
A $2.81^n$ upper bound on the number of stable matchings — arXiv:2611.06494
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.06494
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-05T18:28:41.856Z
- SHA-256 of the archived text
f42526378584a3ab6353cc7034cba1d7ee02397aeb26af708c886aa33b28b9b7- Stable URL of this page
https://metraipolis.com/documento/dc_87babc2b66af
How to cite
A $2.81^n$ upper bound on the number of stable matchings — arXiv:2611.06494 — arXiv (en), https://arxiv.org/abs/2611.06494 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_87babc2b66af (Metraipolis archive dc_87babc2b66af, sha256 f42526378584a3ab6353cc7034cba1d7ee02397aeb26af708c886aa33b28b9b7)
BibTeX
@misc{dc87babc2b66af,
title = {A $2.81^n$ upper bound on the number of stable matchings — arXiv:2611.06494},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.06494},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_87babc2b66af; sha256 f42526378584a3ab6353cc7034cba1d7ee02397aeb26af708c886aa33b28b9b7},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.06494. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study the maximum number ${\rm SM}(n)$ of stable matchings in an instance with $n$ men and $n$ women. Karlin, Oveis Gharan, and Weber (STOC 2018) proved the first single-exponential upper bound; their argument gives ${\rm SM}(n)\le 2^{17n}$ for sufficiently large $n$. Palmer and Pálvölgyi (FOCS 2021) improved this bound to $3.55^n+O(1)$. We prove that ${\rm SM}(n)<2.81^n$. This brings the exponential base closer to $2.28$, the base of the best known lower bound. More precisely, we bound the number of stable matchings in each instance in terms of each person's number of stable partners, where a stable partner is someone matched to that person in at least one stable matching. Our proof assigns each person a weight determined by this number and uses these weights to bound the number of stable matchings by induction.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Discrete Mathematics (cs.DM); Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.06494 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-05T18:18:34.006Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).