Combinatorial representation and convex dimension of convex geometries

@article{Edelman1988CombinatorialRA,
  title={Combinatorial representation and convex dimension of convex geometries},
  author={Paul H. Edelman and Michael E. Saks},
  journal={Order},
  year={1988},
  volume={5},
  pages={23-32}
}
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. 
Embedding convex geometries and a bound on convex dimension
TLDR
It is proved that a convex geometry may always be represented with a generalized convex shelling and a new, shorter proof of their result is provided using a recent representation theorem of Richter and Rubinstein. Expand
On the representation of finite convex geometries with convex sets
Very recently Richter and Rogers proved that any convex geometry can be represented by a family of convex polygons in the plane. We shall generalize their construction and obtain a wide variety ofExpand
On the Order Dimension of Convex Geometries
TLDR
It is shown that the lattice of closed subsets of the planar point set of Erdős and Szekeres from 1961, which is a set of 2n’− 2 points and contains no vertex set of a convex n-gon, has order dimension n’s and any larger set of points has order dimensions at least n. Expand
Enumeration in Convex Geometries and Associated Polytopal Subdivisions of Spheres
TLDR
These spheres are nearly polytopal, in the sense that their barycentric subdivisions are simplicial polytopes, and the complete information on the numbers of faces and chains of faces can be obtained from the defining lattices in a manner analogous to the relation between arrangements of hyperplanes and their underlying geometric intersection lattices. Expand
Convex Dimension of Locally Planar Convex Geometries
  • W. Morris
  • Mathematics, Computer Science
  • Discret. Comput. Geom.
  • 2001
We prove that convex geometries of convex dimension n that satisfy two properties satisfied by nondegenerate sets of points in the plane, may have no more than 2n-1 points. We give examples of suchExpand
Probabilistic values on convex geometries
TLDR
A family of axioms are obtained that give rise to several probabilistic values and a unique Shapley value for games on convex geometries. Expand
A representation theorem for lattices via set-colored posets
This paper proposes a representation theory for any lattice via set-colored posets, in the spirit of Birkhoff for distributive lattices, and Korte and Lovász [1985], Edelman and Sacks [1988] forExpand
The Shapley value on convex geometries
TLDR
Two classes of axioms are obtained that give rise to a unique Shapley value for games on convex geometries. Expand
Chromatic numbers of copoint graphs of convex geometries
TLDR
A family of copoint graphs for which the ratio of the chromatic number to the clique number can be arbitrarily large is given, analogues of results of Erdős and Szekeres for convex geometries realizable by point sets in R d where cliques in the copoint graph correspond to subsets of points in convex position. Expand
Induced layered clusters, hereditary mappings, and convex geometries
TLDR
A method for structural clustering that appears to be related to order-theoretic concepts of the hereditary mappings and convex geometries, which enables characterizations of those in terms of the monotone linkage functions. Expand
...
1
2
3
4
...

References

SHOWING 1-5 OF 5 REFERENCES
Meet-distributive lattices and the anti-exchange closure
This paper defines the anti-exchange closure, a generalization of the order ideals of a partially ordered set. Various theorems are proved about this closure. The main theorem presented is that aExpand
Dimension Theory for Ordered Sets
In 1930, E. Szpilrajn proved that any order relation on a set X can be extended to a linear order on X. It also follows that any order relation is the intersection of its linear extensions. B.Expand
Homomorphisms and Ramsey properties of antimatroids
TLDR
It is proved that every antimatroid can be represented as a homomorphic image of a poset and a Ramsey-type result for antimatroids is proved. Expand
A DECOMPOSITION THEOREM FOR PARTIALLY ORDERED SETS
Otherwise a and b are non-comparable. A subset S of P is independent if every two distinct elements of S are non-comparable. S is dependent if it contains two distinct elements which are comparable.Expand