Abstract
We develop a representation theory for convex geometries and meet distributive lattices in the spirit of Birkhoff's theorem characterizing distributive lattices. The results imply that every convex geometry on a set X has a canonical representation as a poset labelled by elements of X. These results are related to recent work of Korte and Lovász on antimatroids. We also compute the convex dimension of a convex geometry.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G. Birkhoff (1967) Lattice Theory, 3rd edn., Amer. Math. Soc. Coll. Publ. Vol. 25, Providence, RI.
R. P. Dilworth (1950) A decomposition theorem for partially ordered sets, J. Ann. Math. 51, 161–166.
P. H. Edelman (1986) Abstract convexity and meet-distributive lattices, Combinatorics and Ordered Sets (I. Rival, Ed.), AMS Contemporary Mathematics, Vol. 57, 127–150.
P. H. Edelman (1980) Meet-distributive lattices and the anti-exchange closure, Alg. Univ. 10, 290–299.
P. H. Edelman and R. E. Jamison (1985) The theory of convex geometries, Geom. Dedicata 19, 247–270.
B. Korte and L. Lovász (1985) Homomorphisms and Ramsey properties of antimatroids, Report No. 85364-OR, Institute für Ökonometric and Operations Research, Bonn.
D. Kelly and W. T. Trotter (1982) Dimension Theory for Ordered Sets, in Ordered Sets (I. Rival, ed.) D. Reidel, Dordrecht, pp. 171–211.
Author information
Authors and Affiliations
Additional information
Communicated by D. Kelly
Supported in part by NSF grant no. DMS-8501948.
Rights and permissions
About this article
Cite this article
Edelman, P.H., Saks, M.E. Combinatorial representation and convex dimension of convex geometries. Order 5, 23–32 (1988). https://doi.org/10.1007/BF00143895
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00143895