Sunflowers of convex open sets

From MaRDI portal
Publication:2334523




Abstract: A sunflower is a collection of sets U1,ldots,Un such that the pairwise intersection UicapUj is the same for all choices of distinct i and j. We study sunflowers of convex open sets in mathbbRd, and provide a Helly-type theorem describing a certain "rigidity" that they possess. In particular we show that if U1,ldots,Ud+1 is a sunflower in mathbbRd, then any hyperplane that intersects all Ui must also intersect . We use our results to describe a combinatorial code mathcalCn for all nge2 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 mathbfPmathbfCode.









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)