Paperlane

no. 5 · Friday 30 October 2026

First-Derivative Chromatic Symmetric Reconstruction For Proper Trees

Saad A. Awan

math.CO · v2 · 15 pp

Abstract

Richard Stanley asked whether every tree $T$ is determined up to isomorphism by its chromatic symmetric function $X_T$. We approach this open problem by regarding $X_T$ as a polynomial in the power-sum symmetric functions $p_1, p_2, \dots$ and studying the invariant $Φ_T = \left.\frac{\partial {X_T}}{\partial p_1}\right\rvert_{p_1 = 0}$. We prove that $Φ_T$ distinguishes, among proper trees, every proper tree in which any non-leaf vertex with two or more non-leaf neighbors has a number of leaf neighbors occurring at no other non-leaf vertex. We give an equivalent formulation of Stanley's question in terms of $Φ_T$. Finally, we show that counts of spanning forests with at most $t$ edges cannot distinguish all $k$-vertex trees when $t<\left\lfloor k/2\right\rfloor$, for every $k\ge4$.

comments
15 pages, 2 figures
fields
Combinatorics
pdf ↗ page arXiv:2609.13464 ↗