The chromatic quasisymmetric class function of a digraph

DOI10.1007/s00026-021-00556-1zbMath1479.05356arXiv2106.02665OpenAlexW3205799051MaRDI QIDQ825961

Jacob A. White

Publication date: 18 December 2021

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.02665

zbMATH Keywords

group actionschromatic polynomialsquasisymmetric functionsposet partitions

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05) Combinatorics of partially ordered sets (06A07) Directed graphs (digraphs), tournaments (05C20) Group actions on combinatorial structures (05E18)

Related Items (1)

Chromatic quasisymmetric class functions of linearized combinatorial Hopf monoids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chromatic quasisymmetric functions
• Order polynomials and Pólya's enumeration theorem.
• \( h\)-vectors of matroids and logarithmic concavity
• Equivariant Ehrhart theory
• On quasisymmetric power sums
• What can be said about pure O-sequences?
• Chromatic quasisymmetric functions of directed graphs
• A symmetric function generalization of the chromatic polynomial of a graph
• A self paired Hopf algebra on double posets and a Littlewood-Richardson rule
• Monoidal Functors, Species and Hopf Algebras
• Orbital Chromatic and Flow Roots
• Combinatorial Reciprocity Theorems
• Flawlessness ofh-vectors of broken circuit complexes
• Double posets and the antipode of QSym
• Combinatorial reciprocity theorems

This page was built for publication: The chromatic quasisymmetric class function of a digraph