Relations between poset matroids and greedoids
Liu San
Abstract
Liu San
Abstract
This paper deals with the relations between poset matroids and greedoids. The first is to show that any poset matroid is a greedoid by comparing the property of rank closure operator of poset matroids with the relative property of closure operator of greedoids. In addition, by comparing the axioms of automorphism group of greedoids with that of poset matroids, it is proved that a greedoid is not necessary a poset matroid.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper deals with the relations between poset matroids and greedoids. The first is to show that any poset matroid is a greedoid by comparing the property of rank closure operator of poset matroids with the relative property of closure operator of greedoids. In addition, by comparing the axioms of automorphism group of greedoids with that of poset matroids, it is proved that a greedoid is not necessary a poset matroid.
Key concepts: Matroid, Partially ordered set, Graphic matroid, Combinatorics, Mathematics, Property (philosophy), Closure (psychology), Rank (graph theory)