A generalization of weight polynomials to matroids

DOI10.1016/J.DISC.2015.10.005MaRDI QIDQ898121zbMATH OpenOpenAlexFDO

Authors Trygve Johnsen, Jan Roksvold, Hugues Verdure

Publication date 8 December 2015

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1311.6291

zbMATH Keywords

weight enumeratorlinear codematroidTutte polynomialhigher weightsStanley-Reisner ideal

Mathematics Subject Classification ID

Graph polynomials (05C31) Combinatorial aspects of finite geometries (05B25)

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 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.

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

• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• scientific article; zbMATH DE number 67325 (Why is no real title available?)
• scientific article; zbMATH DE number 952950 (Why is no real title available?)
• scientific article; zbMATH DE number 2124955 (Why is no real title available?)
• An interpretation for the Tutte polynomial
• Code Enumerators and Tutte Polynomials
• Codes, arrangements and matroids
• Hamming weights and Betti numbers of Stanley-Reisner rings associated to matroids
• Latroids and their representation by codes over modules
• Monomial Ideals
• On some polynomials related to weight enumerators of linear codes
• Stanley-Reisner resolution of constant weight linear codes
• The Magma algebra system. I: The user language
• Weight Enumeration and the Geometry of Linear Codes

Cited in

(25)

• On the Purity of Resolutions of Stanley-Reisner Rings Associated to Reed-Muller Codes
• Linear codes over signed graphs
• Strictness of the log-concavity of generating polynomials of matroids
• Harmonic Tutte polynomials of matroids
• MacWilliams identities and matroid polynomials
• Weight spectra of Gabidulin rank-metric codes and Betti numbers
• Distinct matroid base weights and additive theory
• Codes
• Finite geometry and permutation groups: some polynomial links
• Some matroids related to sum-rank metric codes
• Hamming weights and Betti numbers of Stanley-Reisner rings associated to matroids
• Harmonic Tutte polynomials of matroids II
• A MacWilliams type identity for matroids
• Higher support matroids
• Hamming polynomial of a demimatroid
• Generalized star configurations and the Tutte polynomial
• On the structure of matroids arising from the gain graphs
• A generalization of Kung's theorem
• Greedy weights for matroids
• On some polynomials related to weight enumerators of linear codes
• Betti numbers associated to the facet ideal of a matroid
• Pure resolutions, linear codes, and Betti numbers
• Counting polynomials for linear codes, hyperplane arrangements, and matroids
• Higher weight spectra of codes from Veronese threefolds
• Relative profiles and extended weight polynomials of almost affine codes

Describes a project that uses

Uses Software

• Magma

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)