Quasisymmetric functions distinguishing trees
From MaRDI portal
Publication:6101134
DOI10.5802/alco.273zbMath1516.05222arXiv2201.11763OpenAlexW4301181507MaRDI QIDQ6101134
Karimatou Djenabou, Jean-Christophe Aval, Peter R. W. McNamara
Publication date: 20 June 2023
Published in: Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.11763
Trees (05C05) Symmetric functions and generalizations (05E05) Combinatorics of partially ordered sets (06A07) Directed graphs (digraphs), tournaments (05C20) Algebraic aspects of posets (06A11)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Chromatic quasisymmetric functions
- Proper caterpillars are distinguished by their chromatic symmetric function
- Graphs with equal chromatic symmetric functions
- Equality of \(P\)-partition generating functions.
- On quasisymmetric power sums
- Order quasisymmetric functions distinguish rooted trees
- Chromatic quasisymmetric functions of directed graphs
- On immanants of Jacobi-Trudi matrices and permutations with restricted position
- A symmetric function generalization of the chromatic polynomial of a graph
- Duality between quasi-symmetric functions and the Solomon descent algebra
- On the smallest trees with the same restricted \(U\)-polynomial and the rooted \(U\)-polynomial
- A few more trees the chromatic symmetric function can distinguish
- Isomorphism of weighted trees and Stanley's isomorphism conjecture for caterpillars
- On trees with the same restricted \(U\)-polynomial and the Prouhet-Tarry-Escott problem
- On distinguishing trees by their chromatic symmetric functions
- \(P\)-partition products and fundamental quasi-symmetric function positivity
- Decomposable compositions, symmetric quasisymmetric functions and equality of ribbon Schur functions
- P-Partitions and p-Positivity
- P-Partitions and Quasisymmetric Power Sums
- On an Algorithm for Comparing the Chromatic Symmetric Functions of Trees
- Ordered structures and partitions
- \(P\)-partition generating function equivalence of naturally labeled posets
- The algebra of quasi-symmetric functions is free over the integers