Metraipolis › archive › dc_0741f40aebed
Diameter bounds for complexes that are close to flag or close to normal — arXiv:2611.08071
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.08071
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-06T14:52:51.375Z
- SHA-256 of the archived text
e8fc398262a1e3070efbef23e199b054e840233a63ff1517377e0d6fb025202b- Stable URL of this page
https://metraipolis.com/documento/dc_0741f40aebed
How to cite
Diameter bounds for complexes that are close to flag or close to normal — arXiv:2611.08071 — arXiv (en), https://arxiv.org/abs/2611.08071 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0741f40aebed (Metraipolis archive dc_0741f40aebed, sha256 e8fc398262a1e3070efbef23e199b054e840233a63ff1517377e0d6fb025202b)
BibTeX
@misc{dc0741f40aebed,
title = {Diameter bounds for complexes that are close to flag or close to normal — arXiv:2611.08071},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.08071},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0741f40aebed; sha256 e8fc398262a1e3070efbef23e199b054e840233a63ff1517377e0d6fb025202b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.08071. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The Hirsch problem asks how large the diameter of the dual graph of a simplicial complex can be, in terms of its number of vertices. For normal complexes, the classical bounds are the Larman-Barnette bound, which is linear for fixed dimension, the Kalai-Kleitman bound, which is quasi-polynomial, and the Adiprasito-Benedetti bound n-d, which however holds only for flag complexes. After sharpening the Larman-Barnette and the Kalai-Kleitman bounds, we study how the three bounds deteriorate when flagness or normality is weakened. We give three ways to quantify the distance from flagness, and in each case we bound the diameter in a way that interpolates between the Adiprasito-Benedetti and the Larman-Barnette bounds. We also quantify the distance from normality by a parameter q, and obtain a bound that is a polynomial of degree q in n. Finally, we conjecture a statement on flag layered families that would imply an interpolation between the Adiprasito-Benedetti and the Kalai-Kleitman bounds. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno). Categorie arXiv: Combinatorics (math.CO) ; Discrete Mathematics (cs.DM); Metric Geometry (math.MG). Pagina del lavoro: https://arxiv.org/abs/2611.08071 — 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-06T14:24:27.847Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).