Intersection Patterns of Convex Sets via Simplicial Complexes: A Survey

DOI10.1007/978-1-4614-0110-0_28MaRDI QIDQ2847925zbMATHOpenAlexFDO

Authors Martin Tancer

Publication date 25 September 2013

Published in Thirty Essays on Geometric Graph Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1102.0417

zbMATH Keywords

simplicial complexesintersection patterns of convex sets

Mathematics Subject Classification ID

Combinatorial aspects of simplicial complexes (05E45) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Helly-type theorems and geometric transversal theory (52A35)

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.

Recommendations

• Intersection patterns of convex sets
• Intersection patterns of finite sets and of convex sets
• On intersection graphs of convex polygons
• scientific article; zbMATH DE number 3883113
• Simplicial convexity and its applications
• A note on intersections of simplices
• A combinatorial treatment of simplicial complexes and convex polyhedra
• Density of convex intersections and applications
• Geometric intersection patterns and the theory of topological graphs
• Simplicial intersections of a convex set and moduli for spherical minimal immersions

Cited in

(31)

• Homomorphisms preserving neural ideals
• Every binary code can be realized by convex sets
• Quantitative \((p, q)\) theorems in combinatorial geometry
• Dimension gaps between representability and collapsibility
• A Model for Birdwatching and other Chronological Sampling Activities
• Helly’s theorem: New variations and applications
• Planar Convex Codes are Decidable
• A no-go theorem for one-layer feedforward networks
• Petruska's question on planar convex sets
• Tverberg-type theorems with altered intersection patterns (nerves)
• Bounding Helly numbers via Betti numbers
• Nerves of good covers are algorithmically unrecognizable
• Colorful words and \(d\)-Tverberg complexes
• scientific article; zbMATH DE number 7036236 (Why is no real title available?)
• Non-monotonicity of closed convexity in neural codes
• Fractional Helly theorem for Cartesian products of convex sets
• scientific article; zbMATH DE number 7662166 (Why is no real title available?)
• Nerves, minors, and piercing numbers
• Realizing convex codes with axis-parallel boxes
• Helly-type problems
• Embedding dimension phenomena in intersection complete codes
• On the complexity of recognizing nerves of convex sets
• Obstructions to convexity in neural codes
• Quantitative combinatorial geometry for concave functions
• Neural codes, decidability, and a new local obstruction to convexity
• Algebraic signatures of convex and non-convex codes
• What makes a neural code convex?
• Sparse neural codes and convexity
• Intersection patterns of convex sets
• Representability and boxicity of simplicial complexes
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg

This page was built for publication: Intersection Patterns of Convex Sets via Simplicial Complexes: A Survey

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2847925)