Order Quasisymmetric Functions Distinguish Rooted Trees
classification
🧮 math.CO
math.AC
keywords
functionstreesdistinguishedfiniteorderquasisymmetricrootedanalogous
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.