Pith. sign in

REVIEW 4 minor 31 references

Edge-span Chern classes generate graded algebras that distinguish all finite trees and nearly all five-vertex graphs.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

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

T0 review · deepseek-v4-flash

2026-08-03 06:11 UTC pith:THK7ES4R

load-bearing objection Genuinely new functorial Chern-algebra invariant with a strong tree-reconstruction theorem, but the whole result leans on an unverified imported ring-level model (Theorem 7.1); referee it, and make the verification of that model the central ask.

arxiv 2607.29483 v1 pith:THK7ES4R submitted 2026-07-31 math.CO math.AT

Edge-Span Chern Algebras of Graphical Configuration Spaces

Jackson Walters This is my paper
classification math.CO math.AT MSC 05C2505C6013A0255R80
keywords graphical configuration spacesChern classesgraph invariantsgraded algebrasgraph functorsgraph picture spacestree reconstructionHilbert series
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

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

The paper builds a graded algebra A_G^{(n)} from a finite graph G by placing its vertices at distinct points of projective space, taking for each edge the rank-two span bundle, and recording the two Chern classes a_e=h_u+h_v and b_e=h_u h_v. The assignment is a covariant graph functor, so the abstract algebra type is a graph invariant. The central claim is that multiplication in this invariant is strong: for five vertices in ambient dimension three it separates 33 of the 34 graph classes and strictly refines the classical graph polynomials, while for trees the cubic relation data (V_T,K_T) determines T up to isomorphism even though the Hilbert series only sees the vertex count. The paper also shows that the edge-Chern algebra of the associated picture variety can differ when the additive homology is the same, so the extra information lives in the Chern classes and their multiplication.

Core claim

The paper's central discovery is that the cubic part of the edge-span algebra is a complete invariant of finite trees. In ambient dimension three, the edge class a_uv=h_u+h_v satisfies a_uv^3=0 and a_uv^2=h_u h_v, so all information is carried by a finite-dimensional degree-one vector space V_T together with the kernel K_T of the multiplication map Sym^3(V_T) to A_T^3. The proof shows that the zero set of cubing in the projective space of V_T is exactly the set of projective lines spanned by edge sums, that the intrinsic dimension of the cubic kernel on triples of these lines detects whether two edges share a vertex, and that this recovers the line graph of T; a classical line-graph reconstr

What carries the argument

The arguments run through a graphical cdga model of the complement of the diagonal arrangement in (P^{n-1})^r. Its polynomial sector is the finite quotient R_G^{(n)}=Q[h_v]/(h_v^n, Delta_{uv}), with Delta_{uv}=sum_{k=0}^{n-1} h_u^{n-1-k}h_v^k, and the edge-span algebra sits inside it as the subalgebra generated by h_u+h_v and h_u h_v. In dimension three the diagonal relation becomes h_u^2+h_u h_v+h_v^2=0, which forces a_e^3=0 and a_e^2=b_e, reducing the invariant to cubic multiplication. Tree reconstruction uses the projective cube-zero locus in P(A_T^1) to recover edge lines and the kernel of Sym^3(U) to A_T^3 on triples of such lines to recover edge incidence.

Load-bearing premise

The entire chain rests on an imported ring-level model: the rational cohomology ring of the graphical configuration space must equal the cohomology of a certain graphical cdga, including its cup product; if that model is wrong, the census, the Hilbert-series formula, and the tree reconstruction no longer follow.

What would settle it

Take two nonisomorphic trees with the same vertex count, for instance the star on six vertices and the path on six vertices, and compute their cubic relation kernels by direct polynomial reduction; if any linear isomorphism of the degree-one spaces carries one kernel to the other, the tree-reconstruction theorem fails. Equivalently, check whether the projective cube-zero locus inside P(A_T^1) contains any point not proportional to an edge sum for some tree.

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

  • Two finite trees have isomorphic edge-span algebras in dimension three exactly when they are isomorphic, making the cubic relation pair a complete tree invariant of polynomial size.
  • The five-vertex census gives 33 algebra types on 34 graph classes, so the invariant separates graphs that share classical polynomials and Hilbert series; the one collision is explicitly identified.
  • The Hilbert series of A_T^{(n)} depends only on the number of vertices and the ambient dimension, so any reconstruction of trees from this algebra must use multiplication rather than dimensions.
  • The picture edge algebra surjects onto the open edge-span algebra, and equal additive picture homology does not force equal edge-Chern algebras.
  • For six-vertex trees in dimension three, all six unlabeled trees share one Hilbert series, and power-zero scheme degrees certify the six nonisomorphic algebras.

Where Pith is reading between the lines

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

  • A direct extension the paper leaves open is whether A_T^{(n)} reconstructs T for every n at least 4; the conductor description of the algebra gives a concrete algebraic route to test.
  • The invariant is structural rather than algorithmic: the paper does not provide a polynomial-time procedure for deciding GL(V_T)-equivalence of two cubic relation pairs, so a canonical form remains open.
  • The success of power-zero schemes and Betti tables as separating data suggests other finite-degree algebraic invariants of graded algebras could distinguish graphs with identical Hilbert series in larger censuses.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

0 major / 4 minor

Summary. The paper defines, for a finite simple graph G and ambient projective space P^{n-1}, the edge-span Chern algebra A_G^{(n)}: the graded Q-subalgebra of H^*(Conf_G(P^{n-1});Q) generated by the pulled-back Chern classes c_1,c_2 of the rank-two span bundles associated with the edges. It proves that G ↦ A_G^{(n)} is a covariant functor to graded algebras, gives a graphical Kříž–Totaro cdga model and a polynomial-sector description, and then uses these to obtain: a five-vertex census in dimension three with 33 algebra types among 34 graph classes; incomparability of the Hilbert series with the chromatic and Tutte polynomials in ambient dimension four; a closed Hilbert-series formula for trees depending only on |V(T)| and n; and a reconstruction theorem stating that A_T^{(3)} determines a finite tree T up to isomorphism, via a polynomial-size cubic relation invariant. A final section embeds the graphical configuration space as a dense open subset of the picture variety and gives an example where equal additive homology of picture spaces does not determine the edge-Chern algebra.

Significance. If correct, the tree reconstruction theorem is a striking instance of a topological/cohomological invariant whose Hilbert series is shape-blind but whose multiplicative structure is a complete tree invariant. The polynomial-size cubic relation invariant and the exact five-vertex census with machine-checkable certificates are concrete strengths; the computational claims are reproducible in principle. I found no internal inconsistency in the paper's derivations. The main caveat is that all ring-level statements, including Theorem 9.5 and the §8 computations, rest on the imported multiplicative Kříž–Totaro model of Zakharov [31, Thm 6.3.1]; the manuscript translates that theorem but does not independently prove it. I regard this as a transparent dependency rather than a flaw, but it should be stated prominently if [31] remains unpublished.

minor comments (4)
  1. [§9.5, proof of Theorem 9.5, table after Eq. (15)] The displayed P4 relation is written as x^4 − xy^2 − xyz − xz^2 + y^2z + yz^2, but the surrounding argument concerns a cubic relation in Sym^3 U. This is a typesetting error: the intended relation is x^3 − xy^2 − xyz − xz^2 + y^2z + yz^2 (the x^3 term is a pure cube and disappears modulo x^3,y^3,z^3). The subsequent discrimination between star and path still works with this correction, but the printed formula should be fixed.
  2. [§10, Proposition 10.1] The displayed equality j_G(Conf_G(P^{n-1})) = V^{n-1}(G) is an overstatement: the image is a dense open subset of the picture variety, not the whole closure. The proof and the restriction map (16) only need density, so this is a harmless but potentially confusing wording error.
  3. [§9.5, proof of Theorem 9.5] The sentence 'Extend scalars to Q' is misleading: all algebras and vector spaces have been over Q throughout. Delete it or replace with a neutral phrase such as 'Work over Q'.
  4. [§7, Theorem 7.1 and §1 Introduction] The paper should state explicitly, at the point where Theorem 7.1 is invoked, that all subsequent ring-level computations are conditional on the multiplicative model from [31, Thm 6.3.1]. Since [31] is a recent arXiv preprint, adding a precise statement of the imported theorem and its current publication status would help readers assess the foundation of Theorem 9.5.

Circularity Check

0 steps flagged

No significant circularity: the construction and reconstruction proofs are self-contained given their external model; the only author self-citation is non-load-bearing software.

full rationale

The paper's derivation chain is not circular. The edge-span algebra A_G^(n) is defined directly as the subalgebra generated by Chern classes pulled back along edge-span maps to Gr(2,n), and functoriality (Theorem 4.1) is proved from naturality of these maps rather than from the desired invariance. The main imported input is the multiplicative graphical Kříž–Totaro model (Theorem 7.1), which is cited to Zakharov's external theorem [31, Thm 6.3.1] and then explicitly translated to the paper's cdga presentation (2)–(4). This is an external mathematical dependence—and therefore a possible correctness risk if that theorem were mis-stated or misapplied—but it is not circularity: the cited work is not by the present author, is not fitted to the paper's conclusions, and is used to compute the algebras, not to assume them. Proposition 7.3 follows from an independent g-degree argument. The tree Hilbert-series formula (Theorem 9.4) is derived from a Gröbner-basis computation, the bipartite conductor lemma, and Leray–Hirsch, with no target result assumed. The tree reconstruction theorem (9.5) uses only intrinsic algebra data—the reduced cube-zero locus in A^1_T and the kernel of Sym^3(V_T) → A^3_T—and verifies incidence through functorial retractions and Whitney's line-graph theorem. The five-vertex census is a computational enumeration cross-checked against two independent models. The only author self-citation is the Zenodo software archive [28], which is a reproducibility artifact and is not load-bearing for any mathematical claim. No fitted parameter is renamed as a prediction, and no theorem is justified solely by a self-citation chain. External verification of Zakharov's model would strengthen the paper, but its absence is a correctness concern, not circularity.

Axiom & Free-Parameter Ledger

0 free parameters · 5 axioms · 0 invented entities

The central computation rests on Zakharov's external model; the remaining axioms are standard results in topology and combinatorics. No free parameters or invented entities are introduced.

axioms (5)
  • domain assumption Zakharov's chromatic Kříž–Totaro theorem ([31, Thm 6.3.1]) correctly computes H^*(Conf_G(P^{n-1});Q) as the cohomology of the cdga (2)–(4), including the cup-product structure.
    Theorem 7.1 of the paper imports this theorem directly; all computational and structural results (Theorems 8.1, 9.4, 9.5, Prop 10.3) depend on the ring structure of this model.
  • standard math The no-broken-circuit theorem for the graphical Orlik–Solomon algebra gives the flatwise basis underlying the NBC normal form (Proposition 7.2).
    Used to obtain the vector-space normal form (5) that the implementation and several Gröbner-basis arguments rely on.
  • standard math Whitney's line graph theorem: the line graph determines a tree up to isomorphism except for the K3/K1,3 exception, and only K1,3 is a tree.
    Invoked in the final step of Theorem 9.5 to reconstruct T from L(T).
  • standard math Leray–Hirsch theorem and the projective-bundle formula for fiber bundles over the Grassmannian and projectivized bundles.
    Used in Theorem 9.4 to compute Hilb(A^{(n)}_{K2}) and in Section 10 for the picture-space comparison.
  • standard math Künneth theorem for rational cohomology of products.
    Used in Proposition 4.2 to describe disjoint unions and in Proposition 10.3 for picture spaces.

pith-pipeline@v1.3.0-daily-deepseek · 19325 in / 35828 out tokens · 364169 ms · 2026-08-03T06:11:25.797235+00:00 · methodology

0 comments
read the original abstract

Place the vertices of a finite graph at projective points. Each edge defines a span map to $\mathrm{Gr}(2,n)$; the pulled-back Chern classes generate a graded algebra $A_G^{(n)}$. This assignment is a covariant graph functor, so the abstract graded-algebra type is a graph invariant. In ambient dimension four, the Hilbert series is incomparable with the chromatic and Tutte polynomials. On five vertices in dimension three, the $34$ graph classes yield $33$ algebra types, strictly refining both classical polynomials. For every tree $T$, we obtain a closed Hilbert-series formula depending only on $|V(T)|$ and $n$, while $A_T^{(3)}$ determines $T$ up to isomorphism. More precisely, its cubic relation data is a complete tree invariant of polynomial size. Finally, the graphical configuration space embeds as a dense open in the picture variety, and picture spaces with equal additive homology can have nonisomorphic edge-Chern algebras.

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

31 extracted references · 18 canonical work pages

  1. [1]

    6, 1435–1441, doi:10.1016/j.disc.2016.09.019

    Jos´ e Aliste-Prieto, Anna de Mier, and Jos´ e Zamora,On trees with the same restrictedU-polynomial and the Prouhet–Tarry–Escott problem, Discrete Math.340(2017), no. 6, 1435–1441, doi:10.1016/j.disc.2016.09.019

    work page doi:10.1016/j.disc.2016.09.019 2017

  2. [2]

    Jarod Alper et al.,Leiden declaration on artificial intelligence and mathematics, Zenodo, June 2026, Dec- laration, doi:10.5281/zenodo.20302944

    work page doi:10.5281/zenodo.20302944 2026

  3. [3]

    Kozlov,Complexes of graph homomorphisms, Israel J

    Eric Babson and Dmitry N. Kozlov,Complexes of graph homomorphisms, Israel J. Math.152(2006), no. 1, 285–312, doi:10.1007/BF02771988

    work page doi:10.1007/bf02771988 2006

  4. [4]

    Homo- topy Relat

    Vladimir Baranovsky and Radmila Sazdanovi´ c,Graph homology and graph configuration spaces, J. Homo- topy Relat. Struct.7(2012), no. 2, 223–235, doi:10.1007/s40062-012-0006-3

    work page doi:10.1007/s40062-012-0006-3 2012

  5. [5]

    2, 415–440, doi:10.1016/j.top.2004.10.002

    Barbu Berceanu, Martin Markl, and S ¸tefan Papadima,Multiplicative models for configuration spaces of algebraic varieties, Topology44(2005), no. 2, 415–440, doi:10.1016/j.top.2004.10.002. 24 JACKSON W ALTERS

    work page doi:10.1016/j.top.2004.10.002 2005

  6. [6]

    Marcel B¨ okstedt and Erica Minuz,Graph cohomologies and rational homotopy type of configuration spaces, arXiv:1904.01452v3, 2019, revised 2020

    Pith/arXiv arXiv 1904

  7. [7]

    J.3(1996), no

    Winfried Bruns and Joseph Gubeladze,Combinatorial invariance of Stanley–Reisner rings, Georgian Math. J.3(1996), no. 4, 315–318, doi:10.1515/GMJ.1996.315

    work page doi:10.1515/gmj.1996.315 1996

  8. [8]

    Graph Theory15(1991), no

    Sharad Chaudhary and Gary Gordon,Tutte polynomials for trees, J. Graph Theory15(1991), no. 3, 317–331, doi:10.1002/jgt.3190150308

    work page doi:10.1002/jgt.3190150308 1991

  9. [9]

    Colin Crowley, Galen Dorpalen-Barry, Andr´ e Henriques, and Nicholas Proudfoot,The geometry of zonotopal algebras I: cohomology of graphical configuration spaces, arXiv:2502.12768v2, 2025

    Pith/arXiv arXiv 2025

  10. [10]

    Combin.28(2007), no

    Michael Eastwood and Stephen Huggett,Euler characteristics and chromatic polynomials, European J. Combin.28(2007), no. 6, 1553–1560, doi:10.1016/j.ejc.2006.09.005

    work page doi:10.1016/j.ejc.2006.09.005 2007

  11. [11]

    Laure Helme-Guizon and Yongwu Rong,A categorification for the chromatic polynomial, Algebr. Geom. Topol.5(2005), no. 4, 1365–1388, doi:10.2140/agt.2005.5.1365

    doi:10.2140/agt.2005.5.1365 2005

  12. [12]

    Hoekstra-Mendoza,Recovering trees from the cohomology ring of their configuration spaces, arXiv:2312.16646v1, 2023

    Teresa I. Hoekstra-Mendoza,Recovering trees from the cohomology ring of their configuration spaces, arXiv:2312.16646v1, 2023

    Pith/arXiv arXiv 2023

  13. [13]

    Algebra220(1999), no

    Mordechai Katzman,Bipartite graphs whose edge algebras are complete intersections, J. Algebra220(1999), no. 2, 519–530, doi:10.1006/jabr.1999.7919

    arXiv 1999

  14. [14]

    Anton Khoroshkin and Denis Lyskov,Graphical configuration spaces, contractads and formality, arXiv:2509.21255v4, 2026

    arXiv 2026

  15. [15]

    3, 831–863, doi:10.5802/alco.488

    Anatol Kirillov, Gleb Nenashev, Boris Shapiro, and Arkady Vaintrob,Bizonotopal graphical algebras, Alge- braic Combinatorics9(2026), no. 3, 831–863, doi:10.5802/alco.488

    work page doi:10.5802/alco.488 2026

  16. [16]

    Igor Kˇ r ´ ıˇ z,On the rational homotopy type of configuration spaces, Ann. of Math. (2)139(1994), no. 2, 227–237, doi:10.2307/2946581

    doi:10.2307/2946581 1994

  17. [17]

    Math.288(2021), 1–8, doi:10.1016/j.dam.2020.08.019

    Pengyu Liu,A tree distinguishing polynomial, Discrete Appl. Math.288(2021), 1–8, doi:10.1016/j.dam.2020.08.019

    work page doi:10.1016/j.dam.2020.08.019 2021

  18. [18]

    Martin,Geometry of graph varieties, Trans

    Jeremy L. Martin,Geometry of graph varieties, Trans. Amer. Math. Soc.355(2003), no. 10, 4151–4169, doi:10.1090/S0002-9947-03-03321-X

    work page doi:10.1090/s0002-9947-03-03321-x 2003

  19. [19]

    Math.191(2005), no

    ,On the topology of graph picture spaces, Adv. Math.191(2005), no. 2, 312–338, doi:10.1016/j.aim.2004.03.010

    work page doi:10.1016/j.aim.2004.03.010 2005

  20. [20]

    Gleb Nenashev,Classification of external zonotopal algebras, Electron. J. Combin.26(2019), no. 1, Paper No. P1.32, 10 pp., doi:10.37236/8299

    work page doi:10.37236/8299 2019

  21. [21]

    K-theoretic

    Gleb V. Nenashev and Boris Shapiro,“K-theoretic” analog of Postnikov–Shapiro algebra distinguishes graphs, J. Combin. Theory Ser. A148(2017), 316–332, doi:10.1016/j.jcta.2017.01.001

    work page doi:10.1016/j.jcta.2017.01.001 2017

  22. [22]

    6, Paper No

    Yusaku Nishimura,The Kneser chromatic function distinguishes trees, Discrete Math.349(2026), no. 6, Paper No. 115009, doi:10.1016/j.disc.2026.115009

    arXiv 2026

  23. [23]

    Noble and Dominic J

    Steven D. Noble and Dominic J. A. Welsh,A weighted graph polynomial from chromatic invariants of knots, Ann. Inst. Fourier (Grenoble)49(1999), no. 3, 1057–1087, doi:10.5802/aif.1706

    work page doi:10.5802/aif.1706 1999

  24. [24]

    Peter Orlik and Louis Solomon,Combinatorics and topology of complements of hyperplanes, Invent. Math. 56(1980), no. 2, 167–189, doi:10.1007/BF01392549

    doi:10.1007/bf01392549 1980

  25. [25]

    Alexander Postnikov, Boris Shapiro, and Mikhail Shapiro,Algebras of curvature forms on homogeneous manifolds, Differential topology, infinite-dimensional Lie algebras, and applications (Alexander Astashkevich and Serge Tabachnikov, eds.), Amer. Math. Soc. Transl. Ser. 2, vol. 194, Amer. Math. Soc., Providence, RI, 1999, doi:10.1090/trans2/194/10, pp. 227–235

    work page doi:10.1090/trans2/194/10 1999

  26. [26]

    Stanley,A symmetric function generalization of the chromatic polynomial of a graph, Adv

    Richard P. Stanley,A symmetric function generalization of the chromatic polynomial of a graph, Adv. Math. 111(1995), no. 1, 166–194, doi:10.1006/aima.1995.1020

    arXiv 1995

  27. [27]

    4, 1057–1067, doi:10.1016/0040-9383(95)00058-5

    Burt Totaro,Configuration spaces of algebraic varieties, Topology35(1996), no. 4, 1057–1067, doi:10.1016/0040-9383(95)00058-5

    doi:10.1016/0040-9383(95)00058-5 1996

  28. [28]

    Jackson Walters,jacksonwalters/graph-functor: Graph Functor v1.0.3: Sage-Free Reproducibility Fixes, Zenodo, 2026, Software release v1.0.3, doi:10.5281/zenodo.21538969

    work page doi:10.5281/zenodo.21538969 2026

  29. [29]

    Hassler Whitney,Congruent graphs and the connectivity of graphs, Amer. J. Math.54(1932), no. 1, 150–168, doi:10.2307/2371086

    doi:10.2307/2371086 1932

  30. [30]

    thesis, Sor- bonne Universit´ e, 2025, Thesis no

    Alexander Zakharov,Rational homotopy type of complements of smooth arrangements, Ph.D. thesis, Sor- bonne Universit´ e, 2025, Thesis no. 2025SORUS160, doi:10.70675/e899d468z522ez4e32za5a1z2359ce488423

    work page doi:10.70675/e899d468z522ez4e32za5a1z2359ce488423 2025

  31. [31]

    Northern Virginia Community College, Virginia, USA Email address:jwalters@nvcc.edu

    ,Rational homotopy type of complements of submanifold arrangements, arXiv:2211.05033v3, 2026. Northern Virginia Community College, Virginia, USA Email address:jwalters@nvcc.edu

    arXiv 2026