The Critical Theorem for q-Polymatroids

05/12/2023
by   Gianira N. Alfarano, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/04/2022

The Projectivization Matroid of a q-Matroid

In this paper, we investigate the relation between a q-matroid and its a...
research
12/07/2020

A Note on John Simplex with Positive Dilation

We prove a Johns theorem for simplices in R^d with positive dilation fac...
research
08/30/2022

On the exponent of cyclic codes

We propose an algorithm to find a lower bound for the number of cyclic c...
research
04/10/2020

Modular and fractional L-intersecting families of vector spaces

In the first part of this paper, we prove a theorem which is the q-analo...
research
05/21/2020

On the cop number of graphs of high girth

We establish a lower bound for the cop number of graphs of high girth in...
research
04/26/2023

MacWilliams' Extension Theorem for rank-metric codes

The MacWilliams' Extension Theorem is a classical result by Florence Jes...
research
10/29/2022

The Vector Balancing Constant for Zonotopes

The vector balancing constant vb(K,Q) of two symmetric convex bodies K,Q...

Please sign up or login with your details

Forgot password? Click here to reset