Higher Rank-Support Weights and q-Polymatroids
Pith reviewed 2026-05-25 04:21 UTC · model grok-4.3
The pith
The (q,m)-polymatroid of a rank-metric code determines its higher support distributions and carries analogs of cocircuit, Greene, and MacWilliams identities.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
In the (q,m)-polymatroid model the associated polymatroid and the higher support distributions determine each other; minimal supports admit cocircuit descriptions from truncations; higher rank-weight enumerators satisfy Greene-type identities with rank generating functions; and the same enumerators satisfy MacWilliams-type identities.
What carries the argument
The (q,m)-polymatroid, which extends ordinary matroids to encode higher-rank supports and rank weights of rank-metric codes.
If this is right
- Higher support distributions are recoverable directly from the (q,m)-polymatroid.
- Minimal supports are characterized by cocircuits of appropriate truncations.
- Higher rank-weight enumerators are related to rank generating functions by a Greene-type identity.
- Higher rank-weight enumerators obey MacWilliams-type identities.
Where Pith is reading between the lines
- The same truncation-duality machinery may produce further identities for other generalized weights in rank-metric codes.
- Algorithms that compute polymatroid invariants could be adapted to evaluate higher rank weights efficiently.
- The mutual determination result may extend to q-analogs of other combinatorial objects that carry higher supports.
Load-bearing premise
The (q,m)-polymatroid model extends matroid properties to higher supports and rank weights without inconsistencies in truncation or duality operations.
What would settle it
A concrete rank-metric code whose computed higher support distribution fails to match the one recovered from its (q,m)-polymatroid, or whose enumerators violate a derived Greene or MacWilliams identity.
read the original abstract
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.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper develops a (q,m)-polymatroidal framework for studying higher supports and higher rank-weight enumerators of rank-metric codes. It proves that the associated (q,m)-polymatroid and the higher support distributions determine each other, establishes analogs of cocircuit descriptions of minimal supports via truncations, derives a Greene-type identity relating higher rank-weight enumerators to rank generating functions, and obtains MacWilliams-type identities for the enumerators.
Significance. If the derivations hold, the work supplies a direct polymatroidal unification of several classical results from matroid theory and coding theory for the rank-metric setting. The mutual determination result and the explicit identities derived from the rank function definitions constitute parameter-free relations that strengthen the link between higher-weight distributions and the underlying combinatorial structure.
minor comments (3)
- The notation for the higher support distribution and the (q,m)-polymatroid rank function should be introduced with an explicit comparison table to the classical matroid case to improve readability.
- Several statements in the introduction refer to 'the truncation' without specifying which truncation operator (e.g., the one defined in Definition 2.4 or the iterated version) is intended; add a forward reference.
- The proof of the MacWilliams-type identity in the final section relies on an auxiliary generating function whose normalization constant is stated without derivation; include the short calculation or a reference to the classical case.
Simulated Author's Rebuttal
We thank the referee for their positive summary and significance assessment of our manuscript on the (q,m)-polymatroid framework for higher supports and rank-weight enumerators in rank-metric codes. The recommendation of minor revision is noted; however, the report lists no specific major comments requiring response.
Circularity Check
No significant circularity; derivations self-contained from definitions
full rationale
The paper defines the (q,m)-polymatroid rank function from the higher support distributions of rank-metric codes and proves mutual determination, cocircuit descriptions via truncations, Greene-type identities, and MacWilliams-type identities directly from those definitions and standard matroid operations. No step reduces a claimed prediction or identity to a fitted parameter or self-citation by construction; all relations are established via explicit verification of compatibility under truncation and duality. The framework extends prior matroid and coding theory results without load-bearing self-referential loops.
Axiom & Free-Parameter Ledger
Reference graph
Works this paper leans on
-
[1]
T. Britz. Higher support matroids.Discrete Math., 307(17-18):2300–2308, 2007
work page 2007
-
[2]
T. Britz. Code enumerators and Tutte polynomials.IEEE Trans. Inform. Theory, 56(9):4350– 4358, 2010
work page 2010
- [3]
- [4]
-
[5]
M. Gadouleau and Z. Yan. MacWilliams identity for the rank metric. InProceedings of the 2007 IEEE International Symposium on Information Theory, pages 2486–2490, 2007
work page 2007
-
[6]
S. R. Ghorpade and T. Johnsen. A polymatroid approach to generalized weights of rank metric codes.Des. Codes Cryptogr., 88(12):2531–2546, 2020
work page 2020
-
[7]
H. Gluesing-Luerssen and B. Jany.q-polymatroids and their relation to rank-metric codes.J. Algebraic Combin., 56(3):725–753, 2022
work page 2022
-
[8]
H. Gluesing-Luerssen and B. Jany. Polynomial invariants ofq-matroids and rank-metric codes,
- [9]
- [10]
-
[11]
C. Greene. Weight enumeration and the geometry of linear codes.Studies in Appl. Math., 55(2):119–128, 1976
work page 1976
-
[12]
T. Kløve. Support weight distribution of linear codes.Discrete Mathematics, 106-107:311–316, 1992
work page 1992
-
[13]
T. H. Koornwinder. Special functions and q-commuting variables. In M. E. H. Ismail, D. R. Masson, and M. Rahman, editors,Special Functions, q-Series and Related Topics, volume 14 of Fields Institute Communications, pages 131–166. American Mathematical Society, 1997
work page 1997
-
[14]
A. Lupas. Aq-analogue of the Bernstein operator. InSeminar on numerical and statistical calculus, University of Cluj-Napoca, volume 9, 1987
work page 1987
- [15]
- [16]
-
[17]
R. P. Stanley.Enumerative Combinatorics, volume 2. Cambridge University Press, 1999. 24
work page 1999
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.