Metraipolis › archive › dc_2c5f2a162154
First-Derivative Chromatic Symmetric Reconstruction For Proper Trees — arXiv:2609.13464
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.13464
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T01:23:05.939Z
- SHA-256 of the archived text
4181f4be58cec736ceb006a375bc617c0c3b5a3fa8669468a71407449740d701- Stable URL of this page
https://metraipolis.com/documento/dc_2c5f2a162154
How to cite
First-Derivative Chromatic Symmetric Reconstruction For Proper Trees — arXiv:2609.13464 — arXiv (en), https://arxiv.org/abs/2609.13464 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2c5f2a162154 (Metraipolis archive dc_2c5f2a162154, sha256 4181f4be58cec736ceb006a375bc617c0c3b5a3fa8669468a71407449740d701)
BibTeX
@misc{dc2c5f2a162154,
title = {First-Derivative Chromatic Symmetric Reconstruction For Proper Trees — arXiv:2609.13464},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.13464},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2c5f2a162154; sha256 4181f4be58cec736ceb006a375bc617c0c3b5a3fa8669468a71407449740d701},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.13464. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $T$ be a tree. Stanley asked whether the chromatic symmetric function $X_T$ determines $T$ up to isomorphism. 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 $\Phi_T = (\partial X_T/\partial p_1)|_{p_1 = 0}$. We prove that $\Phi_T$ distinguishes every proper tree whose weighted skeleton, the tree obtained from $T$ by weighted contraction of all leaf edges, has distinct weights at non-leaf vertices. We prove further an equivalent formulation of Stanley's question obtained by attaching a fixed positive number of leaves to every vertex of a tree. Finally, we count spanning forests with at most $t$ edges, grouping them by the sizes of their connected components. We prove that these counts cannot distinguish all trees on $k \ge 4$ vertices unless $t \ge \lfloor k/2 \rfloor$.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.13464 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T00:39:30.173Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).