Embedding convex geometries and a bound on convex dimension (Q512594): Difference between revisions

A convex geometry is a combinatorial abstract model (introduced by \textit{P. H. Edelman} and \textit{R. E. Jamison} [Geom. Dedicata 19, 247--270 (1985; Zbl 0577.52001)]). Several characterizations of an abstract convex geometry are presented by the authors. Briefly, a closure system with the anti-exchange axiom is called a convex geometry. Every convex geometry is isomorphic to a generalized convex shelling. The authors obtain an upper bound on the dimension of the smallest Euclidean space into which a convex geometry can be embedded via a generalized convex shelling (the so called geometric dimension). The representation theorem is used to prove that every convex geometry may be embedded as convex polygons in \(\mathbb R^2\).