Cospanning characterizations of antimatroids and convex geometries
Kempner Yulia, Vadim E. Levit

TL;DR
This paper provides a new cospanning characterization of antimatroids and convex geometries, revealing their unique structural properties and connections with closure operators and extreme points.
Contribution
It introduces a novel cospanning framework that characterizes antimatroids and convex geometries, linking them through equivalence relations and extreme points.
Findings
Feasible sets of convex geometries are maximal in cospanning classes.
Equivalence classes form intervals between extreme points and closures.
New properties of closure and extreme point operators are established.
Abstract
Given a finite set and an operator , two sets are \textit{cospanning} if . Corresponding \textit{cospanning equivalence relations} were investigated for greedoids in much detail (Korte, Lovasz, Schrader; 1991). For instance, these relations determine greedoids uniquely. In fact, the feasible sets of a greedoid are exactly the inclusion-wise minimal sets of the equivalence classes. In this research, we show that feasible sets of convex geometries are the inclusion-wise maximal sets of the equivalence classes of the corresponding closure operator. Same as greedoids, convex geometries are uniquely defined by the corresponding cospanning relations. For each closure operator , an element is \textit{an extreme point} of if . The set of extreme points…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Advanced Graph Theory Research · Digital Image Processing Techniques
