The h-vector of a matroid M is an important invariant related to the independence complex of M and can also be recovered from an evaluation of its Tutte polynomial. A well-known conjecture of Stanley posits that the h-vector of a matroid is a pure O-sequence, meaning that it can be obtained by counting faces of a pure multicomplex. Merino has established Stanley's conjecture for the case of cographic matroids via chip-firing on graphs and the concept of a G-parking function. Inspired by these constructions, we introduce the notion of a cycle system for a matroid M -- a family of cycles (unions of circuits) of M with overlap properties that mimic cut-sets in a graph. A choice of cycle system on M defines a collection of integer sequences that we call coparking functions. We show that for any cycle system on M, the set of coparking functions is in bijection with the set of bases of M. We show that maximal coparking functions all have the same degree, and that cycle systems behave well under deletion and contraction. This leads to a proof of Stanley's conjecture for the case of matroids that admit cycle systems, which include, for instance, graphic matroids of cones as well as K33-free graphs.
Corry et al. (Sun,) studied this question.