Pith. sign in

REVIEW 6 minor 8 references

Matroidal representations of low rank

T0 review · 0 major / 6 minor · reviewed 2026-08-07 · deepseek-v4-flash

Pith's one-line read A rank-3 matroid on a finite group is exactly the data of a proper subgroup and an equivalence relation on the remaining cosets.

desk verdict Solid generalization of Marcus–Phillips to all finite groups; the rank-3 classification is correct and worth a careful referee. read the letter →

arxiv 2502.08810 v1 pith:YZ5RUTRD submitted 2025-02-12 math.CO math.RT

classification math.COmath.RT MSC 12K1014T1005B3505E10
keywords tropicalgeometrymatroidmatroidalrepresentationBooleansemiringgroupactiononmatroidsequivalencerelationGolombrulerdistinctdifferencesystem
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

This paper proves that every rank-3 matroid — a combinatorial model of independence, generalizing linear independence in vector spaces — whose ground set is a finite group $G$ and whose automorphisms include all left translations is determined by finite combinatorial data: a proper subgroup $H$ and a nontrivial equivalence relation on $G/H$ with the identity coset removed. The relation must satisfy two axioms: if $a\sim b$ with $a\neq b$, then $a^{-1}\sim a^{-1}b$, and if $a\sim b$, then $ha\sim hb$ for all $h\in H$. The paper also gives the analogous rank-2 classification and shows that for cyclic groups of prime order the simple rank-3 cases are exactly those built from 'distinct difference systems,' a direct generalization of modular Golomb rulers. This matters because it reduces a tropical representation problem to a finite list of equivalence relations and connects the resulting matroids to number-theoretic objects.

What carries the argument

The load-bearing construction is the equivalence relation built from two-element dependence: $x\sim y$ if $x=y$ or $\{x,y\}$ is dependent, together with its rank-3 version on $G/H-\{\bar{1}\}$, where $a\sim b$ means $\{1,a,b\}$ is dependent. The two axioms in the theorem are exactly what is needed to make the rule 'a triple is a basis iff $a^{-1}b$ is not equivalent to $a^{-1}c$' well-defined, independent of the choice of coset representatives and of the order of the triple, and invariant under the $G$-action. This relation is also the device that separates the non-simple part of any loopless matroid: parallel classes form an equivalence relation, and the quotient carries a simple matroid of the same rank.

What would settle it

Run an exhaustive computer search over all groups of order at most 24, all proper subgroups $H$, and all equivalence relations on $G/H-\{\bar{1}\}$ satisfying the two axioms; if any resulting proposed bases fail the basis-exchange rule (or, equivalently, the circuit-elimination rule), the classification is false. Finding no failures would directly support the converse direction of Proposition 3.9.

Watch

Extended reading notes

Core claim

The central discovery is the bijection of Corollary 3.31: rank-3 $G$-invariant matroids on $G$ are in one-to-one correspondence with pairs $(H,\sim)$, where $H$ is a proper subgroup of $G$ and $\sim$ is a nontrivial equivalence relation on $G/H-\{\bar{1}\}$ satisfying (a) if $a\sim b$ and $a\neq b$, then $a^{-1}\sim a^{-1}b$, and (b) if $a\sim b$ and $h\in H$, then $ha\sim hb$. Given a matroid, the subgroup $H$ is the stabilizer of the identity element under the rank-2 parallelism relation, and $a\sim b$ means that $\{1,a,b\}$ is dependent in the quotient matroid on $G/H$. Conversely, given $(H,\sim)$, the bases are declared to be the triples $\{a,b,c\}$ for which $a^{-1}b$ is not equivalent to $a^{-1}c$. The theorem further says $H$ is trivial exactly when the matroid is simple, and it extends the low-dimension classification to all finite groups.

Load-bearing premise

The converse half of the classification rests on the claim that the two simple conditions on the equivalence relation force all of the defining rules of a matroid to hold; if some admissible relation violates the rule for how dependent sets must behave, the classification would list things that are not actually matroids.

Editorial extensions

If this is right

  • The classification turns rank-3 group-invariant matroids on a finite group into finite combinatorial data, so enumerating or constructing all of them is a finite task for each $G$.
  • Non-simple rank-3 invariant matroids are exactly the pullbacks of simple invariant matroids on a quotient $G/H$; the simple cases occur precisely when $H$ is trivial.
  • For $G=\mathbb{Z}_p$ with $p$ prime, every simple rank-3 invariant matroid arises from a distinct difference system, and each equivalence class together with $0$ is a modular Golomb ruler.
  • The same equivalence-relation machinery gives a rank-2 classification and a general quotient theorem for loopless matroids of any rank, both in the $G$-invariant setting.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the classification is correct, an immediate next step is to count admissible equivalence relations for small groups; exhaustive enumeration for groups like $S_3$ or $A_4$ would give the number of rank-3 invariant matroids and test the completeness statement computationally.
  • The quotient theorem suggests a general strategy for all ranks: every loopless $G$-invariant matroid on $G$ is the pullback of a simple $G$-invariant matroid on some $G/H$, so a full classification for higher ranks could be reduced to the simple case on quotients.
  • The Golomb-ruler connection in the prime cyclic case points toward a two-way exchange: number-theoretic constructions like difference sets could produce invariant matroids, while matroid conditions may impose new constraints on such sets.
  • A natural extension the paper does not pursue is whether the distinct-difference-system construction for $k>3$ is exhaustive for simple rank-$k$ invariant matroids on $\mathbb{Z}_p$; a computer search over small primes could test this directly.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

0 major / 6 minor

Summary. This paper studies matroids on finite groups that are invariant under left multiplication, equivalently tropical subrepresentations of the Boolean regular representation. The main results are a complete classification of rank-2 and rank-3 G-invariant matroids: rank-2 loopless matroids on a G-set correspond to G-invariant nontrivial equivalence relations, and rank-3 matroids on G correspond to pairs consisting of a proper subgroup H and a nontrivial equivalence relation on G/H\{1} satisfying two algebraic conditions. The paper also introduces distinct difference systems as a generalization of modular Golomb rulers, proves that they yield simple G-invariant matroids, and characterizes all simple rank-3 Z_p-invariant matroids in these terms. A general correspondence between loopless matroids and quotients by the parallel relation is established.

Significance. If correct, the classification reduces rank-3 tropical subrepresentations of the Boolean regular representation to finite combinatorial data, extending the work of Marcus and Phillips and providing a new perspective via equivalence relations. The connection to Golomb rulers and the number-theoretic examples are appealing. The proofs are self-contained, detailed, and use only standard matroid theory; the paper includes explicit constructions and examples. No free parameters or ad hoc axioms are introduced, and the classification is derived from the matroid axioms and the cited Giansiracusa–Manaker equivalence. I have specifically checked the delicate surjectivity argument in Proposition 3.9: the circuit elimination verification is complete, and Lemma 3.8 is valid, so the stress-test concern about that step does not land.

minor comments (6)
  1. [§3.2 (Prop. 3.30)] In the surjectivity direction of Proposition 3.30(1), the constructed matroid M is shown to be loopless, but the proof does not explicitly verify that applying the forward map to M returns the original pair (∼, N). This verification is straightforward—the parallel relation of M is exactly ∼ by construction, and the quotient independent sets are exactly those of N—but it should be stated to complete the one-to-one correspondence.
  2. [§3.2 (Prop. 3.9)] In Proposition 3.9, after proving that the basis condition is independent of the ordering and of the choice of the first representative, the proof does not explicitly state the analogous independence for the second and third representatives. This follows by combining the S3-invariance with the H-invariance condition (2), but a clarifying sentence would remove a potential source of confusion.
  3. [§3.2 (Lemma 3.8)] In the proof of Lemma 3.8, the notation "b^{-1}a = b^{-1}g" is used to mean equality of cosets rather than equality of elements; this should be clarified to avoid ambiguity.
  4. [Example 3.17] The listed set B' for k=3 contains the element {0,1,3} twice and omits {0,2,3}; this appears to be a typographical error in an illustrative example.
  5. [Introduction (Theorem A)] In Theorem A, part (1) omits the adjective "finite" for the G-set X, which is present in the full statement of Proposition 3.4.
  6. [Abstract] The abstract contains typographical artifacts such as "regul ar" and "fin ite" that should be cleaned up in the final version.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the rank-3 classification is derived from matroid axioms with independent prior-work citations used only for context.

full rationale

The paper's derivation chain is self-contained. Central results (Proposition 3.9 and Corollary 3.31) are proven from matroid axioms, and the only load-bearing external input is the [GM20] equivalence between tropical subrepresentations of the Boolean regular representation and matroid automorphism groups, which is an independent published result and not the authors' own. There is no fitted parameter renamed as a prediction: the classification is a bijection whose existence is verified by explicit constructions in both directions. The matroid-from-equivalence-relation construction in Proposition 3.9 is a genuine existence proof—the circuit elimination axiom is checked directly—rather than a restatement of the matroid-induced equivalence relation; the injectivity direction is proven via Lemma 3.6(4). The paper also reaches external benchmarks such as the examples from [MP24], but does not rely on [MP24] as justification for its own theorems. No self-citations appear in the derivation chain, no uniqueness theorem is imported from the authors' prior work, and no ansatz is smuggled in via citation. The classification of rank-2 matroids by equivalence relations and the quotient-to-simple-matroid correspondence (Proposition 3.30) are proven from scratch, not merely renamed from known results. Consequently, the central claim reduces neither to its inputs nor to a self-citation chain.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

No free parameters appear. The proof relies on standard matroid theory and the cited [GM20] equivalence. Distinct difference systems are a new definition, not an imposed assumption. No new entities are postulated.

assumptions (4)
  • standard math Matroid axioms, including the circuit elimination axiom
    The paper's constructions verify these axioms; they are assumed as background.
  • domain assumption Equivalence between tropical subrepresentations of B[G] and G-invariant matroids on G
    Taken from Giansiracusa and Manaker [GM20]; the paper builds on this identification without reproving it.
  • standard math Finiteness of G and all ground sets
    Stated at the outset; used throughout for counting and exhaustion arguments.
  • standard math Standard facts about quadratic residues and primitive roots in the prime field Z_p
    Used in Lemmas 3.11 and 3.12 and in Proposition 3.13.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Matroidal representations of low rank." pith.science (2026). https://pith.science/paper/YZ5RUTRD

@misc{pith2026250208810,
  author       = {Pith},
  title        = {Pith review of: Matroidal representations of low rank},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/YZ5RUTRD}},
  note         = {Machine review of arXiv:2502.08810}
}
abstract

We study tropical subrepresentations of the Boolean regular representation $\mathbb{B}[G]$ of a finite group $G$. These are equivalent to the matroids on ground set $G$ for which left-multiplication by each element of $G$ is a matroid automorphism. We completely classify the tropical subrepresentations of $\mathbb{B}[G]$ for rank 3. When $G$ is an abelian group, our approach can be seen as a generalization of Golomb rulers. In doing so, we also introduce an interesting class of matroids obtained from equivalence relations on finite sets.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

8 extracted references · 5 canonical work pages

  1. [1]

    Matroids over partial hyperstructures

    Matthew Baker and Nathan Bowler. Matroids over partial hyperstructures. Advances in Mathematics , 343:821--863, 2019

  2. [2]

    Projective geometries and simple pointed matroids as F _1 -modules

    Jonathan Beardsley and So Nakamura. Projective geometries and simple pointed matroids as F _1 -modules. arXiv preprint arXiv:2404.04730 , 2024

  3. [3]

    A module-theoretic approach to matroids

    Colin Crowley, Noah Giansiracusa, and Joshua Mundinger. A module-theoretic approach to matroids. Journal of Pure and Applied Algebra , 224(2):894--916, 2020

  4. [4]

    Tropical varieties, maps and gossip

    Bart Frenk. Tropical varieties, maps and gossip. Ph.D. thesis, Technische Universiteit Eindhoven , 2013

  5. [5]

    A G rassmann algebra for matroids

    Jeffrey Giansiracusa and Noah Giansiracusa. A G rassmann algebra for matroids. manuscripta mathematica , 156(1-2):187--213, 2018

  6. [6]

    Matroidal representations of groups

    Noah Giansiracusa and Jacob Manaker. Matroidal representations of groups. Advances in Mathematics , 366:107089, 2020

  7. [7]

    Tropical subrepresentations of the boolean regular representation in low dimension

    Steffen Marcus and Cameron Phillips. Tropical subrepresentations of the B oolean regular representation in low dimension. arXiv preprint arXiv:2410.08349 , 2024

  8. [8]

    Categories of hypermagmas, hypergroups, and related hyperstructures

    So Nakamura and Manuel L Reyes. Categories of hypermagmas, hypergroups, and related hyperstructures. arXiv preprint arXiv:2304.09273 , 2023

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.