Sunflowers of convex open sets

DOI10.1016/J.AAM.2019.101935zbMATH Open1433.52007arXiv1810.03741OpenAlexW2970101799MaRDI QIDQ2334523FDOQ2334523

Authors: R. Amzi Jeffs 

Publication date: 7 November 2019

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Abstract: A sunflower is a collection of sets $U_1,ldots,U_n$ such that the pairwise intersection $U_{i}cap{U}_j$ is the same for all choices of distinct $i$ and $j$. We study sunflowers of convex open sets in $mathbb{R}^d$, and provide a Helly-type theorem describing a certain "rigidity" that they possess. In particular we show that if $U_1,ldots,U_{d+1}$ is a sunflower in $mathbb{R}^d$, then any hyperplane that intersects all $U_i$ must also intersect $$. We use our results to describe a combinatorial code $mathcal{C}_n$ 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 $mathbf{P}_{mathbfCode}$.

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

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

zbMATH Keywords

Helly-type theoremsunflowersconvex open sets

Mathematics Subject Classification ID

Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Helly-type theorems and geometric transversal theory (52A35)

Cites Work

• Title not available (Why is that?)
• A generalization of Caratheodory's theorem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Helly’s theorem: New variations and applications
• The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes
• On open and closed convex codes
• Obstructions to convexity in neural codes
• What makes a neural code convex?
• Homomorphisms preserving neural ideals
• Convex union representability and convex codes
• Neural Codes, Decidability, and a New Local Obstruction to Convexity

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)