pith. sign in

arxiv: 2504.00267 · v2 · submitted 2025-03-31 · 🧮 math.CO

Representability of Flag Matroids

Daniel Irving Bernstein , Nathaniel Vaduthala This is my paper

Pith reviewed 2026-05-22 21:28 UTC · model grok-4.3

classification 🧮 math.CO
keywords flag matroidsrepresentabilityaxiom systemforbidden minorsuniform flag matroidsregular flag matroidsfinite fields
0
0 comments X

The pith

A new axiom system for flag matroids enables characterizations of representability for uniform cases and forbidden-minor lists for full cases over F2, F3, and in the regular setting.

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

The paper supplies an alternative collection of axioms that capture flag matroids. With these axioms in hand the authors determine the precise conditions under which a uniform flag matroid arises from vectors over a field. They further isolate the smallest non-representable examples, expressed as forbidden minors, that distinguish full flag matroids representable over the fields with two and three elements as well as those that remain representable over every field.

Core claim

We provide a new axiom system for flag matroids, characterize representability of uniform flag matroids, and give forbidden minor characterizations of full flag matroids that are representable over F2 and F3 along with regular full flag matroids. We also provide different equivalent characterizations for regular full flag matroids.

What carries the argument

The new axiom system for flag matroids, which replaces earlier definitions and supports the subsequent representability theorems.

If this is right

  • Representability of any uniform flag matroid can be decided by checking a finite list of combinatorial conditions rather than searching for a linear representation.
  • A full flag matroid is representable over F2 precisely when it contains none of the forbidden minors identified for that field.
  • The same style of obstruction set decides representability over F3 and decides regularity for full flag matroids.
  • Regular full flag matroids admit several mutually equivalent descriptions that can be substituted for one another in proofs.

Where Pith is reading between the lines

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

  • The minor characterizations open the possibility of practical recognition algorithms limited to these small fields and the regular case.
  • The multiple equivalent definitions for regular full flag matroids may simplify arguments that mix flag matroids with other objects already known to be regular.
  • The new axioms could be used to re-derive older results about flag matroids in a more uniform way.

Load-bearing premise

The new axiom system produces exactly the same collection of objects as the standard definitions of flag matroids already in the literature.

What would settle it

A concrete flag matroid that satisfies every axiom in the new system yet fails to satisfy one of the prior definitions, or a full flag matroid that is representable over F2 while containing one of the listed forbidden minors.

Figures

Figures reproduced from arXiv: 2504.00267 by Daniel Irving Bernstein, Nathaniel Vaduthala.

Figure 1
Figure 1. Figure 1: Graphic representation of F(K4,P1,P2,P3,P4) 3.3 Minors and duality We now discuss minors and duality for flag matroids. Such concepts have already been defined for flag matroids as sequences of matroid lifts in [8] and [16]. Our contribution in this section is to extend this same minor and duality theory to our view of a flag matroid as a set system. Our motivation for studying flag matroid minors is to pr… view at source ↗
Figure 2
Figure 2. Figure 2: A graph whose matroid is a major of the graphic flag matroid [PITH_FULL_IMAGE:figures/full_fig_p014_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: From left to right, the graphs H1, H2, G2, G3. Define M1 := M(H1), M2 := M(H2) = M(G2), and M3 := M(G3). Then (M1, M2, M3) is the sequential representation of a full flag matroid F. Let N1 be the matroid of the graph obtained from H2 by adding an edge between the red vertices, and let N2 be the matroid of the graph obtained from G3 by adding a second edge between the red vertices. Then (N1, N2) is the lift… view at source ↗
Figure 4
Figure 4. Figure 4: From left to right, the graphs Gbb 3 and Grb 3 . On the graph level, (G3,P1) is formed from (G3,P2) by identifying two vertices together. If a black vertex in G2 is identified with a yellow vertex, the resulting graph would have three loops, and so the resulting graphic matroid would not be M1. A similar situation arises if the two yellow vertices are identified together. If the two black vertices are iden… view at source ↗
Figure 3
Figure 3. Figure 3: References [1] C. Benedetti, A. Chavez, and D. Tamayo. Quotients of uniform positroids. arXiv preprint arXiv:1912.06873, 2019. [2] C. Benedetti-Vel´asquez and K. Knauer. Lattice path matroids and quotients. Combinatorica, 44(3):621–650, 2024. [3] D. I. Bernstein. Generic symmetry-forced infinitesimal rigidity: translations and rotations. SIAM Journal on Applied Algebra and Geometry, 6(2):190–215, 2022. [4]… view at source ↗
read the original abstract

We provide a new axiom system for flag matroids, characterize representability of uniform flag matroids, and give forbidden minor characterizations of full flag matroids that are representable over $\mathbb{F}_2$ and $\mathbb{F}_3$ along with regular full flag matroids. We also provide different equivalent characterizations for regular full flag matroids.

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 / 0 minor

Summary. The manuscript introduces a new axiom system for flag matroids, characterizes representability of uniform flag matroids, and supplies forbidden-minor characterizations of full flag matroids representable over F2 and F3 together with regular full flag matroids; it also supplies alternative equivalent characterizations of regular full flag matroids.

Significance. If the new axiom system is equivalent to the standard definition of flag matroids and the characterizations are correctly proved, the work would supply concrete structural tools for studying representability questions in flag matroids, extending classical matroid results to the flag setting and potentially aiding classification efforts.

major comments (2)
  1. [Axiom system (likely §2 or §3)] The central claims presuppose that the new axiom system defines precisely the same objects as the existing literature on flag matroids. An explicit equivalence proof (both directions) between the new axioms and the standard definition must appear in the manuscript; its absence renders every subsequent representability and minor theorem conditional on an unverified translation.
  2. [Main theorems (likely §4–§6)] The abstract states the results but supplies no proofs, derivations, or verification steps. The full manuscript must therefore contain complete arguments for the uniform-flag representability characterization and for each forbidden-minor theorem; without them the soundness of the claims cannot be assessed.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for identifying these important points. We address each major comment below.

read point-by-point responses

  1. Referee: [Axiom system (likely §2 or §3)] The central claims presuppose that the new axiom system defines precisely the same objects as the existing literature on flag matroids. An explicit equivalence proof (both directions) between the new axioms and the standard definition must appear in the manuscript; its absence renders every subsequent representability and minor theorem conditional on an unverified translation.

    Authors: We agree that an explicit equivalence proof between the new axiom system and the standard definition of flag matroids is required. We have added a new subsection (now §2.3) containing a complete two-direction proof: every flag matroid in the sense of the literature satisfies our axioms, and every structure satisfying our axioms is a flag matroid according to the standard definition. revision: yes

  2. Referee: [Main theorems (likely §4–§6)] The abstract states the results but supplies no proofs, derivations, or verification steps. The full manuscript must therefore contain complete arguments for the uniform-flag representability characterization and for each forbidden-minor theorem; without them the soundness of the claims cannot be assessed.

    Authors: The full manuscript already contains the complete proofs. The representability characterization for uniform flag matroids is proved in full detail in §4, including all derivations. The forbidden-minor characterizations for representability over F2, over F3, and in the regular case are proved in §§5–6, with explicit verification steps for each minor. We have reviewed these sections and confirm they supply the required arguments; no further expansion appears necessary at this time. revision: no

Circularity Check

0 steps flagged

New axiom system introduced with no reduction to self-defined inputs or fitted predictions

full rationale

The paper introduces a new axiom system for flag matroids and derives representability and forbidden-minor characterizations from it. No equations, parameters, or predictions appear that reduce by construction to fitted inputs or self-referential definitions. The equivalence to prior definitions of flag matroids is a standard proof obligation in axiomatics and does not constitute circularity under the enumerated patterns; the derivation chain remains independent of self-citation load-bearing or ansatz smuggling. This is the normal non-finding for a self-contained mathematical paper.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

The central contribution is the new axiom system itself; without the full text the ledger of free parameters, background axioms, and invented entities cannot be populated beyond the standard mathematical background assumed by any matroid paper.

pith-pipeline@v0.9.0 · 5562 in / 958 out tokens · 19330 ms · 2026-05-22T21:28:05.248639+00:00 · methodology

discussion (0)

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

Reference graph

Works this paper leans on

30 extracted references · 30 canonical work pages

  1. [1]

    Benedetti, A

    C. Benedetti, A. Chavez, and D. Tamayo. Quotients of uniform p ositroids. arXiv preprint arXiv:1912.06873 , 2019

    work page arXiv 1912

  2. [2]

    Benedetti-Vel´ asquez and K

    C. Benedetti-Vel´ asquez and K. Knauer. Lattice path matroids and quotients. Combinatorica, 44(3):621–650, 2024

    work page 2024

  3. [3]

    D. I. Bernstein. Generic symmetry-forced infinitesimal rigidity: translations and rotations. SIAM Journal on Applied Algebra and Geometry , 6(2):190–215, 2022

    work page 2022

  4. [4]

    D. I. Bernstein and Z. Walsh. Matroid lifts and representability. The Elec- tronic Journal of Combinatorics , pages P1–15, 2024

    work page 2024

  5. [5]

    Bhargava

    M. Bhargava. P-orderings and polynomial functions on arbitrar y subsets of dedekind rings. Journal f¨ ur die reine und angewandte Mathematik (Crelles Journal), 1997(490-491):101–128, 1997. 20

    work page 1997

  6. [6]

    J. E. Bonin, C. Chun, and S. D. Noble. Delta-matroids as subsyst ems of sequences of higgs lifts. Advances in Applied Mathematics , 126:101910, 2021

    work page 2021

  7. [7]

    A. V. Borovik, I. M. Gelfand, N. White, A. V. Borovik, I. Gelfand, and N. White. Coxeter matroids . Springer, 2003

    work page 2003

  8. [8]

    Brandt, C

    M. Brandt, C. Eur, and L. Zhang. Tropical flag varieties, 2021

    work page 2021

  9. [9]

    Brylawski

    T. Brylawski. Constructions. In N. White, editor, Theory of matroids . Cam- bridge University Press, 1986

    work page 1986

  10. [10]

    Cameron, R

    A. Cameron, R. Dinu, M. Micha/suppress lek, and T. Seynnaeve. Flag matroids: alge- bra and geometry. In International Conference on Interactions with Lattice Polytopes, pages 73–114. Springer, 2017

    work page 2017

  11. [11]

    Cheung and H

    A. Cheung and H. Crapo. A combinatorial perspective on algebr aic geometry. Advances in Mathematics , 20(3):388–414, 1976

    work page 1976

  12. [12]

    Clinch, B

    K. Clinch, B. Jackson, and S. Tanigawa. Abstract 3-rigidity and bivariate c-2 (1)-splines ii: Combinatorial characterization. DISCRETE ANALYSIS, 2021

    work page 2021

  13. [13]

    A. De Mier. A natural family of flag matroids. SIAM Journal on Discrete Mathematics, 21(1):130–140, 2007

    work page 2007

  14. [14]

    R. Dinu, C. Eur, and T. Seynnaeve. K-theoretic tutte polynom ials of mor- phisms of matroids. Journal of Combinatorial Theory, Series A , 181:105414, 2021

    work page 2021

  15. [15]

    Fujishige and H

    S. Fujishige and H. Hirai. Compression of m-convex functions—fl ag matroids and valuated permutohedra. Journal of Combinatorial Theory, Series A , 185:105525, 2022

    work page 2022

  16. [16]

    Z. Garcia. Exploring flag matroids and duality. 2018

    work page 2018

  17. [17]

    Geelen, B

    J. Geelen, B. Gerards, and G. Whittle. Solving rota’s conjectur e. Notices of the AMS , 61(7):736–743, 2014

    work page 2014

  18. [18]

    J. F. Geelen, A. Gerards, and A. Kapoor. The excluded minors f or gf (4)- representable matroids. J. Comb. Theory, Ser. B , 79(2):247–299, 2000

    work page 2000

  19. [19]

    Grinberg and F

    D. Grinberg and F. Petrov. A greedoid and a matroid inspired by b hargava’s p-orderings. The Electronic Journal of Combinatorics , pages P3–6, 2021

    work page 2021

  20. [20]

    Grinberga

    D. Grinberga. The bhargava greedoid as a gaussian elimination gr eedoid. the electronic journal of combinatorics , 2020. 21

    work page 2020

  21. [21]

    D. Higgs. Strong maps of geometries. Journal of Combinatorial Theory , 5(2):185–191, 1968

    work page 1968

  22. [22]

    Jarra and O

    M. Jarra and O. Lorscheid. Flag matroids with coefficients. Advances in Mathematics, 436:109396, 2024

    work page 2024

  23. [23]

    D. Kennedy. Majors of geometric strong maps. Discrete Mathematics , 12(4):309–340, 1975

    work page 1975

  24. [24]

    Korte, R

    B. Korte, R. Schrader, and L. Lovasz. Greedoids. Algorithms and Combina- torics. Springer-Verlag Berlin Heidelberg, 1991

    work page 1991

  25. [25]

    J. Kung. Strong maps. Theory of matroids , pages 224–253, 1986

    work page 1986

  26. [26]

    J. P. Kung. The core extraction axiom for combinatorial geome tries. Discrete Mathematics, 19(2):167–175, 1977

    work page 1977

  27. [27]

    Mundhe, Y

    G. Mundhe, Y. M. Borse, and K. V. Dalvi. On graphic elementary lif ts of graphic matroids, 2019

    work page 2019

  28. [28]

    Nishimura and S

    H. Nishimura and S. Kuroda. A lost mathematician, Takeo Nakasawa: the forgotten father of matroid theory . Springer, 2009

    work page 2009

  29. [29]

    J. Oxley. Matroid Theory, 2nd Ed. Oxford Gradaute Studies in Math. Oxford University Press, 2011

    work page 2011

  30. [30]

    H. WHITNEY. On the abstract properties of linear dependence . Amer. J. Math., 57:509–533, 1935. 22

    work page 1935