Leray numbers of tolerance complexes
Minki Kim, Alan Lew

TL;DR
This paper introduces a new class of complexes called tolerance complexes and proves that they are Leray under certain conditions, extending Helly-type theorems with tolerance parameters.
Contribution
It establishes a bound on Leray numbers of tolerance complexes derived from d-collapsible complexes, linking topological properties with tolerance parameters.
Findings
Existence of a function h(t,d) bounding the Leray number of tolerance complexes.
Tolerance complexes of d-collapsible complexes are h(t,d)-Leray.
New tolerant versions of the colorful Helly theorem are derived.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Advanced Graph Theory Research · Data Management and Algorithms
