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

Please sign up or login with your details

Continue with:
Or login with email
Enter Password
Re-enter Password

Forgot password? Click here to reset
Success!
Error Icon An error occurred

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×
Pro

Consider DeepAI Pro

Subscribe to DeepAI Pro
DeepAI Pro
Provides a limited generation allowance each month. When exceeded, you are charged overage rates available at deepai.org/pricing. Also includes an ad-free experience and API access. Renews automatically until canceled. Non-refundable.
Subtotal
Total due today

Payment

Add DeepAI credits
DeepAI credits
One-time purchase. Credits are added to your wallet after payment.
Subtotal
Total due today

Payment