Chromatic symmetric functions and polynomial invariants of trees

Stanley asked whether a tree is determined up to isomorphism by its chromatic symmetric function. We approach Stanley's problem by studying the relationship between the chromatic symmetric function and other invariants. First, we prove Crew's conjecture that the chromatic symmetric functio...

Full description

Saved in:
Bibliographic Details
Published in:The Bulletin of the London Mathematical Society 2024-11, Vol.56 (11), p.3452-3476
Main Authors: Aliste‐Prieto, José, Martin, Jeremy L., Wagner, Jennifer D., Zamora, José
Format: Article
Language:English
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Stanley asked whether a tree is determined up to isomorphism by its chromatic symmetric function. We approach Stanley's problem by studying the relationship between the chromatic symmetric function and other invariants. First, we prove Crew's conjecture that the chromatic symmetric function of a tree determines its generalized degree sequence, which enumerates vertex subsets by cardinality and the numbers of internal and external edges. Second, we prove that the restriction of the generalized degree sequence to subtrees contains exactly the same information as the subtree polynomial, which enumerates subtrees by cardinality and number of leaves. Third, we construct arbitrarily large families of trees sharing the same subtree polynomial, proving and generalizing a conjecture of Eisenstat and Gordon.
ISSN:0024-6093
1469-2120
DOI:10.1112/blms.13144