Sunflowers of convex open sets
From MaRDI portal
Publication:2334523
Abstract: A sunflower is a collection of sets such that the pairwise intersection is the same for all choices of distinct and . We study sunflowers of convex open sets in , and provide a Helly-type theorem describing a certain "rigidity" that they possess. In particular we show that if is a sunflower in , then any hyperplane that intersects all must also intersect . We use our results to describe a combinatorial code for all which is on the one hand minimally non-convex, and on the other hand has no local obstructions. Along the way we further develop the theory of morphisms of codes, and establish results on the covering relation in the poset .
Recommendations
- Sunflowers in set systems of bounded dimension
- Sunflowers and \(L\)-intersecting families
- UPPER BOUNDS FOR SUNFLOWER-FREE SETS
- A note on suns in convex metric spaces
- On suns in linear metric spaces and convex metric spaces
- Improved bounds for the sunflower lemma
- Improved bounds for the sunflower lemma
- Connectedness and other geometric properties of suns and Chebyshev sets
Cites work
- scientific article; zbMATH DE number 480237 (Why is no real title available?)
- scientific article; zbMATH DE number 1749054 (Why is no real title available?)
- scientific article; zbMATH DE number 863503 (Why is no real title available?)
- scientific article; zbMATH DE number 3214278 (Why is no real title available?)
- A generalization of Caratheodory's theorem
- Convex union representability and convex codes
- Helly’s theorem: New variations and applications
- Homomorphisms preserving neural ideals
- Neural codes, decidability, and a new local obstruction to convexity
- Obstructions to convexity in neural codes
- On open and closed convex codes
- The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes
- What makes a neural code convex?
Cited in
(11)- Morphisms of Neural Codes
- Oriented matroids and combinatorial neural codes
- Canonical forms of neural ideals
- Open, closed, and non-degenerate embedding dimensions of neural codes
- Non-monotonicity of closed convexity in neural codes
- Nondegenerate Neural Codes and Obstructions to Closed-Convexity
- Wheels: a new criterion for non-convexity of neural codes
- Novel view on classical convexity theory
- Realizing convex codes with axis-parallel boxes
- Embedding dimension phenomena in intersection complete codes
- Sunflowers in set systems of bounded dimension
This page was built for publication: Sunflowers of convex open sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2334523)