Möbius and coboundary polynomials for matroids

DOI10.1007/s10623-021-00906-3zbMath1472.05162OpenAlexW3176672507MaRDI QIDQ1981797

Hugues Verdure, Trygve Johnsen

Publication date: 6 September 2021

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

Full work available at URL: https://doi.org/10.1007/s10623-021-00906-3

zbMATH Keywords

matroidsBetti numberscoboundary polynomialsMöbius polynomials

Mathematics Subject Classification ID

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

Related Items (1)

Weight spectra of Gabidulin rank-metric codes and Betti numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorics and topology of complements of hyperplanes
• Hamming weights and Betti numbers of Stanley-Reisner rings associated to matroids
• Relations between Möbius and coboundary polynomials
• Truncation formulas for invariant polynomials of matroids and geometric lattices
• Pure resolutions, linear codes, and Betti numbers
• Stanley-Reisner resolution of constant weight linear codes
• Higher support matroids
• On the bettinumbers of finite pure and linear resolutions
• Monomial Ideals
• Higher Weight Spectra of Veronese Codes
• Code Enumerators and Tutte Polynomials

This page was built for publication: Möbius and coboundary polynomials for matroids