Equivariant log-concavity of graph matchings

Shiyue Li

arxiv: 2202.08828 · v2 · submitted 2022-02-17 · 🧮 math.CO

Equivariant log-concavity of graph matchings

Shiyue Li This is my paper

Pith reviewed 2026-05-24 11:46 UTC · model grok-4.3

classification 🧮 math.CO

keywords graph matchingsequivariant log-concavityautomorphism grouppermutation representationhard Lefschetz theoremcombinatorial map

0 comments

The pith

The graded permutation representation of matchings for any graph is strongly equivariantly log-concave.

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

The paper shows that matchings in any graph, when grouped by size, form a representation of the automorphism group that satisfies strong equivariant log-concavity. This means the representation satisfies log-concave inequalities that are compatible with the group symmetries. A sympathetic reader cares because it lifts the classical log-concavity of matching numbers to an equivariant context, linking combinatorics and representation theory. The approach relies on constructing group-equivariant injections to apply the hard Lefschetz theorem.

Core claim

For any graph, the graded permutation representation of the graph automorphism group given by matchings is strongly equivariantly log-concave. The proof gives a family of equivariant injections inspired by a combinatorial map of Kratthenthaler and reduces to the hard Lefschetz theorem.

What carries the argument

A family of equivariant injections inspired by Kratthenthaler's combinatorial map, reducing the log-concavity claim to the hard Lefschetz theorem.

If this is right

The property holds for the automorphism group of every graph.
The inequalities are strong, preserving the representation structure.
The result follows from combinatorial injections rather than direct counting.
It applies the hard Lefschetz theorem in a new combinatorial setting.

Where Pith is reading between the lines

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

This suggests that other graded combinatorial structures on graphs might admit equivariant log-concavity under automorphism actions.
Verification on small symmetric graphs like the cycle graph could confirm the injections exist explicitly.
Extensions might include similar results for hypergraph matchings or other matching-like objects.

Load-bearing premise

That a suitable family of equivariant injections exists to reduce the property to the hard Lefschetz theorem.

What would settle it

Constructing or finding a graph whose matching representation violates the strong equivariant log-concavity condition.

read the original abstract

For any graph, we show that the graded permutation representation of the graph automorphism group given by matchings is strongly equivariantly log-concave. The proof gives a family of equivariant injections inspired by a combinatorial map of Kratthenthaler and reduces to the hard Lefschetz theorem.

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.

Desk Editor's Note private letter to a colleague

The paper proves strong equivariant log-concavity for matchings on arbitrary graphs by building Aut(G)-equivariant injections that reduce to hard Lefschetz, with the generality of those injections as the main point to check.

read the letter

The main takeaway is that for any graph the graded matching space carries a strongly equivariant log-concave action of the automorphism group. The argument constructs a family of injections between graded pieces, modeled on Kratthenthaler's map, shows they can be chosen to commute with the group action, and then applies hard Lefschetz on an ambient space to obtain the log-concavity inequalities in the representation ring. This gives a uniform statement that covers graphs with nontrivial automorphisms rather than restricting to symmetric or bipartite cases. The reduction itself is clean and avoids circularity by outsourcing positivity to an external theorem. The new piece is the equivariant extension of the injections, which lets the result apply to every graph. That construction is also the place where care is needed. The maps must stay injective and intertwine the action even when the automorphism group is large or when the graph has edges that interact with the original Kratthenthaler definition in unexpected ways. If the paper supplies an explicit general definition plus verification that the maps remain well-defined and injective for all G, the claim goes through; otherwise the reduction is only as strong as those checks. No obvious fitting or parameter tuning appears in the strategy. The result sits squarely in algebraic combinatorics. Readers working on equivariant versions of classical inequalities or on matching polynomials will see the most direct value. It is coherent on its own terms and engages the relevant literature on log-concavity and hard Lefschetz. I would bring it to a reading group focused on combinatorial representation theory. I would not cite it in my own work in the next year because the scope stays inside one subfield. It deserves peer review because the claim is general, the method is explicit, and the load-bearing step is checkable by a referee who knows the Kratthenthaler map.

Referee Report

2 major / 2 minor

Summary. The manuscript proves that for any graph G the graded permutation representation of Aut(G) on the matchings of G is strongly equivariantly log-concave. The argument constructs a family of Aut(G)-equivariant injections between graded pieces of this representation, modeled on a combinatorial map of Kratthenthaler, and reduces the claimed log-concavity to an application of the hard Lefschetz theorem on a suitable ambient space.

Significance. If the injections are shown to be well-defined, injective, and equivariant for every graph, the result would give a new equivariant strengthening of the log-concavity of matching numbers and supply an explicit combinatorial reduction to hard Lefschetz. The approach of producing group-equivariant injections is a concrete strength that could be useful in other representation-theoretic settings.

major comments (2)

[§3] §3 (construction of the injections): the manuscript must verify that the Kratthenthaler-inspired maps remain injective and Aut(G)-equivariant when G has nontrivial automorphisms or when the matching involves edges moved by the group action; without this check the reduction to hard Lefschetz in the main theorem does not go through for arbitrary graphs.
[§4] §4 (reduction step): the diagram relating the combinatorial injections to the equivariant Lefschetz operator is not shown to commute in the presence of a nontrivial group action; this commutativity is load-bearing for the claim that strong equivariant log-concavity follows from hard Lefschetz positivity.

minor comments (2)

The reference to Kratthenthaler's original map should include a precise citation and a short statement of which features are retained versus modified.
Notation for the graded pieces of the permutation representation (e.g., the precise definition of the degree grading) could be clarified in the introduction to avoid ambiguity when the group action is introduced.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and for highlighting the need for explicit verification in the presence of nontrivial automorphisms. We will revise the manuscript to supply the missing checks while preserving the overall argument.

read point-by-point responses

Referee: [§3] §3 (construction of the injections): the manuscript must verify that the Kratthenthaler-inspired maps remain injective and Aut(G)-equivariant when G has nontrivial automorphisms or when the matching involves edges moved by the group action; without this check the reduction to hard Lefschetz in the main theorem does not go through for arbitrary graphs.

Authors: We agree that an explicit verification is required for the result to hold for arbitrary graphs. In the revised version we will insert a new subsection (or expanded paragraph) in §3 that proves both properties. The maps are defined combinatorially by a rule that depends only on the edge set and a fixed total order on edges; any automorphism of G preserves this data and therefore commutes with the map, yielding equivariance. Injectivity is inherited from the underlying Kratthenthaler construction, which is purely set-theoretic and independent of the group action; we will spell out the short argument that no two distinct matchings are identified. revision: yes
Referee: [§4] §4 (reduction step): the diagram relating the combinatorial injections to the equivariant Lefschetz operator is not shown to commute in the presence of a nontrivial group action; this commutativity is load-bearing for the claim that strong equivariant log-concavity follows from hard Lefschetz positivity.

Authors: We accept the observation. The revised §4 will contain an explicit verification that the square relating the combinatorial injection, the Lefschetz operator, and the group action commutes. Because both the injection and the Lefschetz operator are defined by multiplication by a fixed element of the cohomology ring (or its combinatorial analogue) that is invariant under Aut(G), the diagram commutes on the nose; we will record the short diagram chase. revision: yes

Circularity Check

0 steps flagged

No circularity: derivation reduces to external hard Lefschetz theorem via explicitly constructed injections.

full rationale

The paper states that it constructs a family of Aut(G)-equivariant injections (inspired by Kratthenthaler's external combinatorial map) between graded pieces of the matching representation and then invokes the hard Lefschetz theorem on an ambient space to obtain strong equivariant log-concavity. This is a standard reduction to an independent theorem; the injections are presented as part of the proof rather than presupposed by definition or fitted to the target conclusion. No self-citation load-bearing step, no fitted parameter renamed as prediction, and no ansatz smuggled via prior work by the same authors appears in the given abstract or description. The central claim therefore remains self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the hard Lefschetz theorem (standard in algebraic geometry) and the existence of a specific family of equivariant injections; no free parameters or invented entities are indicated in the abstract.

axioms (1)

standard math The hard Lefschetz theorem applies to the relevant graded representations arising from graph matchings.
The proof reduces the log-concavity statement to this theorem.

pith-pipeline@v0.9.0 · 5552 in / 1179 out tokens · 23406 ms · 2026-05-24T11:46:06.437775+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

9 extracted references · 9 canonical work pages

[1]

Fi-modules and stability for representations of symmetric groups

Thomas Church, Jordan S Ellenberg, and Benson Farb. Fi-modules and stability for representations of symmetric groups. Duke Mathematical Journal , 164(9):1833--1910, 2015

work page 1910
[2]

The equivariant kazhdan--lusztig polynomial of a matroid

Katie Gedeon, Nicholas Proudfoot, and Benjamin Young. The equivariant kazhdan--lusztig polynomial of a matroid. Journal of Combinatorial Theory, Series A , 150:267--294, 2017

work page 2017
[3]

Heilmann and Elliott H

Ole J. Heilmann and Elliott H. Lieb. Theory of monomer-dimer systems. Communications in Mathematical Physics , 25(3):190--232, 1972

work page 1972
[4]

Krattenthaler

C. Krattenthaler. Combinatorial proof of the log-concavity of the sequence of matching numbers. J. Comb. Theory Ser. A , 74(2):351–354, May 1996

work page 1996
[5]

The categorical graph minor theorem

Dane Miyata, Nicholas Proudfoot, and Eric Ramos. The categorical graph minor theorem. arXiv preprint arXiv:2004.05544 , 2020

work page arXiv 2004
[6]

The graph minor theorem in topological combinatorics, 2020

Dane Miyata and Eric Ramos. The graph minor theorem in topological combinatorics, 2020

work page 2020
[7]

Plummer and L

M.D. Plummer and L. Lovász. Matching Theory . ISSN. Elsevier Science, 1986

work page 1986
[8]

Richard P. Stanley. Weyl groups, the hard lefschetz theorem, and the sperner property. SIAM Journal on Algebraic Discrete Methods , 1(2):168--184, 1980

work page 1980
[9]

Constructive Combinatorics

D Stanton and D White. Constructive Combinatorics . Springer-Verlag, Berlin, Heidelberg, 1986

work page 1986

[1] [1]

Fi-modules and stability for representations of symmetric groups

Thomas Church, Jordan S Ellenberg, and Benson Farb. Fi-modules and stability for representations of symmetric groups. Duke Mathematical Journal , 164(9):1833--1910, 2015

work page 1910

[2] [2]

The equivariant kazhdan--lusztig polynomial of a matroid

Katie Gedeon, Nicholas Proudfoot, and Benjamin Young. The equivariant kazhdan--lusztig polynomial of a matroid. Journal of Combinatorial Theory, Series A , 150:267--294, 2017

work page 2017

[3] [3]

Heilmann and Elliott H

Ole J. Heilmann and Elliott H. Lieb. Theory of monomer-dimer systems. Communications in Mathematical Physics , 25(3):190--232, 1972

work page 1972

[4] [4]

Krattenthaler

C. Krattenthaler. Combinatorial proof of the log-concavity of the sequence of matching numbers. J. Comb. Theory Ser. A , 74(2):351–354, May 1996

work page 1996

[5] [5]

The categorical graph minor theorem

Dane Miyata, Nicholas Proudfoot, and Eric Ramos. The categorical graph minor theorem. arXiv preprint arXiv:2004.05544 , 2020

work page arXiv 2004

[6] [6]

The graph minor theorem in topological combinatorics, 2020

Dane Miyata and Eric Ramos. The graph minor theorem in topological combinatorics, 2020

work page 2020

[7] [7]

Plummer and L

M.D. Plummer and L. Lovász. Matching Theory . ISSN. Elsevier Science, 1986

work page 1986

[8] [8]

Richard P. Stanley. Weyl groups, the hard lefschetz theorem, and the sperner property. SIAM Journal on Algebraic Discrete Methods , 1(2):168--184, 1980

work page 1980

[9] [9]

Constructive Combinatorics

D Stanton and D White. Constructive Combinatorics . Springer-Verlag, Berlin, Heidelberg, 1986

work page 1986