Intersection patterns of convex sets via simplicial complexes, a survey

Details Intersection patterns of convex sets via simplicial complexes, a survey Intersection patterns of convex sets via simplicial complexes, a survey

2011-02-02

arxiv.org/abs/1102.0417v2

Mathematics

Combinatorics

24 pages, 7 figures 2nd version: Lower bound for minimum k = k(d) such that every d-dimensional complex is k-representable was

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Intersection patterns of convex sets via simplicial complexes, a survey does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Intersection patterns of convex sets via simplicial complexes, a survey, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Intersection patterns of convex sets via simplicial complexes, a survey will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-81070