English

Leray numbers of tolerance complexes

Combinatorics 2021-09-08 v1

Abstract

Let KK be a simplicial complex on vertex set VV. KK is called dd-Leray if the homology groups of any induced subcomplex of KK are trivial in dimensions dd and higher. KK is called dd-collapsible if it can be reduced to the void complex by sequentially removing a simplex of size at most dd that is contained in a unique maximal face. We define the tt-tolerance complex of KK, Tt(K)\mathcal{T}_t(K), as the simplicial complex on vertex set VV whose simplices are formed as the union of a simplex in KK and a set of size at most tt. We prove that for any dd and tt there exists a positive integer h(t,d)h(t,d) such that, for every dd-collapsible complex KK, the tt-tolerance complex Tt(K)\mathcal{T}_t(K) is h(t,d)h(t,d)-Leray. The definition of the complex Tt(K)\mathcal{T}_t(K) is motivated by results of Montejano and Oliveros on "tolerant" versions of Helly's theorem. As an application, we present some new tolerant versions of the colorful Helly theorem.

Cite

@article{arxiv.2109.03030,
  title  = {Leray numbers of tolerance complexes},
  author = {Minki Kim and Alan Lew},
  journal= {arXiv preprint arXiv:2109.03030},
  year   = {2021}
}
R2 v1 2026-06-24T05:45:10.476Z