Intersection Patterns of Convex Sets via Simplicial Complexes: A Survey

Abstract

The task of this survey is to present various results on intersection patterns of convex sets. One of main tools for studying intersection patterns is a point of view via simplicial complexes. We recall the definitions of so called d-representable, d-collapsible and d-Leray simplicial complexes which are very useful for this study. We study the differences among these notions and we also focus on computational complexity for recognizing them. A list of Helly-type theorems is presented in the survey and it is also discussed how (important) role play the above mentioned notions for the theorems. We also consider intersection patterns of good covers which generalize collections of convex sets (the sets may be 'curvy'; however their intersections cannot be too complicated). We mainly focus on new results.

What Makes a Neural Code Convex?

“…on those vertices is isomorphic to a hollow simplex (see Section 1.2, and [13]). We define the Helly dimension 5 of C, denoted d H (C), to be the dimension of the largest induced simplicial hole of ∆(C):…”

A No-Go Theorem for One-Layer Feedforward Networks

“…It is well known that every abstract simplicial complex, i.e. a code that satisfies C = ∆(C), is a convex code [16,15]. The following result shows that convex codes that are not simplicial complexes also have strong restrictions.…”

The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg

“…The nerve of a family of convex sets is the abstract simplicial complex with a vertex for every set in the family, and a simplex for every intersecting sub-family. Helly's theorem and its fractional version easily translate in terms of nerves: the former states that the nerve cannot contain the boundary of a (≥ d)-dimensional simplex without containing the simplex, and the latter asserts that if the nerve contains a positive fraction of the d-dimensional faces, then it must contain a simplex of dimension a positive fraction of n. Kalai's proof uses his technique of algebraic shifting [219] to study how the number of simplices of various dimensions behaves as the nerve is simplified through a sequence of d-collapses, a type of filtration available to nerves of convex sets [371]. If a complex is d-collapsible, then all its subcomplexes have trivial homology in dimension d and above, i.e., it is d-Leray.…”