Combinatorial representation and convex dimension of convex geometries
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
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.
- 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.
- Combinatorial representation and convex dimension of convex geometries
Volume 5, Issue 1 , pp 23-32
- Cover Date
- Print ISSN
- Online ISSN
- Kluwer Academic Publishers
- Additional Links
- Meet distributive lattices
- convex geometries
- convex dimension