Antimatroids of finite character
Copyright policy )Antimatroids of finite character
This paper provides an axiomatization of antimatroids (``convex geometries''; see \textit{P. H. Edelmann} and \textit{R. E. Jamison,} [Geom. Dedicata 19, 247-270 (1985; Zbl 0577.52001)]) that also works for the moderately infinite case of ``finite character'', where any union of a chain of closed sets is again closed.
Axiomatic and generalized convexity, abstract convex geometries, antimatroid, anti-exchange closures, infinite rank, Combinatorial aspects of matroids and geometric lattices, Galois correspondences, closure operators (in relation to ordered sets)
Axiomatic and generalized convexity, abstract convex geometries, antimatroid, anti-exchange closures, infinite rank, Combinatorial aspects of matroids and geometric lattices, Galois correspondences, closure operators (in relation to ordered sets)
citations The total number of citations received by all articles of the researcher of interest.4 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!