Intersection Patterns of Convex Sets via Simplicial Complexes: A Survey
From MaRDI portal
Publication:2847925
DOI10.1007/978-1-4614-0110-0_28zbMath1276.52010arXiv1102.0417OpenAlexW2163604819MaRDI QIDQ2847925
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
Helly-type theorems and geometric transversal theory (52A35) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Combinatorial aspects of simplicial complexes (05E45)
Related Items (24)
Non-monotonicity of closed convexity in neural codes ⋮ Homomorphisms preserving neural ideals ⋮ Every binary code can be realized by convex sets ⋮ Representability and boxicity of simplicial complexes ⋮ Tverberg-type theorems with altered intersection patterns (nerves) ⋮ A Model for Birdwatching and other Chronological Sampling Activities ⋮ Algebraic signatures of convex and non-convex codes ⋮ Sparse neural codes and convexity ⋮ Fractional Helly theorem for Cartesian products of convex sets ⋮ Planar Convex Codes are Decidable ⋮ Bounding Helly Numbers via Betti Numbers ⋮ Unnamed Item ⋮ Helly’s theorem: New variations and applications ⋮ Nerves, minors, and piercing numbers ⋮ A No-Go Theorem for One-Layer Feedforward Networks ⋮ Neural Codes, Decidability, and a New Local Obstruction to Convexity ⋮ Obstructions to convexity in neural codes ⋮ What Makes a Neural Code Convex? ⋮ Quantitative \((p, q)\) theorems in combinatorial geometry ⋮ Quantitative combinatorial geometry for concave functions ⋮ Embedding dimension phenomena in intersection complete codes ⋮ Petruska's question on planar convex sets ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ Helly-type problems
This page was built for publication: Intersection Patterns of Convex Sets via Simplicial Complexes: A Survey
