Counting polynomials for linear codes, hyperplane arrangements, and matroids (Q2439235)

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.