pith. machine review for the scientific record. sign in

arxiv: 2605.12336 · v1 · submitted 2026-05-12 · 🧮 math.CO

Recognition: 1 theorem link

· Lean Theorem

The polytope of all matroids in ranks 2 and 3

Narayan Collins, Victoria Schleis

Pith reviewed 2026-05-13 03:54 UTC · model grok-4.3

classification 🧮 math.CO MSC 05B35
keywords matroidpolytoperecursive constructionconvex hullvaluative invariantSchubert expansionrank 2 matroidrank 3 matroid
0
0 comments X

The pith

Recursive constructions generate the exact polytopes of all matroids in ranks 2 and 3 for any ground set size.

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

The paper supplies explicit recursive rules that build the polytope Ω_{r,n} as the convex hull of the indicator vectors of all rank-r matroids on n elements, for r equal to 2 or 3. These rules start from small ground sets and systematically enlarge the collection of vertices while preserving the matroid property. The constructions are accompanied by code that enumerates the vertices up to n=33 for rank 2 and n=10 for rank 3, plus Schubert expansions for all isomorphism types in those ranges. A sympathetic reader would care because the polytope offers a concrete geometric testbed for positivity questions about valuative invariants: any linear functional that is nonnegative on the polytope must be nonnegative on every matroid.

Core claim

The authors prove that the polytopes Ω_{2,n} and Ω_{3,n} admit recursive descriptions: given the polytope for smaller ground sets, one applies a finite list of combinatorial operations that add a new element and produce precisely the new matroid vertices needed for the larger ground set. The resulting vertex set is shown to be exactly the set of all 0-1 vectors that arise from rank-r matroids, so the convex hull matches the true matroid polytope with no missing or extraneous points.

What carries the argument

The polytope Ω_{r,n} defined as the convex hull of the indicator vectors of the bases of every rank-r matroid on an n-element ground set, together with the explicit recursive rules that enlarge this polytope by adjoining a new element while staying inside the matroid class.

If this is right

  • The full list of vertices of Ω_{2,n} can be generated for every n up to 33 and of Ω_{3,n} up to n=10.
  • Schubert expansions are obtained for every isomorphism class of rank-2 matroids on up to 80 elements and every rank-3 matroid on up to 11 elements.
  • Any linear functional nonnegative on the constructed polytope is nonnegative on every matroid of the given rank and size.
  • Positivity conjectures for valuative invariants become decidable by linear programming over these explicitly described polytopes for the listed ranges of n.

Where Pith is reading between the lines

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

  • The recursive pattern may suggest a uniform description that works for higher ranks as well, although the paper stops at ranks 2 and 3.
  • The computed vertices for large n could be mined for new extremal examples or for the discovery of additional linear inequalities that cut out the matroid polytope.
  • The tabulated Schubert expansions supply concrete data that could be compared with expansions arising from other combinatorial models such as positroids or flag matroids.

Load-bearing premise

The recursive rules produce exactly the indicator vectors of all rank-r matroids on n elements and nothing else.

What would settle it

A single 0-1 vector that arises from a rank-2 or rank-3 matroid yet cannot be obtained by applying the stated recursive rules to smaller instances, or a vector generated by the rules that fails to be the indicator of any matroid.

Figures

Figures reproduced from arXiv: 2605.12336 by Narayan Collins, Victoria Schleis.

Figure 1
Figure 1. Figure 1: To the left, the lattice of cyclic flats Z(M), and to the right, the cyclic chain lattice CZ(M), both seen in Example 2.6. Remark 2.7. For a matroid M, every chain of Z(M) containing the maximal element M and the minimal element (the union of all loops in the matroid) corresponds to a Schubert matroid of the same size and rank. ♦ 2.2. Schubert expansion and the polytope of all all matroids. We now recall S… view at source ↗
Figure 2
Figure 2. Figure 2: Examples of the four types of lattice paths giving rise to the four different types of Schubert matroids in Theorem 3.1. This decomposition allows the construction of the polytope of all matroids. For a Schubert matroid S, we write λS = X C∈CZ (M) C∼=Z(S) µ(C, 1ˆ). Using this decomposition, the sum in Theorem 2.10 can instead be rewritten in terms of Schubert matroids. We conclude by defining the polytope … view at source ↗
Figure 3
Figure 3. Figure 3: Lattices of cyclic flats for the non-Schubert matroids obtained via insertion on S(1, 3, 4) (left) and S(1, 2, 4) (right). Next, we consider insertion on M3,4. Since insertion disregards loops and S(2, 3, 4) is isomorphic to U3,3 with an added loop, insertion on S(1, 2, 3) = U3,4 or S(2, 3, 4) produces a Schubert matroid. There are two remaining Schubert matroids in S3,4. We now consider insertions on thes… view at source ↗
read the original abstract

We give explicit recursive constructions for the polytope of all matroids $\Omega_{r,n}$ in ranks 2 and 3 for all ground set sizes. This polytope was introduced in recent work by Ferroni and Fink as a tool for checking positivity conjectures for valuative invariants. We supplement our theoretical construction by an implementation, which allows for the computation of $\Omega_{2,n}$ for $n\leq 33$ and $\Omega_{3,n}$ for $n\leq 10$. Further, we compute Schubert expansions for all isomorphism classes of matroids of rank $2$ up to $n = 80$, and for rank $3$ up to $n = 11$.

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 presents explicit recursive constructions for the polytopes Ω_{2,n} and Ω_{3,n} consisting of the convex hulls of the 0-1 indicator vectors of all matroids of rank 2 and 3 on an n-element ground set. These constructions are accompanied by a computational implementation that enumerates the vertices for n ≤ 33 (rank 2) and n ≤ 10 (rank 3), together with Schubert expansions of all isomorphism classes of rank-2 matroids up to n=80 and rank-3 matroids up to n=11.

Significance. If the recursions are shown to generate precisely the matroid indicator vectors, the work supplies a concrete tool for testing positivity conjectures on valuative invariants, as introduced by Ferroni and Fink. The explicit rules plus working implementation up to moderately large n constitute a practical advance; the provision of reproducible code and large-scale Schubert data is a clear strength that enables independent checks and further applications in algebraic combinatorics.

major comments (2)
  1. [§3] §3 (rank-2 recursion): the manuscript states that the recursive rules produce exactly the vertices of Ω_{2,n}, yet provides no direct verification that the generated points coincide with the known list of matroid indicator vectors for small n where complete enumeration is available (e.g., n=4,5,6). Such a comparison is load-bearing for the central claim.
  2. [§4] §4 (rank-3 recursion): analogous to the rank-2 case, the rules are asserted to yield the convex hull, but no explicit check against the known matroid counts or vertex lists is given for n≤10, the range where the implementation is feasible and the complete set of matroids is known.
minor comments (2)
  1. The implementation section would benefit from a brief pseudocode outline or repository link so that the recursion can be inspected independently of the compiled binary.
  2. Notation for the successive polytopes Ω_{r,n} and the added-element operation could be introduced more explicitly in the introduction to aid readers unfamiliar with the Ferroni-Fink framework.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and for emphasizing the value of explicit small-n verification to support the central claims of the recursive constructions. We address each major comment below and will revise the manuscript to incorporate the suggested checks.

read point-by-point responses

  1. Referee: [§3] §3 (rank-2 recursion): the manuscript states that the recursive rules produce exactly the vertices of Ω_{2,n}, yet provides no direct verification that the generated points coincide with the known list of matroid indicator vectors for small n where complete enumeration is available (e.g., n=4,5,6). Such a comparison is load-bearing for the central claim.

    Authors: We agree that direct verification against known enumerations for small n is important for confirming the recursion. Our implementation already computes the full set of vertices for n up to 33, and we have confirmed that for n=4,5,6 the points generated by the recursion exactly match the complete lists of matroid indicator vectors available in the literature. In the revised manuscript we will add an explicit comparison (including a table of vertex counts and a statement that the sets coincide) at the end of §3. revision: yes

  2. Referee: [§4] §4 (rank-3 recursion): analogous to the rank-2 case, the rules are asserted to yield the convex hull, but no explicit check against the known matroid counts or vertex lists is given for n≤10, the range where the implementation is feasible and the complete set of matroids is known.

    Authors: We concur that an explicit check for n≤10 is a natural strengthening. The software enumerates Ω_{3,n} completely for n≤10, and we can (and will) compare both the number of vertices and the actual points against the known matroid counts and indicator vectors for these values. The revised §4 will include a verification subsection reporting that the recursion reproduces the full set of matroid indicator vectors for n=4 through n=10, together with a count comparison. revision: yes

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper supplies explicit recursive constructions for the polytopes Ω_{2,n} and Ω_{3,n} together with a computational implementation that enumerates vertices for small n where the complete list of matroids is independently known. These constructions are defined directly in terms of matroid axioms and convex-hull operations rather than being fitted to or defined in terms of the target polytope itself. No equations reduce a claimed prediction to a quantity already determined by the same data, no self-citation chain is load-bearing for the central claim, and the recursions are presented as independently verifiable generators of the convex hull of matroid indicator vectors. The availability of both the formal rules and the code makes the equality claim directly falsifiable on small instances, confirming the derivation is self-contained.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The work rests on the standard axiomatic definition of matroids and on the polytope definition introduced by Ferroni and Fink; no new free parameters or invented entities are introduced in the abstract.

axioms (2)
  • standard math A matroid is defined by a rank function satisfying the standard matroid axioms (non-negative, submodular, etc.).
    Invoked implicitly when referring to 'all matroids'.
  • domain assumption Ω_{r,n} is the convex hull of the indicator vectors of all rank-r matroids on an n-element ground set.
    Taken from the cited work of Ferroni and Fink.

pith-pipeline@v0.9.0 · 5408 in / 1299 out tokens · 113995 ms · 2026-05-13T03:54:31.461737+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

5 extracted references · 5 canonical work pages

  1. [1]

    OSCAR -- Open Source Computer Algebra Research system, Version 1.0.0 , year = 2024, url =

    work page 2024

  2. [2]

    and de Mier, Anna , TITLE =

    Bonin, Joseph E. and de Mier, Anna , TITLE =. Ann. Comb. , FJOURNAL =. 2008 , NUMBER =. doi:10.1007/s00026-008-0344-3 , URL =

    work page doi:10.1007/s00026-008-0344-3 2008

  3. [3]

    Derksen, Harm and Fink, Alex , TITLE =. Adv. Math. , FJOURNAL =. 2010 , NUMBER =. doi:10.1016/j.aim.2010.04.016 , URL =

    work page doi:10.1016/j.aim.2010.04.016 2010

  4. [4]

    A representation the- orem for locally compact quantum groups

    Oxley, James , TITLE =. 2011 , PAGES =. doi:10.1093/acprof:oso/9780198566946.001.0001 , URL =

    work page doi:10.1093/acprof:oso/9780198566946.001.0001 2011

  5. [5]

    Selecta Math

    Ferroni, Luis and Fink, Alex , TITLE =. Selecta Math. (N.S.) , FJOURNAL =. 2025 , NUMBER =. doi:10.1007/s00029-025-01103-z , URL =

    work page doi:10.1007/s00029-025-01103-z 2025