Higher Rank-Support Weights and q-Polymatroids

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Imamura, Koji, Kawabuchi, Shinya, Shiromoto, Keisuke
Format: Preprint
Publié: 2026
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866918518129164288
author Imamura, Koji
Kawabuchi, Shinya
Shiromoto, Keisuke
author_facet Imamura, Koji
Kawabuchi, Shinya
Shiromoto, Keisuke
contents The aim of this paper is to develop a $(q,m)$-polymatroidal approach to higher supports and higher rank-weight enumerators of rank-metric codes. In this framework, we establish analogs of several fundamental results known for matroids and linear codes, including the description of minimal supports in terms of cocircuits of truncations and a Greene-type identity relating higher rank-weight enumerators to rank generating functions. We also show that the associated $(q,m)$-polymatroid and the higher support distributions determine each other. As a further application, we derive MacWilliams-type identities for higher rank-weight enumerators.
format Preprint
id arxiv_https___arxiv_org_abs_2605_23284
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Higher Rank-Support Weights and q-Polymatroids
Imamura, Koji
Kawabuchi, Shinya
Shiromoto, Keisuke
Combinatorics
The aim of this paper is to develop a $(q,m)$-polymatroidal approach to higher supports and higher rank-weight enumerators of rank-metric codes. In this framework, we establish analogs of several fundamental results known for matroids and linear codes, including the description of minimal supports in terms of cocircuits of truncations and a Greene-type identity relating higher rank-weight enumerators to rank generating functions. We also show that the associated $(q,m)$-polymatroid and the higher support distributions determine each other. As a further application, we derive MacWilliams-type identities for higher rank-weight enumerators.
title Higher Rank-Support Weights and q-Polymatroids
topic Combinatorics
url https://arxiv.org/abs/2605.23284