Representing finite convex geometries by relatively convex sets

Abstract

A closure system with the anti-exchange axiom is called a convex geometry. One geometry is called a sub-geometry of the other if its closed sets form a sublattice in the lattice of closed sets of the other. We prove that convex geometries of relatively convex sets in $n$-dimensional vector space and their finite sub-geometries satisfy the $n$-Carousel Rule, which is the strengthening of the $n$-Carath$\acute{e}$odory property. We also find another property, that is similar to the simplex partition property and does not follow from $2$-Carusel Rule, which holds in sub-geometries of $2$-dimensional geometries of relatively convex sets.

12 pages

Cited by in corpus (6)

• Ordered direct implicational basis of a finite closure system
• Notes on the description of join-distributive lattices by permutations
• Representation of convex geometries by circles on a plane
• On scattered convex geometries
• A note and a short survey on supporting lines of compact convex sets in the plane
• Optimum basis of finite convex geometry