Pith. sign in

REVIEW 5 minor 35 references

Stable curves and chromatic polynomials

T0 review · 0 major / 5 minor · reviewed 2026-08-12 · deepseek-v4-flash

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

Pith's one-line read For every finite simple graph $G$, the intersection numbers $\omega_{G,g,m}$ on moduli spaces of stable curves equal $(-1)^{|V|}\chi_G(-(2g-2+m))$, with a derivative formula in the exceptional genus-one case.

desk verdict Reinke–Silversmith prove a clean closed formula realizing negative chromatic evaluations as psi-class intersection numbers, with two independent proofs that hold up under scrutiny. read the letter →

arxiv 2411.17551 v2 pith:3QXMNIUK submitted 2024-11-26 math.AG math.CO

Bernhard Reinke , Rob Silversmith This is my paper · ORCID
classification math.AGmath.CO MSC 14H1005C31
keywords chromaticpolynomialmoduliofstablecurvesintersectionnumberspsi-classeshyperplanearrangementsmaximumlikelihooddegreedeletion-contractionacyclicorientations
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

For every finite simple graph $G$, the paper defines a family of intersection numbers $\omega_{G,g,m}$ on moduli spaces of stable curves by pulling back cotangent (psi) classes and integrating, and proves that the family is governed by the chromatic polynomial $\chi_G$. The main formula is $\omega_{G,g,m}=(-1)^{|V|}\chi_G(-(2g-2+m))$ except in the genus-one, no-marked-points case, where it gives the derivative of $\chi_G$ at zero. If correct, the theorem makes every negative evaluation of the chromatic polynomial into a geometric count, and makes the whole family computable from one classical graph invariant. Two independent proofs are supplied: a deletion-contraction induction in the intersection ring of moduli space, and a route through hyperplane arrangements, bounded regions, and critical points of a product of powers of linear functions.

What carries the argument

The central object is the class $\Psi_{G,g,m}=\prod_{v\in V}\pi^*_{N[v]\cup M}\psi_v$ on $\overline{M}_{g,V\sqcup M}$, where $N[v]$ is the closed neighborhood of $v$ and $\psi_v$ is the cotangent class at the marked point $v$. This class encodes the graph's adjacency data in a codimension-$|V|$ cohomology class, and integrating it against $\pi^*_M([pt])$ produces $\omega_{G,g,m}$. The argument is carried by two mechanisms: the deletion-contraction identity for these classes, which reduces the intersection number to the edgeless case; and, in the second proof, the identification of logarithmic derivatives of $\prod_H f_H^{u_H}$ with pullbacks of hyperplane classes under the psi-class linear system from the genus-zero moduli space to projective space. A technical lemma rules out boundary intersections for generic weight choices, so the critical-point locus represents the same intersection product.

What would settle it

Take $G=K_3$ and $m=4$; the theorem predicts $\omega_{K_3,0,4}=24$, since $\chi_{K_3}(x)=x(x-1)(x-2)$ and $(-1)^3\chi_{K_3}(-2)=24$. Compute this intersection number on $\overline{M}_{0,7}$ directly from psi-class and boundary-divisor relations. A result different from 24 would disprove the main theorem; agreement is the expected check.

Watch

Extended reading notes

Core claim

The central discovery is Theorem 1.4: for finite simple $G=(V,E)$ and stable-curve data $(g,m)$ with $2g-2+m>0$, the intersection number built from $\Psi_{G,g,m}=\prod_{v\in V}\pi^*_{N[v]\cup M}\psi_v$ and the pullback of a point class satisfies $\omega_{G,g,m}=(-1)^{|V|}\chi_G(-(2g-2+m))$ when $(g,m)\neq(1,0)$, and in the remaining case $\omega_{G,1,0}=(-1)^{|V|-1}\chi'_G(0)$. The paper proves this twice. The first proof is an induction on edges: the identity $\omega_{G,g,m}=\omega_{G\setminus e,g,m}+\omega_{G/e,g,m}$ mirrors the chromatic polynomial's deletion-contraction recursion, with the equality of numbers coming from an equality of cohomology classes on a single moduli space. The second proof, in genus zero, identifies $\omega_{G,0,m}$ with the number of bounded regions of a refined graphical arrangement and, through a classical theorem on products of powers of linear functions, with a count of nondegenerate critical points; this also realizes $\omega_{G,0,m}$ as a maximum likelihood degree. A directed-graph variant of the construction produces two new polynomials that satisfy the same moduli-space formula.

Load-bearing premise

The load-bearing premise is the claim that, for almost all weight choices, the hypersurfaces $L_{v,u}$ representing the intersection classes meet only in the interior of moduli space and never in its boundary; the authors verify this by a long case analysis, and a missed boundary intersection would break the equality between the critical-point count and the intersection number $\omega_{G,0,m}$.

Editorial extensions

If this is right

  • Every negative integer evaluation of the chromatic polynomial becomes an intersection number on a moduli space of stable curves, so the whole polynomial is encoded in these geometric counts.
  • In genus zero, the same numbers count bounded regions of refined graphical hyperplane arrangements and nondegenerate critical points of products of powers of linear functions; they are therefore maximum likelihood degrees.
  • The deletion-contraction identity gives a direct geometric proof of the chromatic polynomial's recursion, reducing all computations to the edgeless case.
  • For complete graphs, the genus-zero case recovers the classical count of $n!$ critical points of the scattering potential in the $m=3$ model, connecting the formula to scattering amplitudes.
  • For directed graphs, the construction produces two polynomials of degree $|V|$ that satisfy the same moduli formula and factor as products of linear factors on acyclic digraphs.

Reading between the lines

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

  • One testable extension is to check whether the directed-graph polynomials satisfy a deletion-contraction recursion on directed edges; if they do, they would be genuine chromatic-like invariants with a moduli-space definition.
  • The maximum-likelihood interpretation points in the opposite direction as well: tautological-ring calculations on moduli space could yield new closed forms for maximum likelihood degrees of graphical statistical models.
  • The two proofs suggest a dictionary between boundary strata of moduli space and degenerations of colorings or acyclic orientations; making it explicit could produce bijective proofs of the formula and of the directed variants.
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 / 5 minor

Summary. The paper studies a family of intersection numbers on moduli spaces of stable curves associated to a finite simple graph G. For a graph G=(V,E) and extra markings M with 2g-2+|M|>0, the class Ψ_{G,g,m} is the product over v of the pullback of ψ_v along the forgetful map remembering the closed neighborhood N[v] together with M, and ω_{G,g,m} is its integral against the pullback of a point class. The main theorem (Theorem 1.4) states that these numbers are given by evaluations of the chromatic polynomial: ω_{G,g,m}=(-1)^{|V|}χ_G(-(2g-2+m)) when (g,m)≠(1,0), with the exceptional formula ω_{G,1,0}=(-1)^{|V|-1}χ'_G(0). Two proofs are given: the first is a self-contained induction on edges using deletion-contraction and intersection-theoretic facts about ψ-classes and boundary strata; the second, in genus zero, identifies the critical points of a Varchenko-type multivalued function on a graphical hyperplane arrangement with the intersection number, after a delicate boundary analysis showing that all intersections occur in the interior of M_0,V⊔M. The paper also connects these numbers to maximum likelihood degrees and scattering amplitudes, and introduces directed-graph analogues χ^in_G and χ^out_G.

Significance. If correct, Theorem 1.4 gives a surprising and clean geometric realization of all negative integer evaluations of the chromatic polynomial, while the exceptional case captures its linear coefficient. The genus-zero special case unifies several previously studied objects: Kapranov degrees, maximum likelihood degrees of graphical models, and bounded regions of graphical hyperplane arrangements. A notable strength is the presence of two independent proofs: the first is direct intersection theory on moduli spaces and does not depend on the more intricate boundary analysis of the second, which substantially raises confidence in the central claim. The paper is also refreshingly explicit: the base cases are computed, small examples are checked, and the relevant computational tools (admcycles, KapranovDegrees) are named.

minor comments (5)
  1. [Section 4.2, Lemma 4.8, subcase (b)] In the proof of Lemma 4.8, subcase (b), the map φ is only needed on the sequence W, which is chosen as V(C)\setminus\{r\}; the definition φ(r)=m_i is therefore extraneous. If W were instead intended to include r, the choice φ(r)=m_i would violate condition (2) in the case where α induces the trivial partition of M, so the role of the root should be clarified.
  2. [Section 3.1, Fact 2.9] The notation π^*_{1234}([pt]) is potentially confusing: the point class on M_0,4 is being identified with a ψ-class on that space. Adding a sentence explaining that ψ_i=[pt] as classes on M_0,4 would make the connection to the factors π^*_{\{v\}\cup A}(ψ_v) in equation (20) easier to follow.
  3. [Section 5, proof of Proposition 1.13] In the sentence preceding equation (43), the displayed comparison of polynomials should involve χ_{G\setminus\{w\}}(x) on the right-hand side, not χ_G(x); the subsequent displayed conclusion is correct.
  4. [Proof of Theorem 1.10] The phrase 'Let L_v be as in Theorem 1.10' should read 'as in Theorem 4.4'; the hyperplanes L_v are defined in Section 4.2, not in Theorem 1.10.
  5. [Section 1.4] There is a small typo in the sentence 'one may we characterize arbitrary evaluations of χ_G at nonpositive integer values'; the word 'we' should be deleted.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the main formula is derived by two independent routes from standard, externally supported facts; the only self-citation is a non-load-bearing base-case lemma.

full rationale

The derivation is self-contained and does not reduce to its inputs. In the first proof, Theorem 1.4 is established by induction on the number of edges: the edgeless base case is computed directly from boundary strata, and the inductive step proves the cohomological identity (10) by computing the six contributions (C1)-(C6) using the standard psi-class and boundary-divisor facts 2.3-2.8. The chromatic polynomial enters only through its standard deletion-contraction recursion (8), which the paper shows is satisfied by the intersection numbers via the identity (31); the target formula is never assumed. The second proof relies on independent classical results (Stanley's theorem on acyclic orientations, Zaslavsky's theorem, Varchenko's critical-point theorem), together with Theorem 1.8, proved by an explicit bijection, and Theorem 1.10, which compares the critical-point locus to the defining intersection product. The delicate boundary statement Theorem 4.4(3) is handled by a genuine codimension-counting induction using Lemma 4.8, not by assuming the desired count. The only self-citation is Fact 2.9, which cites [Sil22, Lem. 3.2] for a standard genus-zero integral used in the edgeless base case; this is an elementary, externally published lemma independent of the chromatic-polynomial target and does not carry the central argument. No circular step is present.

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

The central claim rests on standard intersection-theoretic and arrangement-theoretic facts, all cited or proved. There are no fitted free parameters; the factor 24 in the (g,m)=(1,0) definition is a fixed normalization, not a fitted constant. No new physical or geometric entities are postulated.

assumptions (6)
  • standard math Standard intersection theory on moduli spaces of stable curves: psi-classes, forgetful maps, and boundary strata (Facts 2.3, 2.5, 2.6, 2.7).
    Cited to Kock, Keel, and Hori et al.; these are established facts used throughout the first proof.
  • standard math The boundary-stratum pullback formula (Fact 2.4).
    Proved by the authors in Section 2 because they do not know a reference; if false, the base case computation of the first proof fails.
  • standard math Kapranov degree vanishing criterion (Fact 2.8).
    Cited to [BELL23, Thm. A(b)]; the paper proves the 'only if' direction that it actually uses.
  • standard math Stanley's theorem on acyclic orientations and compatible colorings (Theorem 1.6).
    Used in Theorem 1.8 to count bounded regions and in the second proof.
  • standard math Varchenko's theorem on critical points of products of powers of linear functions (Theorem 1.9).
    Used in the second proof to equate critical point counts with bounded regions; it is a deep external result.
  • domain assumption Moduli spaces \bar{M}_{g,n} of stable curves exist as smooth proper Deligne-Mumford stacks of dimension 3g-3+n.
    Fundamental background for the entire paper; standard in algebraic geometry.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Stable curves and chromatic polynomials." pith.science (2026). https://pith.science/paper/3QXMNIUK

@misc{pith2026241117551,
  author       = {Pith},
  title        = {Pith review of: Stable curves and chromatic polynomials},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/3QXMNIUK}},
  note         = {Machine review of arXiv:2411.17551}
}
abstract

The intersection numbers of moduli spaces of stable curves $\overline{M}_{g,m}$ are well-studied and are known to have rich combinatorial structure. We introduce a natural class of these intersection numbers $\omega_{G,g,m}$ indexed by finite simple graphs $G=(V,E)$. In genus zero, these numbers are closely related to several previously-studied quantities, including maximum likelihood degrees in algebraic statistics, counts of regions of certain hyperplane arrangements, and Kapranov degrees. We give two proofs of a simple closed formula $\omega_{G,g,m}=(-1)^{\left\lvert V \right\rvert}\chi_G(-(2g-2+m)),$ where $\chi_G$ is the chromatic polynomial of $G$ -- one proof via intersection theory on moduli spaces of stable curves, and the other using the theory of hyperplane arrangements. We discuss several related questions and speculations, including new candidates for the chromatic polynomial of a directed graph.

Figures

Figures reproduced from arXiv: 2411.17551 by the authors.

Figure 1
Figure 1. Illustrating how a graph yields an intersection number (special case) Remark 1.3. Adding the extra marked points a, b, c is natural for two reasons. First, M0,V ⊔{a,b,c} has dimension |V |, so the product in (1) is in the correct degree to integrate. Second, M0,N[v]⊔{a,b,c} has dimension at least 1 by construction, so the pullbacks π ∗ N[v]⊔{a,b,c} (ψv) are well-defined and nonzero. 1.2. Main definition and theorem,… view at source ↗
Figure 2
Figure 2. The smallest digraph for which χ in G 6= χ out G , see Example 1.15. Remark 1.16. There is a notion of chromatic polynomial of a digraph [Har11, AGJS17, HW21, GMHOLO22]. These polynomials count digraph colorings in the sense of Neumann-Lara [NL82], where each color must induce an acyclic subdigraph. There is no obvious relationship to χ in G and χ out G ; for example, the digraph in [PITH_FULL_IMAGE:figures/full_fi… view at source ↗
Figure 3
Figure 3. An illustration of Fact 2.5. Here Γ is the stable P-marked genus-1 weighted graph on the left, P ′ ⊂ P is the set of thick marked half-edges in Γ, and the stabilization Γ ′ is on the right. The vertex αP ′ ,i ∈ V (Γ) and the half-edge qP ′ ,i ∈ HE(Γ, αP ′ ,i) are as shown, and QP ′ ,i ⊂ HE(Γ, αP ′ ,i) consists of the five red half-edges. The natural inclusions stv P ′ and sthe P ′ ,ǫ (for both choices of ǫ ∈ V (Γ′ )… view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

35 extracted references · 33 canonical work pages

  1. [1]

    Saeed Akbari, Amir Ghodrati, Afrouz Jabalameli, and Morteza Saghafian, Chromatic number and dichromatic polynomial of digraphs, ArXiv e-prints (2017), http://arxiv.org/abs/1711.06293 arXiv :1711.06293

    arXiv 2017

  2. [2]

    Joshua Brakensiek, Christopher Eur, Matt Larson, and Shiyue Li, Kapranov degrees, arXiv preprint arXiv:2308.12285 (2023)

    work page Pith review arXiv 2023

  3. [3]

    Symmetry, Integrability and Geometry: Methods and Applications 17 (2021), 078

    Freddy Cachazo and Nick Early, Minimal kinematics: an all k and n peek into Trop^+ G(k, n) , SIGMA. Symmetry, Integrability and Geometry: Methods and Applications 17 (2021), 078

    work page 2021

  4. [4]

    Freddy Cachazo, Song He, and Ellis Ye Yuan, Scattering equations and kawai-lewellen-tye orthogonality, Phys. Rev. D 90 (2014), 065001

    work page 2014

  5. [5]

    Vincent Delecroix, Aaron Pixton, Johannes Schmitt, Jason van Zelm, and Jonathan Zachhuber, admcycles , 2022, https://gitlab.com/modulispaces/admcycles

    work page 2022

  6. [6]

    Nick Early, Anaëlle Pfister, and Bernd Sturmfels, Minimal kinematics on M _ 0,n , 2024, http://arxiv.org/abs/2402.03065 arXiv :2402.03065

    arXiv 2024

  7. [7]

    Diego Gonz \'a lez-Moreno, Rangel Hern \'a ndez-Ortiz, Bernardo Llano, and Mika Olsen, The dichromatic polynomial of a digraph, Graphs and Combinatorics 38 (2022), no. 3, 85

    work page 2022

  8. [8]

    1, 93--110

    Thomas Graber and Rahul Pandharipande, Constructions of nontautological classes of moduli spaces of curves, Michigan Mathematical Journal 51 (2003), no. 1, 93--110

    work page 2003

Show all 35 references
  1. [9]

    Curtis Greene and Thomas Zaslavsky, On the interpretation of W hitney numbers through arrangements of hyperplanes, zonotopes, non- R adon partitions, and orientations of graphs , Trans. Amer. Math. Soc. 280 (1983), no. 1, 97--126. 712251

    1983

  2. [10]

    thesis, Simon Fraser University, 2011

    Ararat Harutyunyan, Brooks-type results for coloring of digraphs, Ph.D. thesis, Simon Fraser University, 2011

    2011

  3. [11]

    1, American Mathematical Society, Providence, RI, 2003

    Kentaro Hori, Sheldon Katz, Albrecht Klemm, Rahul Pandharipande, Richard Thomas, Cumrun Vafa, Ravi Vakil, and Eric Zaslow, Mirror Symmetry, Clay Mathematics Monographs 1 , vol. 1, American Mathematical Society, Providence, RI, 2003

    2003

  4. [12]

    2108, Springer, Cham, 2014, pp

    June Huh and Bernd Sturmfels, Likelihood geometry, Combinatorial algebraic geometry, Lecture Notes in Math., vol. 2108, Springer, Cham, 2014, pp. 63--117. 3329087

    2014

  5. [13]

    3, 907--927

    June Huh, Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs, Journal of the American Mathematical Society 25 (2012), no. 3, 907--927

    2012

  6. [14]

    8, 1245--1266

    , The maximum likelihood degree of a very affine variety, Compositio Mathematica 149 (2013), no. 8, 1245--1266

    2013

  7. [15]

    Winfried Hochst \"a ttler and Johanna Wiehe, The chromatic polynomial of a digraph, Graphs and Combinatorial Optimization: From Theory to Applications: CTW2020 Proceedings, 2021, pp. 1--14

    2021

  8. [16]

    Algebraic Geom 2 (1993), no

    Mikhail Kapranov, Veronese curves and Grothendieck-Knudsen moduli space M _ 0,n , J. Algebraic Geom 2 (1993), no. 2, 239--262

    1993

  9. [17]

    2, 545--574

    Sean Keel, Intersection theory on the moduli space of stable n -pointed curves of genus zero, Transactions of the American Mathematical Society 330 (1992), no. 2, 545--574

    1992

  10. [18]

    4, 1079--1089

    Maxim Kazarian and Sergei Lando, An algebro-geometric proof of W itten’s conjecture , Journal of the American Mathematical Society 20 (2007), no. 4, 1079--1089

    2007

  11. [19]

    Knudsen, The projectivity of the moduli space of stable curves, II : The stacks M _ g,n , Mathematica Scandinavica 52 (1983), 161--199

    Finn F. Knudsen, The projectivity of the moduli space of stable curves, II : The stacks M _ g,n , Mathematica Scandinavica 52 (1983), 161--199

    1983

  12. [20]

    Joachim Kock, Notes on psi classes, 2001, Available at http://mat.uab.es/ kock/GW/notes/psi-notes.pdf http://mat.uab.es/ kock/GW/notes/psi-notes.pdf

    2001

  13. [21]

    1, 1--23

    Maxim Kontsevich, Intersection theory on the moduli space of curves and the matrix A iry function , Communications in Mathematical Physics 147 (1992), no. 1, 1--23

    1992

  14. [22]

    249, Birkh\" a user, 2007

    Joachim Kock and Israel Vainsencher, An invitation to quantum cohomology: Kontsevich's formula for rational plane curves, Progress in Mathematics, vol. 249, Birkh\" a user, 2007

    2007

  15. [23]

    Matt Larson, KapranovDegrees , 2023, SageMath package, avaialble at https://github.com/MattLarson2399/KapranovDegrees

    2023

  16. [24]

    Michel Las Vergnas , Convexity in oriented matroids, J. Comb. Th., Ser. B 29 (1980), no. 2, 231--243

    1980

  17. [25]

    1, 1--23

    Maryam Mirzakhani, W eil- P etersson volumes and intersection theory on the moduli space of curves , Journal of the American Mathematical Society 20 (2007), no. 1, 1--23

    2007

  18. [26]

    3, 265--270

    Victor Neumann-Lara, The dichromatic number of a digraph, Journal of Combinatorial Theory, Series B 33 (1982), no. 3, 265--270

    1982

  19. [27]

    Symposia Pure Math, vol

    Andrei Okounkov and Rahul Pandharipande, Gromov-Witten theory, Hurwitz numbers, and matrix models, I , Algebraic Geometry: Seattle 2005, Proc. Symposia Pure Math, vol. 80, 2009

    2005

  20. [28]

    Peter Orlik and Hiroaki Terao, The number of critical points of a product of powers of linear functions, Inventiones mathematicae 120 (1995), 1--14

    1995

  21. [29]

    12, 5057--5072

    Rob Silversmith, Cross-ratio degrees and perfect matchings, Proceedings of the American Mathematical Society 150 (2022), no. 12, 5057--5072

    2022

  22. [30]

    7, 1993--2005

    \' E ric Sopena, Homomorphisms and colourings of oriented graphs: A n updated survey , Discrete Mathematics 339 (2016), no. 7, 1993--2005

    2016

  23. [31]

    Bernd Sturmfels and Simon Telen, Likelihood equations and scattering amplitudes, Algebr. Stat. 12 (2021), no. 2, 167--186. 4350875

    2021

  24. [32]

    Stanley, Acyclic orientations of graphs, Discrete Mathematics 5 (1973), no

    Richard P. Stanley, Acyclic orientations of graphs, Discrete Mathematics 5 (1973), no. 2, 171--178

    1973

  25. [33]

    Varchenko, Critical points of the product of powers of linear functions and families of bases of singular vectors, Compositio Math

    A. Varchenko, Critical points of the product of powers of linear functions and families of bases of singular vectors, Compositio Math. 97 (1995), no. 3, 385--401. 1353281

    1995

  26. [34]

    Edward Witten, Two-dimensional gravity and intersection theory on moduli space , Surveys in Diff. Geom. 1 (1991), 243--310

    1991

  27. [35]

    Thomas Zaslavsky, Facing up to arrangements: face-count formulas for partitions of space by hyperplanes, Mem. Amer. Math. Soc. 1 (1975), no. issue 1, 154, vii+102. 357135

    1975

Pith tools

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