Abstract
In 1977 Stanley conjectured that the h-vector of a matroid independence complex is a pure O-sequence. In this paper we use lexicographic shellability for matroids to motivate a new approach to proving Stanley's conjecture. This suggests that a pure O-sequence can be constructed from combinatorial data arising from the shelling. We then prove that our conjecture holds for matroids of rank at most four, settling the rank four case of Stanley's conjecture. In general, we prove that if our conjecture holds for all rank d matroids on at most 2d elements, then it holds for all matroids of rank d.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
