Papers
Topics
Authors
Recent
Search
2000 character limit reached

Betti numbers associated to the facet ideal of a matroid

Published 14 Jul 2012 in math.CO and math.AC | (1207.3443v3)

Abstract: To a matroid M with n edges, we associate the so-called facet ideal F(M) generated by monomials corresponding to bases of M. We show that the Betti numbers related to an N-graded minimal free resolution of F(M) are determined by the Betti numbers related to the blocks of M. Similarly, we show that the higher weight hierarchy of M is determined by the weight hierarchies of the blocks, as well. Drawing on these results, we show that when M is the cycle matroid of a cactus graph, the Betti numbers determine the higher weight hierarchy -- and vice versa. Finally, we demonstrate by way of counterexamples that this fails to hold for outerplanar graphs in general.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.