Pith. sign in

REVIEW 3 major objections 5 minor 22 references

Chromatic symmetric function of graphs from Borcherds algebras

T0 review · 3 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash

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

Pith's one-line read The chromatic symmetric function of a graph is recoverable from the root multiplicities of its Borcherds algebra.

desk verdict Genuine new connection between chromatic symmetric functions and Borcherds root multiplicities, but Theorem 2's proof skips a real coefficient-extraction step and Equation (2.3) has a sign typo; both fixable. read the letter →

arxiv 1908.08198 v2 pith:HI5AUH4U submitted 2019-08-22 math.CO

G. Arunkumar This is my paper · ORCID
classification math.CO MSC 05C1505C3105E0505E1517B0117B67
keywords BorcherdsalgebrasWeyldenominatoridentitychromaticsymmetricfunctionsrootmultiplicitiesbondlatticeG-symmetricpowersumgraphcoloring
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

Borcherds algebras are infinite-dimensional Lie algebras built from a symmetrizable matrix, and every simple graph arises as the graph of some such algebra. This paper argues that the chromatic symmetric function of a graph, the symmetric-function-level refinement of its chromatic polynomial, is encoded in the Weyl denominator identity of the associated Borcherds algebra. The main theorem expresses the chromatic symmetric function as a signed sum over the bond lattice of the graph whose coefficients are root multiplicities. This gives a Lie-theoretic derivation of the classical power-sum expansion of the chromatic symmetric function and, as a corollary, identifies the coefficient of the largest power-sum part with the chromatic discriminant. The final section extends the same denominator-identity mechanism to G-elementary symmetric functions and proves non-negativity of the coefficients of G-power sums.

What carries the argument

The load-bearing object is the modified Weyl denominator identity $$U(X) = \sum_{w \in W} (-1)^{\ell(w)} \sum_{\gamma \in \$\Omega$} (-1)^{\mathrm{ht}(\gamma)} $X^{{-\mathrm{ht}}$(w(\rho-\gamma)-\rho)} $e^{{w(\rho-\gamma)-\rho}}$ = \prod_{\$\alpha$ \in \$\Delta$^+} \left(1 - $X^{{-\mathrm{ht}}$(\$\alpha$)} $e^{{-\alpha}}$\right)^{\dim \mathfrak{g}_\$\alpha$}.$$ This identity carries the argument because its sum side, after multiplying over several indeterminates $X_i$, packages the proper colorings of $G$: the coefficient of $e^{-\eta(1)}$ is exactly the chromatic symmetric function. Its product side expresses the same coefficient as a signed sum of power-sum symmetric functions with root-multiplicity coefficients. The stable part of the same denominator identity supplies the $G$-elementary symmetric functions, and applying $-\log$ to the product side yields the $G$-power sums, establishing their non-negativity.

What would settle it

Enumerate the positive roots of height at most $|I|$ for a Borcherds algebra attached to a specific graph, and check whether every connected induced subgraph $S$ has $\sum_{i \in S} \alpha_i$ among them. A single connected subset whose root sum is absent, while the corresponding bond-lattice partition contributes to $X_G$, would refute Equation (1.6); the paper's own citation of this bijection to an earlier lemma marks it as the point to test.

Watch

Extended reading notes

Core claim

The central claim is Theorem 2. For a graph $G$ that is the graph of a Borcherds algebra $\mathfrak{g}$, the chromatic symmetric function equals $$X_G = (-1)^{\mathrm{ht}(\eta(1))} \sum_{J \in L_G} (-1)^{|J|} \mathrm{mult}(J)\, p_{\mathrm{type}(J)},$$ where $L_G$ is the bond lattice of $G$, $\eta(1)$ is the sum of the simple roots, $\mathrm{mult}(J)$ is the product of root multiplicities attached to the parts of $J$ by a bijection with multisets of positive roots, and $p_{\mathrm{type}(J)}$ is the power-sum symmetric function associated with the partition type. The proof introduces a modified Weyl denominator identity with an auxiliary indeterminate $X$ and shows that taking the product of these modified denominators over $X_1, X_2, \ldots$ and extracting the coefficient of $e^{-\eta(1)}$ produces $X_G$. The product side of the same identity factorizes over positive roots, so the same coefficient is also a signed sum of power-sum symmetric functions weighted by root multiplicities. From this the paper recovers the classical bond-lattice expansion of the chromatic symmetric function and shows that the coefficient of $p_{(n)}$ is the chromatic discriminant of $G$.

Load-bearing premise

The formula in Theorem 2 depends on the assumed bijection between the graph's bond lattice and multisets of positive roots: each connected induced subgraph must contribute a genuine positive root of the Borcherds algebra. The paper takes this bijection from an earlier lemma rather than proving it for the arbitrary Borcherds algebras it considers, so if any connected induced subgraph of the graph is not a positive root, the root-multiplicity expression for the chromatic symmetric function collapses even though the graph and its chromatic symmetric function remain well defined.

Editorial extensions

If this is right

  • The chromatic symmetric function of any graph of a Borcherds algebra is fully determined by root multiplicities; hence two graphs can be distinguished by their chromatic symmetric functions whenever the corresponding root-multiplicity data differ.
  • The classical expansion $X_G = \sum_{J \in L_G} \mu(\hat{0}, J)\, p_{\mathrm{type}(J)}$ follows from the denominator identity, providing a Lie-theoretic proof of it.
  • The coefficient of $p_{(n)}$ in $X_G$ equals the chromatic discriminant of $G$, the absolute value of the linear coefficient of the chromatic polynomial.
  • For a tuple $k$ with $k_i \le 1$ on real indices, the $k$-chromatic symmetric function $X_G^k$ has the same kind of root-multiplicity formula, extending the result to multicolorings.
  • The $G$-power sum symmetric functions $p_\lambda^G$ have non-negative integral coefficients, proved from the denominator identity rather than from a purely combinatorial construction.

Reading between the lines

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

  • The root-multiplicity formula suggests a practical sieve for distinguishing graphs: for a finite graph class, compute the bond-lattice terms via Equation (4.1) and compare; disagreements in root multiplicities would separate graphs without enumerating colorings.
  • The method is conditional on the bijection in Lemma 3; testing whether connected induced subgraphs always give positive roots for Borcherds-Cartan matrices with real simple roots could either certify the formula for those algebras or reveal that the root-multiplicity expression needs correction terms.
  • The same denominator-identity mechanism likely extends to Borcherds-Kac-Moody superalgebras, with odd roots introducing sign and parity factors and yielding super-analogues of chromatic symmetric functions; the paper mentions this direction only as future work.
  • The identification of the $p_{(n)}$ coefficient with the chromatic discriminant hints that other chromatic polynomial invariants may be read off from the root-space structure of the associated Borcherds algebra.
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

3 major / 5 minor

Summary. The paper claims that for a Borcherds algebra g with associated graph G, the chromatic symmetric function X_G can be recovered from the (modified) Weyl denominator identity of g. The main result, Theorem 2 (Eq. 1.6), expresses X_G as an alternating sum over the weighted bond lattice L_G of root-multiplicity terms p_{type(J)}, which the author presents as an extension of an earlier chromatic-polynomial result [4] and as a Lie-theoretic proof of Stanley's power-sum expansion. The paper also states a modified Weyl denominator identity (Proposition 3), derives an analogous expression for k-chromatic symmetric functions (Theorem 4), and connects the denominator identity with G-elementary symmetric functions and G-power sums (Section 5). The intended contribution is a new link between root multiplicities of Borcherds algebras and chromatic symmetric functions, with applications to distinguishing graphs.

Significance. If the main theorem and its proof are corrected, the paper would provide a genuinely new Lie-theoretic route to Stanley's power-sum expansion of X_G and would express X_G entirely in terms of root multiplicities of a Borcherds algebra, a non-obvious and potentially useful reformulation. The paper builds on published work [4] without using the target theorems to fit the conclusions; self-citations are disclosed. The connection to G-symmetric functions and the non-negativity application in Section 5 are additional contributions. However, the current text contains two load-bearing gaps: the modified denominator identity (2.3) is mis-stated with inverted exponents, and the coefficient extraction in Section 4.2 produces monomial symmetric functions rather than the claimed power sums. Because these issues affect the central derivation, the significance is conditional on a substantive revision.

major comments (3)
  1. [Section 2.6, Eq. (2.3)] The modified Weyl denominator identity is stated with X^{-ht(α)} on the product side and X^{-ht(w(ρ-γ)-ρ)} on the sum side. For w=e and γ=α_i, the summand is -X^{ht(α_i)} e^{-α_i}, while the corresponding product factor is 1-X^{-ht(α_i)} e^{-α_i}; these are not equal. All later uses in Section 4.2 (and in Example 8) require the positive exponent X^{ht(α)} on the product side. The identity should be corrected to ∏_{α∈Δ+}(1-X^{ht(α)}e^{-α})^{dim g_α} on the product side (with the matching sum side), and the proof's 'change of variable' argument must be repaired so that the two sides receive the same substitution.
  2. [Section 4.2, display before 'We can defined multiplicity'] The coefficient of e^{-η(1)} is written as a sum over distinct colour indices J={i_1,...,i_k}, producing sums of monomials ∏ X_{i_j}^{ht(α_j)}; this is a monomial symmetric function, not the power-sum p_{type(P)} claimed in Theorem 2. The correct expansion of ∏_i∏_α(1-X_i^{ht(α)}e^{-α})^{dim g_α} should give, for each multiset P={β_1,...,β_k}, the factor ∏_j (Σ_m X_m^{ht(β_j)}) = p_{ht(β_1)}...p_{ht(β_k)}. The displayed distinct-index sum is a different symmetric function: for sl3 it yields -p_2 + (p_{11}-p_2) = p_{11}-2p_2, whereas X_G = p_{11}-p_2. Lemma 3 is a bijection between L_G and P(1) and does not convert a monomial expansion into a power-sum expansion; this missing conversion is a load-bearing gap in the proof of Theorem 2.
  3. [Section 4, Proposition 1] With the definition of chromatic discriminant as the absolute value of the linear coefficient of the chromatic polynomial (as stated in the abstract and introduction), the coefficient of p_{(n)} in X_G equals the signed linear coefficient, specifically (-1)^{n+1} times the discriminant, not the discriminant itself. For the path graph on two vertices, X_G = p_{11}-p_2, so the coefficient of p_2 is -1 while the chromatic discriminant is 1. The proposition should be restated as an equality up to sign, or the definition of the discriminant should be aligned with the signed coefficient; the application in the abstract survives because different absolute values would still force different coefficients of p_{(n)}.
minor comments (5)
  1. [Section 4.1, Proposition 5] Proposition 5 uses U1(X_i) before the stable part U1 is defined in Section 5.1; either define U1 earlier or use U(X_i) consistently in the statement and proof.
  2. [Section 5.1 and 5.2] The displayed formula 'U1(X) = Σ_{i≥0} X^i eG_i' is inconsistent with Equation (5.4) and with Proposition 6, which require U1(X)=Σ_{i≥0}(-X)^i eG_i; a related sign inconsistency appears in Section 5.2 in the formula 'U1(-X)=Σ(-X)^i eG_i'. The signs should be reconciled throughout Section 5.
  3. [References] References [11] and [12] are the same book by Kac, and references [21] and [22] are the same book by Wakimoto; the duplicate entries should be removed.
  4. [Throughout] There are several typos: 'Vondermonde' should be 'Vandermonde', 'We can defined multiplicity' should be 'We can define multiplicity', and the abstract contains 't erms' and 'the above said expression' which should be cleaned up.
  5. [Section 5.2] In the derivation of p^G_n, the long display after '-log(∏...)' is repeated twice; the calculation should be presented once so that the coefficient of X^n/n is clearly identified.

Circularity Check

0 steps flagged · score 0.0 of 10

No circular derivation: target Stanleian expansions are conclusions, not inputs; prior self-citations are published and non-assuming.

full rationale

Walking the derivation chain: the paper begins from the classical Weyl denominator identity (2.2) and derives the modified identity (2.3) by an explicit substitution X^{-ht(α)} e^{-α} for e^{-α}; this is a formal variable change, not an import of the target result. Proposition 4 gives the combinatorial expansion of X_G as a sum over proper multicolorings; Proposition 5 then identifies the coefficient of e^{-η(1)} in ∏_i U(X_i) with the same coloring sum by matching stable pairs (w,γ) with color classes. This is a bijective calculation, not a renaming of Stanley's p-expansion. Theorem 2 is then obtained by reading the coefficient from the product side and applying the bijection Ψ of Lemma 3 from [4]; Stanley's expansion (Theorem 3) is a corollary via [19, Proposition 1.4], not an input. Section 5 derives nonnegativity of G-power sums from the product logarithm, independent of [18, Thm 2.3]'s conclusion. The only load-bearing citations to the present author's prior work are [4] (published J. Algebra) for Lemma 1, Lemma 3 and the chromatic-polynomial/root-multiplicity formula; those results do not assume the chromatic symmetric function expansion, so they support rather than presuppose the main theorem. The proof may contain a technical defect in §4.2, where the coefficient extracted from the product uses distinct color indices and yields m-type terms unless a p-type conversion is supplied, and a sign mismatch X^{ht} vs X^{-ht} between (1.5) and §4.2; but these are correctness concerns, not circularity, since the claimed p-expansion is not used to obtain the coefficient. No step reduces to its input by construction.

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

The central claim rests on standard Borcherds algebra theory and on the author's prior work [4]. No parameters are fitted to data and no new entities are postulated. The main unstated load is Lemma 3's bijection and the identification of connected subgraphs with positive roots.

assumptions (5)
  • domain assumption Existence of the Borcherds algebra g(A) associated to a Borcherds-Cartan matrix A, with its root space decomposition and Weyl denominator identity (Equation 2.2).
    The whole framework rests on Borcherds' generalized Kac-Moody theory as presented in [5] and [10, Theorem 3.16]; these are external results.
  • domain assumption The bijection Psi between the weighted bond lattice L_G(k) and the set P(k) of positive-root multisets summing to eta(k) (Lemma 3, from [4, Lemma 3.4]).
    This lemma is cited from the author's prior paper [4] and is the bridge between combinatorial partitions and root data; the present paper does not reprove it.
  • domain assumption The classical Weyl denominator identity for Borcherds algebras (Equation 2.2) is available for the choice of Weyl vector rho with 2(rho, alpha_i) = (alpha_i, alpha_i).
    The modified denominator identity is derived from it; the non-uniqueness of rho is not discussed, but the product side of the identity is independent of rho.
  • domain assumption For the Borcherds algebra attached to an arbitrary graph G via the negative adjacency matrix, every connected induced subgraph on a vertex set S contributes a positive root beta(S) = sum_{i in S} alpha_i.
    This is the key structural premise taken from [4] via Lemmas 1 and 3; it is not rederived in this paper and is load-bearing for Theorem 2.
  • domain assumption The graph G is assumed finite in Proposition 5 and Theorem 2; infinite graphs are handled by reducing to finite induced subgraphs on the support of k.
    The paper only proves the finite-rank case explicitly and extends by restriction to finite supp(k).

how reviews work

0 comments
Cite this review

Pith. "Pith review of Chromatic symmetric function of graphs from Borcherds algebras." pith.science (2026). https://pith.science/paper/HI5AUH4U

@misc{pith2026190808198,
  author       = {Pith},
  title        = {Pith review of: Chromatic symmetric function of graphs from Borcherds algebras},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/HI5AUH4U}},
  note         = {Machine review of arXiv:1908.08198}
}
abstract

Let $\mathfrak g$ be a Borcherds algebra with the associated graph $G$. We prove that the chromatic symmetric function of $G$ can be recovered from the Weyl denominator identity of $\mathfrak g$ and this gives a Lie theoretic proof of Stanley's expression for chromatic symmetric function in terms of power sum symmetric function. Also, this gives an expression for chromatic symmetric function of $G$ in terms of root multiplicities of $\lie g$. The absolute value of the linear coefficient of the chromatic polynomial of $G$ is known as the chromatic discriminant of $G$. As an application of our main theorem, we prove that graphs with different chromatic discriminants are distinguished by their chromatic symmetric functions. Also, we find a connection between the Weyl denominators and the $G$-elementary symmetric functions. Using this connection, we give a Lie theoretic proof of non-negativity of coefficients of $G$-power sum symmetric functions.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

22 extracted references · 21 canonical work pages

  1. [4]

    Arunkumar, Deniz Kus, and R

    G. Arunkumar, Deniz Kus, and R. Venkatesh. Root multiplicities fo r Borcherds algebras and graph coloring. J. Algebra, 499:538–569, 2018

    work page 2018

  2. [1]

    On the edge cover poly nomial of a graph

    Saieed Akbari and Mohammad Reza Oboudi. On the edge cover poly nomial of a graph. European J. Combin., 34(2):297– 321, 2013

    work page 2013

  3. [2]

    Arunkumar

    G. Arunkumar. The peterson recurrence formula for the chro matic discriminant of a graph. Indian Journal of Pure and Applied Mathematics , 49(3):581–587, Sep 2018

    work page 2018

  4. [3]

    Arunkumar

    G. Arunkumar. Generalized chromatic polynomials of graphs from heaps of pieces. Arxiv, July 2019

    work page 2019

  5. [5]

    Generalized Kac-Moody algebras

    Richard Borcherds. Generalized Kac-Moody algebras. J. Algebra, 115(2):501–512, 1988

    work page 1988

  6. [6]

    On the roots of ed ge cover polynomials of graphs

    P´ eter Csikv´ ari and Mohammad Reza Oboudi. On the roots of ed ge cover polynomials of graphs. European J. Combin. , 32(8):1407–1416, 2011

    work page 2011

  7. [7]

    Graph theory , volume 173 of Graduate Texts in Mathematics

    Reinhard Diestel. Graph theory , volume 173 of Graduate Texts in Mathematics . Springer, Heidelberg, fourth edition, 2010

    work page 2010

  8. [8]

    Halld´ orsson and Guy Kortsarz

    Magn´ us M. Halld´ orsson and Guy Kortsarz. Multicoloring: proble ms and techniques. In Mathematical foundations of computer science 2004 , volume 3153 of Lecture Notes in Comput. Sci. , pages 25–41. Springer, Berlin, 2004

    work page 2004

Show all 22 references
  1. [9]

    C. A. J. Hurkens. On the diameter of the edge cover polytope. J. Combin. Theory Ser. B , 51(2):271–276, 1991

    1991

  2. [10]

    An exposition of generalized Kac-Moody algeb ras

    Elizabeth Jurisich. An exposition of generalized Kac-Moody algeb ras. In Lie algebras and their representations (Seoul, 1995), volume 194 of Contemp. Math. , pages 121–159. Amer. Math. Soc., Providence, RI, 1996. 24 G. ARUNKUMAR

    1995

  3. [11]

    V. G. Kac. Infinite dimensional Lie algebras . Cambridge University Press, third edition, 1990

    1990

  4. [12]

    Victor G. Kac. Infinite-dimensional Lie algebras . Cambridge University Press, Cambridge, third edition, 1990

    1990

  5. [13]

    Free Lie algebras, generaliz ed Witt formula, and the denominator identity

    Seok-Jin Kang and Myung-Hwan Kim. Free Lie algebras, generaliz ed Witt formula, and the denominator identity. J. Algebra, 183(2):560–594, 1996

    1996

  6. [14]

    Orientations acycliques et le polynˆ ome chromatique

    Bodo Lass. Orientations acycliques et le polynˆ ome chromatique . European J. Combin. , 22(8):1101–1123, 2001

    2001

  7. [15]

    Lepowsky and S

    J. Lepowsky and S. Milne. Lie algebraic approaches to classical p artition identities. Adv. in Math. , 29(1):15–59, 1978

    1978

  8. [16]

    I. G. Macdonald. Affine root systems and Dedekind’s η-function. Invent. Math. , 15:91–143, 1972

    1972

  9. [17]

    Richard P. Stanley. A symmetric function generalization of the c hromatic polynomial of a graph. Adv. Math., 111(1):166– 194, 1995

    1995

  10. [18]

    Richard P. Stanley. Graph colorings and related symmetric func tions: ideas and applications: a description of results, interesting applications, & notable open problems. Discrete Math., 193(1-3):267–286, 1998. Selected papers in honor of Adriano Garsia (Taormina, 1994)

    1998

  11. [19]

    Venkatesh and Sankaran Viswanath

    R. Venkatesh and Sankaran Viswanath. Chromatic polynomials o f graphs from Kac-Moody algebras. J. Algebraic Com- bin., 41(4):1133–1142, 2015

    2015

  12. [20]

    Heaps of pieces

    G´ erard Xavier Viennot. Heaps of pieces. I. Basic definitions an d combinatorial lemmas. In Graph theory and its appli- cations: East and West (Jinan, 1986) , volume 576 of Ann. New York Acad. Sci. , pages 542–570. New York Acad. Sci., New York, 1989

    1986

  13. [22]

    Infinite-dimensional Lie algebras , volume 195 of Translations of Mathematical Monographs

    Minoru Wakimoto. Infinite-dimensional Lie algebras , volume 195 of Translations of Mathematical Monographs. American Mathematical Society, Providence, RI, 2001. Translated from th e 1999 Japanese original by Kenji Iohara, Iwanami Series in Modern Mathematics

    2001

  14. [23]

    A logical expansion in mathematics

    Hassler Whitney. A logical expansion in mathematics. Bull. Amer. Math. Soc. , 38(8):572–579, 1932. Indian Institute of Science Education and Research, Mohali , India Email address : arun.maths123@gmail.com, gakumar@iisermohali.ac.in

    1932

Pith tools

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