Leray numbers of tolerance complexes
Abstract
Let be a simplicial complex on vertex set . is called -Leray if the homology groups of any induced subcomplex of are trivial in dimensions and higher. is called -collapsible if it can be reduced to the void complex by sequentially removing a simplex of size at most that is contained in a unique maximal face. We define the -tolerance complex of , , as the simplicial complex on vertex set whose simplices are formed as the union of a simplex in and a set of size at most . We prove that for any and there exists a positive integer such that, for every -collapsible complex , the -tolerance complex is -Leray. The definition of the complex 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}
}