Pith. sign in

REVIEW 6 minor 18 references

Representation Stability for Marked Graph Complexes

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

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This paper proves that the marked graph complexes B(g,n,n−ℓ) are representation stable and stabilize sharply at n = ⌈3m/2⌉, with the stable top-degree homology multiplicities computed by Littlewood–Richardson sums.

desk verdict A solid, genuinely new sharp stability theorem for marked graph complexes; the reader's conditional verdict is too cautious about one standard Mackey step. read the letter →

arxiv 2505.05461 v2 pith:T6PLDBYJ submitted 2025-05-08 math.AT math.RT

Enoch Fedah , Benjamin C. Ward This is my paper · ORCID
classification math.ATmath.RT MSC 55R8005E1020C3018G85
keywords representationstabilitygraphcomplexesmarkedgraphssymmetricgrouprepresentationsmodulispacesofcurvesWhitehousemodulesconfigurationLittlewood-Richardsoncoefficients
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 a sharp representation stability theorem for the marked graph complexes $B(g,n,r)$, the chain complexes whose homology computes pieces of the compactly supported cohomology of moduli spaces of marked curves. Fixing the genus $g$ and the excess $\ell$, so that $r = n-\ell$ and $m = 3(g-1)+2\ell$, the sequence of complexes formed by adding one marked leg, tensored with the sign representation, is representation stable and stabilizes exactly at $n = \lceil 3m/2\rceil$. From that point on, the irreducible decomposition of every degree of the complex is a formal consequence of the decomposition at the stabilization point. The paper also computes the resulting stable multiplicities in the top degree as an explicit sum of Littlewood–Richardson coefficients, and shows that in genus $1$ the theorem recovers the sharp stability bound for configuration spaces of points in odd-dimensional Euclidean space.

What carries the argument

The central object is the marked graph complex $B(g,n,r)$: its degree-$i$ piece is spanned by isomorphism classes of connected graphs with a distinguished vertex, $n$ labeled legs, and at least $r$ marked flags at the distinguished vertex, with edges in degree $1$ and marked flags in degree $-1$. The argument is carried by the core-graph decomposition. Forgetting the marked legs of any graph leaves a core graph; each core graph $\xi$ of type $(g,k,u)$ determines a consistent sequence $\mathbf{p}A_\xi$ of $S_n$-modules, and Lemma 2.7 says that sequence stabilizes sharply at $k+\rho_\xi$, where $\rho_\xi$ is the maximum number of rows of an irreducible summand. The key counting lemma bounds $k \le 3(g-1)+2(k-u)$, with equality only for the explicit graphs $\theta_{g,\ell}(p)$; combining this with induction on genus over edge-cutting and vertex-removal steps yields $k+\rho_\xi \le \lceil 3m/2\rceil$. The same graphs $\theta_{g,\ell}(0)$ and $\theta_{g,\ell}(1)$ have $\rho_\xi$ exactly large enough to make the bound sharp.

What would settle it

For $g=2$, $\ell=1$ (so $m=5$ and the claimed sharp point is $n=8$), compute the full irreducible decompositions of $B(2,7,6)\otimes \mathrm{sgn}_7$ and $B(2,8,7)\otimes \mathrm{sgn}_8$. If the decomposition at $n=8$ matches the stability rule derived from $n=7$---each partition of $8$ either has zero multiplicity or is $(8-|\lambda|,\lambda)$ with the same multiplicity as at $n=7$---then the sequence is already stable at $7$ and the 'sharply at $8$' claim fails.

Watch

Extended reading notes

Core claim

The central claim is that the consistent sequence $\cdots \to B(g,n,n-\ell)\otimes V^{1_n} \to B(g,n+1,n+1-\ell)\otimes V^{1_{n+1}} \to \cdots$ is representation stable and stabilizes sharply at $n = \lceil 3m/2\rceil = \lceil 9(g-1)/2\rceil + 3\ell$, where $m = 3(g-1)+2\ell$. 'Sharply' means the sequence is stable at that value of $n$ but not at $n-1$. The proof decomposes each degree of $B(g,n,n-\ell)$ into summands indexed by core graphs---graphs with no marked legs---and bounds the stability point of each summand by counting flags and applying induction on genus. Two explicit families of core graphs, $\theta_{g,\ell}(0)$ and $\theta_{g,\ell}(1)$, are shown to stabilize exactly at the bound, forcing sharpness. On homology, the sharp bound gives vanishing and stability of certain multiplicities: partitions with fewer than $\lceil m/2\rceil$ rows contribute nothing, and in the top degree the stable multiplicities are given by a sum of Littlewood–Richardson coefficients. In genus $1$ the full homology $H_*(B(1,n,r))$ is identified with the Whitehouse modules (a family of $S_n$-representations with Stirling-number dimensions), and the theorem recovers the sharp $n=3i$ bound of [HR17] for the cohomology of configuration spaces in $\mathbb{R}^3$.

Load-bearing premise

The sharp bound rests on Lemma 4.5, the counting claim that every core graph of type $(g,n,r)$ has $n \le 3(g-1)+2(n-r)$, with equality only for the explicit family $\theta_{g,\ell}(p)$; if the admissibility rules for marked graphs changed, the count---and hence the stability point---could change.

Editorial extensions

If this is right

  • For fixed $g$ and $\ell$, once $n \ge \lceil 3m/2\rceil$, the entire $S_n$-character of $B(g,n,n-\ell)\otimes V^{1_n}$ in every degree is determined by the character at the stabilization point.
  • Corollary 1.2 gives explicit homology constraints: in any degree, the multiplicity of $(\lambda,1^{n-N})$ in $H_i(B(g,n,n-\ell))$ is zero when $N > \lceil 3m/2\rceil$, and is independent of $n$ when $N = \lceil 3m/2\rceil$.
  • Theorem 1.3 computes top-degree stable homology: the nonzero stable multiplicities are indexed by partitions $\lambda$ of $\lceil 3m/2\rceil$ with $\lceil m/2\rceil$ rows, and their values are Littlewood–Richardson sums independent of $n$.
  • In genus $1$, the isomorphism $H_i(B(1,n,r)) \cong W_{n,r-1}$ for $i=2(n-r)$ and $0$ otherwise identifies the homology with Whitehouse modules, and the sharp chain-level bound descends to the sharp $n=3\ell$ bound for $H_{2\ell}(C(\mathbb{R}^3,n))$ of [HR17].
  • Because the differentials in the spectral sequence to commutative graph homology are equivariant, the stable multiplicities and vanishing statements constrain which classes can appear on the $E^1$ page and how they can pair, informing higher-genus computations.

Reading between the lines

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

  • Editorial inference: the sharpness witnesses $\theta_{g,\ell}(0)$ and $\theta_{g,\ell}(1)$ are the most symmetric core graphs saturating the counting bound, which suggests that the $\lceil 3m/2\rceil$ threshold is a feature of the admissible-marking conventions (trivalent neutral vertices, no neutral tadpoles, no double-marked tadpoles); altering those conventions should move the threshold predict
  • Editorial inference: the same core-graph decomposition should extend to variants with several distinguished vertices, the setting the paper's outlook ties to commutative graph homology; a natural conjecture is that the multi-rooted complex stabilizes at the same $\lceil 3m/2\rceil$ with $m$ measured by total genus and excess, with the present stable multiplicities serving as genus-$1$ building blo
  • Editorial inference: the identification of $B(1,n,r)$ with the Whitehouse modules gives a purely combinatorial witness for the sharp $n=3\ell$ configuration-space bound of [HR17], so one could test whether the topological genus-$2$ constructions discussed in the outlook can be realized by the same graph-complex machinery, with the top-degree stable classes here predicting their irreducible content
  • Editorial inference: if the computed stable multiplicities are correct, the equivariant spectral sequence to commutative graph homology cannot kill these classes by differentials landing inside the stable range, so the nonzero classes in $H^m(B(g,n,n-\ell))$ should survive to the $E^\infty$ page unless paired with classes outside the stable range.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

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. The paper proves a sharp representation stability result for the marked graph complexes B(g,n,r) of Payne and Willwacher: for fixed g and ℓ with m = 3(g−1)+2ℓ ≥ 0, the consistent sequence B(g,n,n−ℓ)⊗V_{1_n} is uniformly representation stable and stabilizes sharply at n = ⌈9(g−1)/2⌉ + 3ℓ = ⌈3m/2⌉. The proof decomposes each degree of the complex into direct sums of core sequences indexed by 'core graphs', bounds the stabilization point of each core sequence by an induction on genus, and exhibits explicit core graphs θ_{g,ℓ}(p) witnessing sharpness. The paper then draws consequences for homology multiplicities: a Littlewood–Richardson formula for the stable top-degree homology, vanishing statements for other degrees, and a computation of H_*(B(1,n,r)) as Whitehouse modules, recovering the sharp stability theorem of Hersh and Reiner for configuration spaces in odd-dimensional Euclidean space.

Significance. If the main theorem is correct, this is a substantial contribution to representation stability and to the structural understanding of the marked graph complexes appearing in the cohomology of moduli spaces of curves. The paper is notable for giving a sharp, not merely eventual, stability bound, and for proving that the bound is witnessed by explicit graphs. The passage from chain-level stability to homology multiplicities via Theorem 2.9 is a useful general mechanism, and the genus-1 computation is self-contained and independently recovers a known result, which strengthens confidence in the framework. The explicit stable multiplicity formula and the applications to weight 11 and weight 15 cohomology of moduli spaces give the results concrete computational content. I found no load-bearing correctness error in the central derivation; the main theorem is supported by a detailed chain-level decomposition and an explicit sharpness witness.

minor comments (6)
  1. [Lemma 3.5] The proof of Step 1 in Lemma 3.5 is compressed: the injectivity of the coset map S_n/J → S_{n+2}/I^c and the resulting injection (3.1) are dismissed with a reference to [Ser77, Prop. 7.3]. Since this is the one place in the genus induction where a Mackey-decomposition argument is invoked, please spell out the double-coset argument, noting that the kernel of the induced coset map is J = I^c ∩ S_n.
  2. [Lemma 4.5] In the equality part of Lemma 4.5, the symbol t is used before it is defined: after introducing p and y, please define t as the number of neutral vertices connected to the distinguished vertex by three edges, so that the statement 'the genus is 2t+q+p+1' is immediately readable.
  3. [Section 4.3] The estimates in Proposition 4.11 are written with decimals such as '4.5(g−2) + 3(n+2−r) + .5'; restating all bounds with ceilings, e.g. ⌈9(g−2)/2⌉, would make the induction and the final rounding easier to verify.
  4. [Section 2.1] The notation V_{n−m} in the definition of X◦V_{n−m} can be confused with the convention V_λ for irreducibles; please state explicitly that V_n denotes the trivial representation of S_n, in contrast with V_{1_n}, which denotes the sign representation.
  5. [Section 6] In the paragraph after Theorem 6.2, the phrase 'of dimensions n,k, the Stirling number of the first kind' appears to be a typo for the unsigned Stirling number typically written s(n,k); please correct the notation.
  6. [Corollary 4.6] Corollary 4.6 is stated without proof; it follows immediately from Lemma 4.5 by taking the core of γ and letting t be the number of marked legs, but adding this one-sentence justification would improve readability.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the sharp stability bound is derived from core-graph counting, an induction on genus, and explicit sharpness witnesses, none of which assumes the conclusion.

full rationale

The central claim (Theorem 4.2 / Theorem 1.1) is derived rather than assumed. The proof decomposes B(g,n,n−ℓ)_i into a direct sum of core sequences pA_ξ (Proposition 4.8, Corollary 4.9), then bounds n+ρ_ξ by induction on genus in Proposition 4.11. Lemma 4.5 is a direct counting consequence of the admissibility rules fixed in Definition 3.1 and does not import the target bound. Sharpness is established by explicit core graphs θ_{g,ℓ}(p) whose representation-theoretic widths are computed via standard Littlewood–Richardson and Koike–Terada results, not by assuming the desired stability point. The genus 1 computation in Section 6 is explicitly self-contained: the authors state that although a precursor exists in [War24], they 'opt to give a self-contained proof in our current context.' The recovery of Hersh–Reiner is a consequence, not an input; the only external ingredients are standard descriptions of configuration space cohomology [CLM76, LS86] and properties of Whitehouse modules [Whi97, ER19]. The self-citations [War22, War24] appear mainly in the outlook (Corollary 1.5) and are not load-bearing for the main theorem. Lemma 3.5 Step 1, while compressed, is a standard Mackey-decomposition/coset-injection argument and is not circular. No fitted parameters are called predictions, and no load-bearing result is imported from the authors' prior work. The paper is also checked against independent benchmarks (PW24, Bur25, HR17) as confirmations rather than as inputs.

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

The central claim is a pure proof result with no fitted parameters and no new postulated objects. The proof uses standard representation theory (Littlewood-Richardson rule, induced representations, Koike-Terada) and the prior construction of the graph complexes from Payne-Willwacher. The only delicate reliance is the combinatorial case analysis in Proposition 4.11 and the omitted verification in Lemma 3.5.

assumptions (8)
  • domain assumption Admissibility conditions for marked graphs (stability at neutral vertices, no neutral tadpoles, no double marked tadpoles)
    These rules define the complexes B(g,n,r) (Section 3.1.2). Lemma 4.5 and the core graph decomposition both rely on them; they come from Payne and Willwacher's construction.
  • standard math Littlewood-Richardson rule and induced representation formalism for S_n
    Used in Lemmas 2.3, 2.4, 2.7 and in the computation of stable multiplicities in Section 5.
  • standard math Koike-Terada decomposition of the representation induced from S_2≀S_y
    Used in Section 4.4 to compute ρ for the sharpness graph θ_{g,ℓ}(0) and in Theorem 5.4 to index partitions of the form 1^{⌈m/2⌉}+η+π.
  • standard math Serre's proposition on double cosets (Proposition 7.3)
    Invoked in Lemma 3.5, Step 1, to justify an injection on cosets; the paper explicitly omits the detailed verification.
  • standard math Description of H_{2(n-r)}(C(R^3,n-1)) as an induced representation (Cohen, Lehrer-Solomon)
    Used in Theorem 6.1 to identify the restriction of the genus 1 homology.
  • standard math Whitehouse module restriction property from Early-Reiner
    Used in Section 6 to lift the genus 1 computation from S_{n-1} to S_n and to recover Hersh-Reiner.
  • domain assumption The identification of B(g,n,r) with weight 11 and weight 15 pieces of H_c^*(M_{g,n}) from [PW24] and [CLPW24]
    This gives the motivating interpretation of the theorem as a statement about moduli spaces; the combinatorial proof of the bound does not depend on it.
  • domain assumption Representations are taken over Q
    Stated at the start of Section 2; semisimplicity over Q is used to take equivariant complements and to pass from cycles and boundaries to homology in Theorem 2.9.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Representation Stability for Marked Graph Complexes." pith.science (2026). https://pith.science/paper/T6PLDBYJ

@misc{pith2026250505461,
  author       = {Pith},
  title        = {Pith review of: Representation Stability for Marked Graph Complexes},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/T6PLDBYJ}},
  note         = {Machine review of arXiv:2505.05461}
}
read the original abstract

We prove a sharp representation stability result for graph complexes with a distinguished vertex, and prove that the chains realizing this sharp bound pass to non-trivial families of graph homology classes. This result may be interpreted as a higher genus generalization of Hersh and Reiner's stability bound for configuration spaces of points in odd dimensional Euclidean space.

Figures

Figures reproduced from arXiv: 2505.05461 by the authors.

Figure 1
Figure 1. A marked graph of type (4,8,3) with leg labeling suppressed. The connected components of a graph are the blocks of the partition of the vertices determined by the equivalence relation generated by declaring v1 ∼ v2 if there exists an edge {f, ι(f)} for which a(f) = v1 and a(ι(f)) = v2. For the remainder of this paper we assume all graphs have one connected component, i.e. are connected. Given such a graph with verti… view at source ↗
Figure 2
Figure 2. The first manifestation of stability is that eventually (as n increases but m = 3(g−1)+2(n−r) stays fixed) there are no core graphs, as we now establish: Lemma 4.5. If ξ is a core graph of type (g, n, r) then n ≤ m := 3(g − 1) + 2(n − r). Moreover, n = m if and only if ξ ∼= θg,ℓ(p) for some p. Proof. Let ξ be a core graph of type (g, n, r). On the one hand, by our exclusion of doubly￾marked tadpoles, if ξ has no mar… view at source ↗
Figure 2
Figure 2. The core graph θg,ℓ(p) with distinguished vertex in red. The red tic marks denote the marked flags. The ... refers to the number of copies of said feature appearing in the graph. 4.2. Core sequences. Write B(g, n, r)i for the degree i piece of the chain complex B(g, n, r). Core graphs will index a direct sum decomposition of the consistent sequence (B(g, n, n−ℓ)i , ψ) as we now indicate. Definition 4.7. Given a mark… view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

18 extracted references · 15 canonical work pages

  1. [1]

    Weight 11 compactly supported cohomology of moduli spaces of curves in excess four

    Leon Burkhardt. Weight 11 compactly supported cohomology of moduli spaces of curves in excess four. Homology, Homotopy and Applications , in press, 2025

    work page 2025

  2. [2]

    Representation theory and homological stability

    Thomas Church and Benson Farb. Representation theory and homological stability. Adv. Math. , 245:250--314, 2013

    work page 2013

  3. [3]

    Topology of moduli spaces of tropical curves with marked points

    Melody Chan, S ren Galatius, and Sam Payne. Topology of moduli spaces of tropical curves with marked points. In Facets of algebraic geometry. V ol. I , volume 472 of London Math. Soc. Lecture Note Ser. , pages 77--131. Cambridge Univ. Press, Cambridge, 2022

    work page 2022

  4. [4]

    Cohen, Thomas J

    Frederick R. Cohen, Thomas J. Lada, and J. Peter May. The homology of iterated loop spaces . Lecture Notes in Mathematics, Vol. 533. Springer-Verlag, Berlin-New York, 1976

    work page 1976

  5. [5]

    The motivic structures LS _ 12 and S _ 16 in the cohomology of moduli spaces of curves

    Samir Canning, Hannah Larson, Sam Payne, and Thomas Willwacher. The motivic structures LS _ 12 and S _ 16 in the cohomology of moduli spaces of curves. arxiv.org/abs/2411.12652 , arxiv preprint, 2024

    arXiv 2024

  6. [6]

    On configuration spaces and W hitehouse's lifts of the E ulerian representations

    Nicholas Early and Victor Reiner. On configuration spaces and W hitehouse's lifts of the E ulerian representations. J. Pure Appl. Algebra , 223(10):4524--4535, 2019

    work page 2019

  7. [7]

    Representation theory , volume 129 of Graduate Texts in Mathematics

    William Fulton and Joe Harris. Representation theory , volume 129 of Graduate Texts in Mathematics . Springer-Verlag, New York, 1991. A first course, Readings in Mathematics

    1991

  8. [8]

    Configuration spaces on a wedge of spheres and H ochschild- P irashvili homology

    Nir Gadish and Louis Hainaut. Configuration spaces on a wedge of spheres and H ochschild- P irashvili homology. Ann. H. Lebesgue , 7:841--902, 2024

    work page 2024

Show all 18 references
  1. [9]

    Murray Gerstenhaber and S. D. Schack. A H odge-type decomposition for commutative algebra cohomology. J. Pure Appl. Algebra , 48(3):229--247, 1987

    1987

  2. [10]

    Representation stability for cohomology of configuration spaces in R^d

    Patricia Hersh and Victor Reiner. Representation stability for cohomology of configuration spaces in R^d . Int. Math. Res. Not. IMRN , (5):1433--1486, 2017. With an appendix written jointly with Steven Sam

    2017

  3. [11]

    Young-diagrammatic methods for the representation theory of the groups Sp and SO

    Kazuhiko Koike and Itaru Terada. Young-diagrammatic methods for the representation theory of the groups Sp and SO . In The A rcata C onference on R epresentations of F inite G roups ( A rcata, C alif., 1986) , volume 47 of Proc. Sympos. Pure Math. , pages 437--447. Amer. Math....

    1986

  4. [12]

    G. I. Lehrer and Louis Solomon. On the action of the symmetric group on the cohomology of the complement of its reflecting hyperplanes. J. Algebra , 104(2):410--424, 1986

    1986

  5. [13]

    Weight 11 compactly supported cohomology of moduli spaces of curves

    Sam Payne and Thomas Willwacher. Weight 11 compactly supported cohomology of moduli spaces of curves. Int. Math. Res. Not. IMRN , (8):7060--7098, 2024

    2024

  6. [14]

    Linear representations of finite groups

    Jean-Pierre Serre. Linear representations of finite groups . Graduate Texts in Mathematics, Vol. 42. Springer-Verlag, New York-Heidelberg, 1977. Translated from the second French edition by Leonard L. Scott

    1977

  7. [15]

    Group actions on arrangements of linear subspaces and applications to configuration spaces

    Sheila Sundaram and Volkmar Welker. Group actions on arrangements of linear subspaces and applications to configuration spaces. Trans. Amer. Math. Soc. , 349(4):1389--1420, 1997

    1997

  8. [16]

    Benjamin C. Ward. Massey products for graph homology. Int. Math. Res. Not. IMRN , (11):8086--8161, 2022

    2022

  9. [17]

    Benjamin C. Ward. Stirling decomposition of graph homology in genus 1 . In Higher structures in topology, geometry, and physics , volume 802 of Contemp. Math. , pages 93--116. Amer. Math. Soc., [Providence], RI, [2024] 2024

    2024

  10. [18]

    The E ulerian representations of _n as restrictions of representations of _ n+1

    Sarah Whitehouse. The E ulerian representations of _n as restrictions of representations of _ n+1 . J. Pure Appl. Algebra , 115(3):309--320, 1997

    1997

Pith tools

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