Metraipolis › archive › dc_015ff23eb6b9
Completing shellings with $d-2$ extra vertices — arXiv:2609.32721
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.32721
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T23:28:55.338Z
- SHA-256 of the archived text
9c8e626773b0597a7ff79b25d70348a0d814c138a92407ebb38a6b4fd68bf3e8- Stable URL of this page
https://metraipolis.com/documento/dc_015ff23eb6b9
How to cite
Completing shellings with $d-2$ extra vertices — arXiv:2609.32721 — arXiv (en), https://arxiv.org/abs/2609.32721 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_015ff23eb6b9 (Metraipolis archive dc_015ff23eb6b9, sha256 9c8e626773b0597a7ff79b25d70348a0d814c138a92407ebb38a6b4fd68bf3e8)
BibTeX
@misc{dc015ff23eb6b9,
title = {Completing shellings with $d-2$ extra vertices — arXiv:2609.32721},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.32721},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_015ff23eb6b9; sha256 9c8e626773b0597a7ff79b25d70348a0d814c138a92407ebb38a6b4fd68bf3e8},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.32721. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Simon's conjecture (1994) asserts that any pure $d$-dimensional shellable complex on $n$ vertices can be extended to the $d$-skeleton of the simplex on $n$ vertices, one facet at a time, while maintaining shellability. Bolognini and Sentinelli (2026) recently disproved it for every $d \geq 3$. We show that the conjecture becomes true once $d-2$ new vertices are allowed, and that the same holds with $k$-decomposability in place of shellability for any $k \geq 1$. We also show that the number $d-2$ cannot be lowered. Inflating the counterexample of Bolognini and Sentinelli gives, for every $d \geq 3$, a $1$-decomposable complex that cannot be extended in this way with only $d-3$ new vertices, even while merely maintaining shellability. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-29 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2609.32721 — 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-10-07T23:08:10.769Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).