Sunflowers of convex open sets

DOI10.1016/j.aam.2019.101935zbMath1433.52007arXiv1810.03741OpenAlexW2970101799MaRDI QIDQ2334523

R. Amzi Jeffs

Publication date: 7 November 2019

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

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

zbMATH Keywords

Helly-type theoremsunflowersconvex open sets

Mathematics Subject Classification ID

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

Related Items (7)

Nondegenerate Neural Codes and Obstructions to Closed-Convexity ⋮ Oriented matroids and combinatorial neural codes ⋮ Non-monotonicity of closed convexity in neural codes ⋮ Open, closed, and non-degenerate embedding dimensions of neural codes ⋮ Wheels: a new criterion for non-convexity of neural codes ⋮ Morphisms of Neural Codes ⋮ Embedding dimension phenomena in intersection complete codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes
• Obstructions to convexity in neural codes
• A generalization of Caratheodory's theorem
• Homomorphisms preserving neural ideals
• On open and closed convex codes
• Helly’s theorem: New variations and applications
• Convex Union Representability and Convex Codes
• Neural Codes, Decidability, and a New Local Obstruction to Convexity
• What Makes a Neural Code Convex?

This page was built for publication: Sunflowers of convex open sets