pith. sign in

arxiv: 2605.15780 · v1 · pith:B6YT5PCGnew · submitted 2026-05-15 · 🧮 math.CO

Representability of q-matroids via rank-metric codes

Gianira N. Alfarano , Sebastian Degen This is my paper

Pith reviewed 2026-05-20 17:08 UTC · model grok-4.3

classification 🧮 math.CO MSC 05B35
keywords q-matroidsmultilinear representabilityrank-metric codesuniform q-matroidsnon-Pappus q-matroidalmost affine codesrepresentability
0
0 comments X

The pith

Nontrivial uniform q-matroids admit no purely multilinear representations through rank-metric codes.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper extends multilinear representability from matroids to q-matroids by using subspaces assigned via almost affine matrix rank-metric codes. It introduces m-multilinear representability defined by a divisibility condition on these codes. The work proves that no nontrivial uniform q-matroid has a purely multilinear representation. It also shows that the non-Pappus q-matroid requires a block size of at least 9 for any multilinear representation and that no rank-2 q-matroid on F_2^4 can be purely m-multilinear for intermediate m values. These results come from classifying small cases over small fields where no purely multilinear examples appear.

Core claim

By defining m-multilinear representability for q-matroids in terms of almost affine matrix rank-metric codes that satisfy a natural divisibility condition, the authors establish that nontrivial uniform q-matroids admit no purely multilinear representations, derive necessary conditions for almost uniform q-matroids, show that the non-Pappus q-matroid needs block size at least 9 if representable, and prove that no rank-2 q-matroid on F_2^4 admits a purely m-multilinear representation for 1 < m < 4, while classifying all cases on F_2^3 and F_2^4.

What carries the argument

m-multilinear representability, defined using almost affine matrix rank-metric codes satisfying a divisibility condition, which extends classical multilinear representability to the q-matroid setting.

If this is right

  • Nontrivial uniform q-matroids have no purely multilinear representations.
  • Almost uniform q-matroids must meet specific necessary conditions to be multilinearly representable.
  • The non-Pappus q-matroid, if multilinearly representable, requires a block size of at least 9.
  • No rank-2 q-matroid on F_2^4 admits a purely m-multilinear representation when 1 < m < 4.
  • q-matroids on F_2^3 and F_2^4 have their pure multilinearity fully classified in the relevant ranges.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • If the pattern holds, most or all q-matroids may lack purely multilinear representations, pointing to a fundamental difference from classical matroids.
  • The link between q-matroids and rank-metric codes could be used to construct new families of codes with specific properties.
  • Searching for multilinear representations over larger finite fields or with bigger block sizes might yield the first examples of purely multilinear q-matroids.

Load-bearing premise

The proposed definition of m-multilinear representability using almost affine matrix rank-metric codes with a divisibility condition accurately extends the classical notion to q-matroids.

What would settle it

An explicit construction of a purely multilinear representation for any nontrivial uniform q-matroid, or for a rank-2 q-matroid on F_2^4 with 1<m<4, would disprove the non-representability claims.

Figures

Figures reproduced from arXiv: 2605.15780 by Gianira N. Alfarano, Sebastian Degen.

Figure 1
Figure 1. Figure 1: Non-Pappus configuration. A multilinear representation of this matroid can be constructed as follows. Let F = (F3) 2 , so that the block size is m = 2, and consider the code C ⊆ F 9 defined as the F3-row space of the matrix   10 10 00 10 00 10 10 10 00 01 01 00 01 00 01 01 01 00 00 00 00 10 10 21 01 10 10 00 00 00 02 01 20 12 02 01 00 10 10 01 00 01 00 11 10 00 01 01 21 00 21 00 10 01   , w… view at source ↗
Figure 2
Figure 2. Figure 2: 1st slice space [PITH_FULL_IMAGE:figures/full_fig_p008_2.png] view at source ↗
read the original abstract

Multilinear representability extends classical linear representability of matroids by assigning subspaces, rather than vectors, to ground elements. This notion is closely related to almost affine codes. In this paper, we introduce and study a $q$-analogue of multilinear representability for $q$-matroids, motivated by known connections between $q$-matroids, classical matroids, and rank-metric codes. We define $m$-multilinear representability in terms of almost affine matrix rank-metric codes satisfying a natural divisibility condition. We prove that nontrivial uniform $q$-matroids admit no purely multilinear representations, and we derive necessary conditions for multilinear representations of almost uniform $q$-matroids. We further show that the non-Pappus $q$-matroid, if multilinearly representable, must have block size at least $9$. Finally, we prove that no rank-$2$ $q$-matroid on $\mathbb{F}_2^4$ admits a purely $m$-multilinear representation for $1<m<4$, and we classify pure multilinearity for all $q$-matroids on $\mathbb{F}_2^3$ and $\mathbb{F}_2^4$ in the corresponding ranges. At present, no example is known of a purely multilinear $q$-matroid.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript introduces m-multilinear representability for q-matroids, defined via the existence of almost affine matrix rank-metric codes whose column spaces satisfy a natural divisibility condition on dimensions. It proves that nontrivial uniform q-matroids admit no purely multilinear representations, derives necessary conditions for almost uniform q-matroids, shows that the non-Pappus q-matroid (if multilinearly representable) requires block size at least 9, proves that no rank-2 q-matroid on F_2^4 admits a purely m-multilinear representation for 1<m<4, and classifies pure multilinearity for all q-matroids on F_2^3 and F_2^4 in the corresponding ranges. No example of a purely multilinear q-matroid is known.

Significance. If the definition correctly extends classical multilinear representability, the non-representability theorems supply concrete obstructions that narrow the search for representable q-matroids and strengthen the link between q-matroids and rank-metric codes. The explicit classification on small ground sets (F_2^3, F_2^4) is immediately usable, and the block-size lower bound for the non-Pappus example is a falsifiable prediction. These results are proportionate to the novelty of the q-analogue and would be of interest to researchers working at the intersection of matroid theory, q-analogues, and coding theory.

major comments (2)
  1. [§3, Definition 3.4] §3, Definition 3.4 (m-multilinear representability): The definition is given in terms of almost affine matrix rank-metric codes plus a divisibility condition on column-space dimensions. It is not shown explicitly that this recovers ordinary multilinear representability of a matroid when the underlying vector space is 1-dimensional or when m=1 reduces to linear representability. Without this reduction check, the non-representability claims (e.g., for uniform q-matroids) do not yet rule out the intended q-analogues of the classical notion.
  2. [Theorem 5.3] Theorem 5.3 (non-Pappus q-matroid): The argument that any multilinear representation requires block size at least 9 rests on the divisibility condition forcing a dimension contradiction with the non-Pappus configuration. If the divisibility condition is stricter than the classical subspace-assignment axioms, the bound may not apply to all conceivable q-analogues; an explicit comparison with the classical non-Pappus matroid (when q=1) would clarify the scope.
minor comments (2)
  1. [§2] Notation for the ground set and the underlying field is introduced in §2 but reused without re-statement in later theorems; a short table of symbols would improve readability.
  2. [§6] In the classification tables for q-matroids on F_2^3 and F_2^4, the column headings for m and block size are not repeated on continuation pages; this is a minor formatting issue.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments. We address the two major comments point by point below and indicate the revisions we will make.

read point-by-point responses

  1. Referee: [§3, Definition 3.4] §3, Definition 3.4 (m-multilinear representability): The definition is given in terms of almost affine matrix rank-metric codes plus a divisibility condition on column-space dimensions. It is not shown explicitly that this recovers ordinary multilinear representability of a matroid when the underlying vector space is 1-dimensional or when m=1 reduces to linear representability. Without this reduction check, the non-representability claims (e.g., for uniform q-matroids) do not yet rule out the intended q-analogues of the classical notion.

    Authors: We agree that an explicit reduction check is desirable to confirm the definition is a faithful q-analogue. In the revised manuscript we will add a short subsection immediately after Definition 3.4 that verifies the following two special cases: (i) when the base field extension degree is 1 (q=1), the almost-affine matrix rank-metric code and the divisibility condition on column-space dimensions reduce precisely to the classical definition of multilinear representability; (ii) when m=1 the construction collapses to ordinary linear representability over the q-field. This addition will ensure that the non-representability results for uniform q-matroids apply directly to the intended q-analogues. revision: yes

  2. Referee: [Theorem 5.3] Theorem 5.3 (non-Pappus q-matroid): The argument that any multilinear representation requires block size at least 9 rests on the divisibility condition forcing a dimension contradiction with the non-Pappus configuration. If the divisibility condition is stricter than the classical subspace-assignment axioms, the bound may not apply to all conceivable q-analogues; an explicit comparison with the classical non-Pappus matroid (when q=1) would clarify the scope.

    Authors: We thank the referee for highlighting the need for an explicit comparison. In the revised proof of Theorem 5.3 we will insert a paragraph that treats the q=1 case separately. We show that the divisibility condition on column-space dimensions reduces exactly to the subspace-dimension constraints appearing in the classical multilinear representation of the non-Pappus matroid. Consequently the derived lower bound of block size 9 is consistent with the classical setting, where the non-Pappus matroid is known to require large fields for multilinear representability. This comparison confirms that our condition is not stricter than the classical axioms and that the bound applies to the natural q-analogue. revision: yes

Circularity Check

0 steps flagged

No significant circularity: new definition yields derived non-representability theorems

full rationale

The paper introduces a fresh definition of m-multilinear representability for q-matroids via almost affine matrix rank-metric codes plus a divisibility condition on column-space dimensions. All listed results (non-representability of nontrivial uniform q-matroids, necessary conditions for almost-uniform cases, block-size lower bound for the non-Pappus q-matroid, and classification for small ground sets) are stated as consequences of this definition. No quoted step reduces a claimed theorem to a fitted parameter, a self-citation chain, or a renaming of an input; the derivation chain is therefore self-contained once the definition is accepted.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The paper relies on established background in q-matroids and rank-metric codes rather than introducing free parameters or new entities; the central advance is a definitional extension with derived consequences.

axioms (1)
  • standard math Known connections between q-matroids, classical matroids, and rank-metric codes
    The motivation section explicitly builds the new definition upon these prior links.

pith-pipeline@v0.9.0 · 5770 in / 1356 out tokens · 147269 ms · 2026-05-20T17:08:39.225257+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. The geometry of rank-metric codes

    math.CO 2026-05 unverdicted novelty 7.0

    A correspondence is built between nondegenerate matrix rank-metric codes and geometric systems, producing Delsarte-type incidence identities plus applications to generalized weights and semifields.

Reference graph

Works this paper leans on

30 extracted references · 30 canonical work pages · cited by 1 Pith paper

  1. [1]

    G. N. Alfarano, M. Borello, and A. Neri. The geometry of matrix rank-metric codes.In preparation, 2026

    work page 2026

  2. [2]

    G. N. Alfarano, M. Borello, A. Neri, and A. Ravagnani. Linear cutting blocking sets and minimal codes in the rank metric.J. Comb. Theory Ser. A., 192:105658, 2022

    work page 2022

  3. [3]

    G. N. Alfarano and E. Byrne. The cyclic flats of aq-matroid.J. Algebr. Comb., 60(1):97–126, 2024

    work page 2024

  4. [4]

    Beimel, A

    A. Beimel, A. Ben-Efraim, C. Padr´ o, and I. Tyomkin. Multi-linear secret-sharing schemes. InTheory of Cryptography Conference, pages 394–418. Springer, 2014

    work page 2014

  5. [5]

    Byrne, M

    E. Byrne, M. Ceria, S. Ionica, and R. Jurrius. Weighted subspace designs fromq-polymatroids.J. Comb. Theory Ser. A., 201:105799, 2024

    work page 2024

  6. [6]

    Byrne, M

    E. Byrne, M. Ceria, and R. Jurrius. Constructions of newq-cryptomorphisms.J. Comb. Theory Ser. B., 153:149–194, 2022

    work page 2022

  7. [7]

    Byrne, A

    E. Byrne, A. Neri, A. Ravagnani, and J. Sheekey. Tensor representation of rank-metric codes.SIAM J. Appl. Algebra Geom., 3(4):614–643, 2019

    work page 2019

  8. [8]

    Ceria and R

    M. Ceria and R. Jurrius. Alternatives for theq-matroid axioms of independent spaces, bases, and spanning spaces.Adv. Appl. Math., 153:102632, 2024

    work page 2024

  9. [9]

    Ceria and R

    M. Ceria and R. Jurrius. The direct sum ofq-matroids.J. Algebr. Comb., 59(2):291–330, 2024

    work page 2024

  10. [10]

    de la Cruz, E

    J. de la Cruz, E. Gorla, H. H. L´ opez, and A. Ravagnani. Weight distribution of rank-metric codes.Des. Codes Cryptogr., 86(1):1–16, 2018

    work page 2018

  11. [11]

    Degen and L

    S. Degen and L. K¨ uhne. Mostq-matroids are not representable.arXiv preprint arXiv:2408.06795, 2024

    work page arXiv 2024

  12. [12]

    Degen and L

    S. Degen and L. K¨ uhne. On the enumeration ofq-matroids, 2026+. In preparation

    work page 2026

  13. [13]

    Delsarte

    P. Delsarte. Bilinear forms over a finite field, with applications to coding theory.J. Comb. Theory Ser. A., 25(3):226–241, 1978

    work page 1978

  14. [14]

    El Rouayheb, A

    S. El Rouayheb, A. Sprintson, and C. Georghiades. On the index coding problem and its relation to network coding and matroid theory.IEEE Trans. Inf. Theory, 56(7):3187–3195, 2010

    work page 2010

  15. [15]

    E. M. Gabidulin. Theory of codes with maximum rank distance.Problemy Peredachi Informatsii, 21(1):3–16, 1985

    work page 1985

  16. [16]

    Gluesing-Luerssen and B

    H. Gluesing-Luerssen and B. Jany. Independent spaces ofq-polymatroids.Algebr. Comb., 5(4):727–744, 2022

    work page 2022

  17. [17]

    Gluesing-Luerssen and B

    H. Gluesing-Luerssen and B. Jany.q-Polymatroids and their relation to rank-metric codes.J. Algebr. Comb., 56(3):725–753, 2022

    work page 2022

  18. [18]

    Gluesing-Luerssen and B

    H. Gluesing-Luerssen and B. Jany. Representability of the direct sum ofq-matroids.J. Algebr. Comb., 61(4):51, 2025

    work page 2025

  19. [19]

    E. Gorla. Rank-metric codes. InConcise Encyclopedia of Coding Theory, pages 227–250. Chapman and Hall/CRC, 2021

    work page 2021

  20. [20]

    Gorla, R

    E. Gorla, R. Jurrius, H. H. L´ opez, and A. Ravagnani. Rank-metric codes andq-polymatroids.J. Algebr. Comb., 52:1–19, 2020

    work page 2020

  21. [21]

    Imamura, S

    K. Imamura, S. Kawabuchi, and K. Shiromoto. On the one-dimensional extensions ofq-matroids.arXiv preprint arXiv:2503.06830, 2025

    work page arXiv 2025

  22. [22]

    B. Jany. The projectivization matroid of aq-matroid.SIAM J. Appl. Algebra Geom., 7(2):386–413, 2023

    work page 2023

  23. [23]

    Jurrius and G

    R. Jurrius and G. Pellikaan. Defining theq-analogue of a matroid.Electron. J. Comb., 25(3), 2018

    work page 2018

  24. [24]

    K¨ uhne, R

    L. K¨ uhne, R. Pendavingh, and G. Yashfe. Von Staudt constructions for skew-linear and multilinear matroids. Comb. Theory, 3(1), 2023

    work page 2023

  25. [25]

    K¨ uhne and G

    L. K¨ uhne and G. Yashfe. Representability of matroids byc-arrangements is undecidable.Isr. J. Math., 252(1):95–147, 2022

    work page 2022

  26. [26]

    K¨ uhne and G

    L. K¨ uhne and G. Yashfe. On entropic and almost multilinear representability of matroids.Duke Math. J., 1(1):1–89, 2026

    work page 2026

  27. [27]

    Oxley.Matroid Theory

    J. Oxley.Matroid Theory. Oxford University Press, second edition, 2011

    work page 2011

  28. [28]

    R. A. Pendavingh and S. H. van Zwam. Skew partial fields, multilinear representations of matroids, and a matrix tree theorem.Adv. Appl. Math., 50(1):201–227, 2013

    work page 2013

  29. [29]

    Shiromoto

    K. Shiromoto. Codes with the rank metric and matroids.Des. Codes Cryptogr., 87(8):1765–1776, 2019

    work page 2019

  30. [30]

    Simonis and A

    J. Simonis and A. Ashikhmin. Almost affine codes.Des. Codes Cryptogr., 14(2):179–197, 1998

    work page 1998