2018/03/23 by Penaguiao, Raul · 1 citation
#05E05 #Combinatorics (math.CO) #FOS: Mathematics #Rings and Algebras (math.RA)
paper · doi:10.48550/arxiv.1803.08824
We study the chromatic symmetric function on graphs, and show that its kernel is spanned by the modular relations. We generalize this result to the chromatic quasisymmetric function on hypergraphic polytopes, a family of generalized permutahedra. We use this description of the kernel of the chromatic symmetric function to find other graph invariants that may help us tackle the tree conjecture.