Name
Abstract | ||
|---|---|---|
Generalizing polynomials previously studied in the context of linear codes, we define weight polynomials and an enumerator for a matroid M . Our main result is that these polynomials are determined by Betti numbers associated with N 0 -graded minimal free resolutions of the Stanley-Reisner ideals of M and so-called elongations of M . Generalizing Greene's theorem from coding theory, we show that the enumerator of a matroid is equivalent to its Tutte polynomial. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.disc.2015.10.005 | Discrete Mathematics |
Keywords | Field | DocType |
tutte polynomial,linear code,matroid | Matroid,Discrete mathematics,Enumerator polynomial,Betti number,Combinatorics,Tutte polynomial,Matroid partitioning,Graphic matroid,Weighted matroid,Mathematics,Difference polynomials | Journal |
Volume | Issue | ISSN |
339 | 2 | 0012-365X |
Citations | PageRank | References |
2 | 0.44 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Trygve Johnsen | 1 | 33 | 7.94 |
| jan roksvold | 2 | 2 | 0.44 |
| hugues verdure | 3 | 15 | 4.54 |