pith. sign in

arxiv: 1201.4662 · v2 · pith:6NLAOESYnew · submitted 2012-01-23 · 🧮 math.CO

The Weak-Map Order and Polytopal Decompositions of Matroid Base Polytopes

classification 🧮 math.CO
keywords matroidbasepolytopeorderpolytopesweak-mapdecomposabilitygive
0
0 comments X
read the original abstract

The weak-map order on the matroid base polytopes is the partial order defined by inclusion. Lucas proved that the base polytope of no binary matroid includes the base polytope of a connected matroid. A matroid base polytope is said to be decomposable when it has a polytopal decomposition which consists of at least two matroid base polytopes. We shed light on the relation between the decomposability and the weak-map order of matroid base polytopes. We classify matroids into five types with respect to the weak-map order and decomposability. We give an example of a matroid in each class. Moreover, we give a counterexample to a conjecture proposed by Lucas, which says that, when one matroid base polytope covers another matroid base polytope with respect to inclusion, the latter matroid base polytope should be a facet of the former matroid base polytope.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.