Order Quasisymmetric Functions Distinguish Rooted Trees
Combinatorics
2018-09-17 v3 Commutative Algebra
Abstract
Richard P. Stanley conjectured that finite trees can be distinguished by their chromatic symmetric functions. In this paper, we prove an analogous statement for posets: Finite rooted trees can be distinguished by their order quasisymmetric functions.
Cite
@article{arxiv.1610.03908,
title = {Order Quasisymmetric Functions Distinguish Rooted Trees},
author = {Takahiro Hasebe and Shuhei Tsujie},
journal= {arXiv preprint arXiv:1610.03908},
year = {2018}
}
Comments
16 pages, 5 figures, referees' suggestions incorporated