Related papers: The Chromatic Quasisymmetric Class Function of a D…

We focus on two specific generalizations of the chromatic symmetric function: one involving universal graphs and the other concerning vertex-weighted graphs. In this paper, we introduce a unified generalization that incorporates both…

Motivated by the study of Macdonald polynomials, J. Haglund and A. Wilson introduced a nonsymmetric polynomial analogue of the chromatic quasisymmetric function called the \emph{chromatic nonsymmetric polynomial} of a Dyck graph. We give a…

The colored quasisymmetric functions, like the classic quasisymmetric functions, are known to form a Hopf algebra with a natural peak subalgebra. We show how these algebras arise as the image of the algebra of colored posets. To effect this…

A famous conjecture of Stanley states that his chromatic symmetric function distinguishes trees. As a quasisymmetric analogue, we conjecture that the chromatic quasisymmetric function of Shareshian and Wachs and of Ellzey distinguishes…

We make a systematic study of a new combinatorial construction called a dual equivalence graph. We axiomatize these graphs and prove that their generating functions are symmetric and Schur positive. This provides a universal method for…

Following the lead of Stanley and Gessel, we consider a morphism which associates to an acyclic directed graph (or a poset) a quasi-symmetric function. The latter is naturally defined as multivariate generating series of non-decreasing…

Shareshian-Wachs, Brosnan-Chow, and Guay-Pacquet [Adv. Math. ${\bf 295}$ (2016), ${\bf 329}$ (2018), arXiv:1601.05498] realized the chromatic (quasi-)symmetric function of a unit interval graph in terms of Hessenberg varieties. Here we…

We prove a new signed elementary symmetric function expansion of the chromatic quasisymmetric function of any natural unit interval graph. We then use a sign-reversing involution to prove a new combinatorial formula for K-chains, which are…

The equivariant cohomology ring of a regular semisimple Hessenberg variety in type A is a free module over the equivariant cohomology ring of a point. When equipped with Tymoczko's dot action, it becomes a twisted representation of the…

There is a natural way to assign both graph and digraph to every poset. Furthermore, any graph has its chromatic function, while any digraph has its Redei-Berge function. On the level of posets, these two functions are almost identical.…

For a class of symplectic manifolds, we introduce a functional which assigns a real number to any pair of continuous functions on the manifold. This functional has a number of interesting properties. On the one hand, it is Lipschitz with…

We discover new linear relations between the chromatic symmetric functions of certain sequences of graphs and apply these relations to find new families of e-positive unit interval graphs. Motivated by the results of Gebhard and Sagan, we…

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…

Let $P$ be a poset, $inc(P)$ its incomparability graph, and $X_{inc(P)}$ the corresponding chromatic symmetric function, as defined by Stanley in {\em Adv. Math.}, {\bf 111} (1995) pp.~166--194. Certain conditions on $P$ imply that the…

The classical theory of symmetric functions has a central position in algebraic combinatorics, bridging aspects of representation theory, combinatorics, and enumerative geometry. More recently, this theory has been fruitfully extended to…

The chromatic quasisymmetric functions (csf) of Shareshian and Wachs associated to unit interval orders have attracted a lot of interest since their introduction in 2016, both in combinatorics and geometry, because of their relation to the…

We define vertex-colourings for edge-partitioned digraphs, which unify the theory of P-partitions and proper vertex-colourings of graphs. We use our vertex-colourings to define generalized chromatic functions, which merge the chromatic…

Biserial algebras are a classical class in the representation theory of algebras, generalizing Nakayama algebras. They were further generalized by Green and Schroll to multiserial algebras, which share many structural properties with…

By using level one polynomial representations of affine Hecke algebras of type $A$, we obtain a $(q,t)$-analogue of the chromatic symmetric functions of unit interval graphs which generalizes Syu Kato's formula for the chromatic symmetric…

Chromatic symmetric functions are well-studied symmetric functions in algebraic combinatorics that generalize the chromatic polynomial and are related to Hessenberg varieties and diagonal harmonics. Motivated by the Stanley--Stembridge…