A generalization of weight polynomials to matroids
From MaRDI portal
Publication:898121
DOI10.1016/J.DISC.2015.10.005zbMATH Open1327.05047arXiv1311.6291OpenAlexW2141337289MaRDI QIDQ898121FDOQ898121
Authors: Trygve Johnsen, Jan Roksvold, Hugues Verdure 
Publication date: 8 December 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Abstract: Generalizing polynomials previously studied in the context of linear codes, we define weight polynomials and an enumerator for a matroid . Our main result is that these polynomials are determined by Betti numbers associated with graded minimal free resolutions of the Stanley-Reisner ideals of and so-called elongations of . Generalizing Greene's theorem from coding theory, we show that the enumerator of a matroid is equivalent to its Tutte polynomial.
Full work available at URL: https://arxiv.org/abs/1311.6291
Recommendations
- MacWilliams identities and matroid polynomials
- Harmonic Tutte polynomials of matroids
- Counting polynomials for linear codes, hyperplane arrangements, and matroids
- Hamming weights and Betti numbers of Stanley-Reisner rings associated to matroids
- On some polynomials related to weight enumerators of linear codes
Cites Work
- The Magma algebra system. I: The user language
- Title not available (Why is that?)
- Title not available (Why is that?)
- Monomial Ideals
- Codes, arrangements and matroids
- Title not available (Why is that?)
- Weight Enumeration and the Geometry of Linear Codes
- Hamming weights and Betti numbers of Stanley-Reisner rings associated to matroids
- An interpretation for the Tutte polynomial
- Stanley-Reisner resolution of constant weight linear codes
- Code Enumerators and Tutte Polynomials
- On some polynomials related to weight enumerators of linear codes
- Latroids and their representation by codes over modules
- Title not available (Why is that?)
Cited In (25)
- Strictness of the log-concavity of generating polynomials of matroids
- MacWilliams identities and matroid polynomials
- Relative profiles and extended weight polynomials of almost affine codes
- Generalized star configurations and the Tutte polynomial
- Linear codes over signed graphs
- Higher weight spectra of codes from Veronese threefolds
- Finite geometry and permutation groups: some polynomial links
- Counting polynomials for linear codes, hyperplane arrangements, and matroids
- Codes
- Greedy weights for matroids
- Harmonic Tutte polynomials of matroids
- Some matroids related to sum-rank metric codes
- Higher support matroids
- A generalization of Kung's theorem
- Weight spectra of Gabidulin rank-metric codes and Betti numbers
- Hamming polynomial of a demimatroid
- Harmonic Tutte polynomials of matroids II
- Pure resolutions, linear codes, and Betti numbers
- Distinct matroid base weights and additive theory
- On the structure of matroids arising from the gain graphs
- Betti numbers associated to the facet ideal of a matroid
- A MacWilliams type identity for matroids
- On the Purity of Resolutions of Stanley-Reisner Rings Associated to Reed-Muller Codes
- Hamming weights and Betti numbers of Stanley-Reisner rings associated to matroids
- On some polynomials related to weight enumerators of linear codes
Uses Software
This page was built for publication: A generalization of weight polynomials to matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898121)
