Standard complexes of matroids and lattice paths (Q2155637)

A matroid is a combinatorial structure that abstracts and generalizes the notion of dependence in graphs and vector spaces. Matroids come with a rich enumerative theory and have found applications in geometry, topology, combinatorial optimization, network theory, and coding theory. In this article, the authors define and study a new class of simpicial complexes, called \textit{standard compelxes}, associated to a matroid. The motivation behind the study of these complexes comes from the Groöbner basis theory for finite point configurations. The standard compelxes are certain subcomplexes of the independence complexes that are invariant under matroid duality. The authors prove that, for lexicographic term order, the standard compelxes satisfy a deletion-contraction-type recurrence. They also explicitly determine the lexicographic standard complexes for lattice path matroids.