Face enumeration for split matroid polytopes
Luis Ferroni, Benjamin Schr\"oter

TL;DR
This paper studies the face numbers of split matroid polytopes, providing formulas to compute their f-vectors based on combinatorial data, thus avoiding complex convex hull computations.
Contribution
It introduces explicit formulas for face numbers of split matroid polytopes, linking them to cyclic flats and modular pairs, and explores special cases like sparse paving and rank two matroids.
Findings
Face numbers depend on cyclic flats and modular pairs.
Formulas enable f-vector computation without convex hulls.
Analysis of sparse paving and rank two matroids.
Abstract
This paper initiates the explicit study of face numbers of matroid polytopes and their computation. We prove that, for the large class of split matroid polytopes, their face numbers depend solely on the number of cyclic flats of each rank and size, together with information on the modular pairs of cyclic flats. We provide a formula which allows us to calculate -vectors without the need of taking convex hulls or computing face lattices. We discuss the particular cases of sparse paving matroids and rank two matroids, which are of independent interest due to their appearances in other combinatorial and geometric settings.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Advanced Combinatorial Mathematics · Point processes and geometric inequalities
