Intersection Patterns of Convex Sets via Simplicial Complexes: A Survey

DOI10.1007/978-1-4614-0110-0_28zbMATH Open1276.52010arXiv1102.0417OpenAlexW2163604819MaRDI QIDQ2847925FDOQ2847925

Authors: Martin Tancer 

Publication date: 25 September 2013

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

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.

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

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

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)

Cited In (30)

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

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)