Counting polynomials for linear codes, hyperplane arrangements, and matroids

MaRDI QIDQ2439235zbMATH OpenFDO

Authors Thomas Bächler, Wilhelm Plesken

Publication date 13 March 2014

Published in Documenta Mathematica (Search for Journal in Brave)

Full work available at URL http://www.emis.de/journals/DMJDMV/vol-19/09.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

hyperplane arrangementlinear codematroidrank generating polynomialThomas decompositionweight enumerator

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Computational aspects and applications of commutative rings (13P99) Linear codes (general theory) (94B05)

Review text

Counting polynomials for matroids, and in particular for linear codes and hyperplane arrangements, are examined using the Thomas decomposition of systems of polynomial equations and inequalities. This underlies a reformulation of characteristic polynomials and weight enumerators. A notion of ``essential flats is used to express rank generating polynomials as a sum of products of univariate polynomials. The polynomials that arise are examined in some detail for matroids of small rank.

Recommendations

• A generalization of weight polynomials to matroids
• Codes, arrangements and matroids
• MacWilliams identities and matroid polynomials
• On some polynomials related to weight enumerators of linear codes
• The Poincaré polynomial of a linear code

Cited in

(12)

• Mutation polynomials and oriented matroids
• The differential counting polynomial
• A construction of linear codes and strongly regular graphs from \(q\)-polynomials
• Enumerative coding for line polar Grassmannians with applications to codes
• Orbit-counting polynomials for graphs and codes
• Codes, arrangements and matroids
• scientific article; zbMATH DE number 2124955 (Why is no real title available?)
• An algorithmic approach to Chevalley’s Theorem on images of rational morphisms between affine varieties
• Combinatorial and geometric approaches to counting problems on linear matroids, graphic arrangements, and partial orders
• Coding and counting arrangements of pseudolines
• Computing the Tutte polynomial of a matroid from its lattice of cyclic flats
• A generalization of weight polynomials to matroids

Describes a project that uses

Uses Software

• DifferentialThomas
• GAP

This page was built for publication: Counting polynomials for linear codes, hyperplane arrangements, and matroids

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