3 research outputs found
Matroids on convex geometries (cg-matroids)
AbstractWe consider matroidal structures on convex geometries, which we call cg-matroids. The concept of a cg-matroid is closely related to but different from that of a supermatroid introduced by Dunstan, Ingleton, and Welsh in 1972. Distributive supermatroids or poset matroids are supermatroids defined on distributive lattices or sets of order ideals of posets. The class of cg-matroids includes distributive supermatroids (or poset matroids). We also introduce the concept of a strict cg-matroid, which turns out to be exactly a cg-matroid that is also a supermatroid. We show characterizations of cg-matroids and strict cg-matroids by means of the exchange property for bases and the augmentation property for independent sets. We also examine submodularity structures of strict cg-matroids
More on discrete convexity
In several recent papers some concepts of convex analysis were extended to
discrete sets. This paper is one more step in this direction. It is well known
that a local minimum of a convex function is always its global minimum. We
study some discrete objects that share this property and provide several
examples of convex families related to graphs and to two-person games in normal
form