Diameter bounds for complexes that are close to flag or close to normal
Abstract
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.
Related
- Field independence of the first seven Betti numbers of flag complexes
- A data structure for quotient flag complexes
- A priori bounds for geodesic diameter. Part III. A Sobolev–Poincaré inequality and applications to a variety of geometric variational problems
- Sharp Diameter Bounds for Nonnegative Cyclotomic Multiples
- Diameter Bounds and Finiteness of Graphs from Local Intersection Data
BibTeX
@misc{benedetti2026diameter,
title = {{Diameter bounds for complexes that are close to flag or close to normal}},
author = {Bruno Benedetti and Giuliamaria Menara},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.08071},
eprint = {2611.08071},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.08071},
}
RIS
TY - UNPB
TI - Diameter bounds for complexes that are close to flag or close to normal
AU - Bruno Benedetti
AU - Giuliamaria Menara
PY - 2026
DA - 2026/11/05
PB - arXiv
DO - 10.48550/arxiv.2611.08071
UR - https://arxiv.org/abs/2611.08071
AB - 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.
ER -