New results on global rank axioms of poset matroids (Q2577870)

Poset matroid is a notion similar to the notion of a matroid where the bases are necessarily filters of a given poset. Poset matroids are related to combinatorial schemes defined for distributive lattices. In this article, the authors give new results based on the axioms for the rank function of a poset matroid. These results concern some kind of truncation and are similar to results well known in classical matroid theory.