Quasi-concave functions on antimatroids

Details Quasi-concave functions on antimatroids Quasi-concave functions on antimatroids

2004-08-26

arxiv.org/abs/math/0408365v1

Mathematics

Combinatorics

7 pages

Scientific paper

In this paper we consider quasi-concave set functions defined on antimatroids. There are many equivalent axiomatizations of antimatroids, that may be separated into two categories: antimatroids defined as set systems and antimatroids defined as languages. An algorthmic characterization of antimatroids, that considers them as set systems, was given in (Kempner, Levit 2003). This characterization is based on the idea of optimization using set functions defined as minimum values of linkages between a set and the elements from the set complement. Such set functions are quasi-concave. Their behavior on antimatroids was studied in (Kempner, Muchnik 2003), where they were applied to constraint clustering. In this work we investigate a duality between quasi-concave set functions and linkage functions. Our main finding is that quasi-concave set functions on an antimatroid may be represented as minimum values of some monotone linkage functions.

Affiliated with

Also associated with

No associations

Rating

Quasi-concave functions on antimatroids does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quasi-concave functions on antimatroids, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quasi-concave functions on antimatroids will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-476692