Greedy weights for matroids

DOI10.1007/S10623-020-00824-WMaRDI QIDQ2227131zbMATH OpenOpenAlexFDO

Authors Trygve Johnsen, Hugues Verdure

Publication date 10 February 2021

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

greedy weightslinear codesmatroidsWei duality

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Linear codes (general theory) (94B05)

Abstract: We introduce greedy weights of matroids, inspired by those for linear codes. We show that a Wei duality holds for two of these types of greedy weights for matroids. Moreover we show that in the cases where the matroids involved are associated to linear codes, our definitions coincide with those for codes. Thus our Wei duality is a generalization of that for linear codes given by Schaathun. In the last part of the paper we show how some important chains of cycles of the matroids appearing, correspond to chains of component maps of minimal resolutions of the independence complex of the corresponding matroids. We also relate properties of these resolutions to chainedness and greedy weights of the matroids, and in many cases codes, that appear.

Recommendations

• A generalization of weight polynomials to matroids
• Hamming weights and Betti numbers of Stanley-Reisner rings associated to matroids
• Higher support matroids
• Simple proofs for duality of generalized minimum poset weights and weight distributions of (near-)MDS poset codes
• A lower bound on the greedy weights of product codes

Cites work

• A lower bound on the greedy weights of product codes
• Antichain codes
• Generalized Hamming weights for linear codes
• Hamming weights and Betti numbers of Stanley-Reisner rings associated to matroids
• Higher Weight Spectra of Veronese Codes
• scientific article; zbMATH DE number 2081126 (Why is no real title available?)
• scientific article; zbMATH DE number 1504658 (Why is no real title available?)
• scientific article; zbMATH DE number 5873618 (Why is no real title available?)
• scientific article; zbMATH DE number 2190625 (Why is no real title available?)
• Linear codes over signed graphs
• Monomial Ideals
• On the second greedy weight for linear codes of dimension 3
• On the Second Greedy Weight for Linear Codes of Dimension at Least>tex<$4$>/tex<
• On the second relative greedy weight
• On the third greedy weight of 4-dimensional codes
• Stanley-Reisner resolution of constant weight linear codes
• Syzygies of oriented matroids
• Wei-type duality theorems for matroids
• Weight hierarchies of extremal non-chain binary codes of dimension 4

Cited in

(3)

• Further results on the second relative greedy weight of 3-dimensional codes
• Higher support matroids
• On the second relative greedy weight

This page was built for publication: Greedy weights for matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2227131)