The Critical Theorem for q-Polymatroids

arXiv2305.07567MaRDI QIDQ6436403FDOQ6436403

Authors: Gianira N. Alfarano, Eimear Byrne 

Publication date: 12 May 2023

Abstract: The Critical Theorem, due to Henry Crapo and Gian-Carlo Rota, has been extended and generalised in many ways. In this paper, we describe properties of the characteristic polynomial of a weighted lattice showing that it has a recursive description. We use this to obtain results on critical exponents of $q$-polymatroids. We prove a Critical Theorem for representable $q$-polymatroids and we provide a lower bound on the critical exponent. We show that certain families of rank-metric codes attain this lower bound.

This page was built for publication: The Critical Theorem for q-Polymatroids

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