Matroids and their Dressians
Combinatorics
2020-08-05 v2
Abstract
We study Dressians of matroids using the initial matroids of Dress and Wenzel. These correspond to cells in regular matroid subdivisions of matroid polytopes. An efficient algorithm for computing Dressians is presented, and its implementation is applied to a range of interesting matroids. We give counterexamples to a few plausible statements about matroid subdivisions.
Keywords
Cite
@article{arxiv.1902.05592,
title = {Matroids and their Dressians},
author = {Madeline Brandt and David E Speyer},
journal= {arXiv preprint arXiv:1902.05592},
year = {2020}
}
Comments
20 pages, 9 figures; V2: corrected errors in V1 including V1, Theorem B. See V2, Section 5