相关论文: From Poset Topology to $q$-Eulerian Polynomials to…

We discuss three distinct topics of independent interest; one in enumerative combinatorics, one in symmetric function theory, and one in algebraic geometry. The topic in enumerative combinatorics concerns a q-analog of a generalization of…

We introduce a quasisymmetric refinement of Stanley's chromatic symmetric function. We derive refinements of both Gasharov's Schur-basis expansion of the chromatic symmetric function and Chow's expansion in Gessel's basis of fundamental…

Richard Stanley defined the chromatic symmetric function $X_G$ of a graph $G$ and asked whether there are non-isomorphic trees $T$ and $U$ with $X_T=X_U$. We study variants of the chromatic symmetric function for rooted graphs, where we…

The U-polynomial, the polychromate and the symmetric function generalization of the Tutte polynomial due to Stanley are known to be equivalent in the sense that the coefficients of any one of them can be obtained as a function of the…

We give a new proof of Chung and Graham's ``G-descent expansion'' of the classical chromatic polynomial, as well as a special case of the quasi-symmetric function expansion of the path-cycle symmetric function Xi_D. Both proofs rely on…

Stanley has studied a symmetric function generalization X_G of the chromatic polynomial of a graph G. The innocent-looking Stanley-Stembridge Poset Chain Conjecture states that the expansion of X_G in terms of elementary symmetric functions…

Stanley introduces polynomials which help evaluate symmetric group characters and conjectures that the coefficients of the polynomials are positive. Stanley later gives a conjectured combinatorial interpretation for the coefficients of the…

Stanley introduced the chromatic symmetric function of a simple graph, which is a generalization of a chromatic polynomial. This is expressed in terms of the integer points of the complements of the corresponding graphic arrangement.…

In this paper, we study positivity phenomena for the $e$-coefficients of Stanley's chromatic function of a graph. We introduce a new combinatorial object: the {\em correct} sequences of unit interval orders, and using these, in certain…

This paper focuses on the well-known problem due to Stanley of whether two non-isomorphic trees can have the same $U$-polynomial (or, equivalently, the same chromatic symmetric function). We consider the $U_k$-polynomial, which is a…

In 1995, Stanley introduced the chromatic symmetric function of a graph, which specializes to its chromatic polynomial, and which has been the focus of intense research. In 2017, Shareshian, Wachs, and Ellzey defined a refinement of this…

These notes are designed to offer some (perhaps new) codicils to related work, a list of problems and conjectures seeking (preferably) combinatorial proofs. The main items are Eulerian polynomials and hook/contents of Young diagram, mostly…

Stanley's symmetrized chromatic polynomial is a generalization of the ordinary chromatic polynomial to a graph invariant with values in a ring of polynomials in infnitely many variables. The ordinary chromatic polynomial is a specialization…

Stanley associated with a graph G a symmetric function X_G which reduces to G's chromatic polynomial under a certain specialization of variables. He then proved various theorems generalizing results about the chromatic polynomial, as well…

The chromatic symmetric function $X_G$ of a graph $G$ was introduced by Stanley. In this paper we introduce a quasisymmetric generalization $X^k_G$ called the $k$-chromatic quasisymmetric function of $G$ and show that it is positive in the…

We introduce a family of quasisymmetric functions called {\em Eulerian quasisymmetric functions}, which have the property of specializing to enumerators for the joint distribution of the permutation statistics, major index and excedance…

Tatsuyuki Hikita recently proved the Stanley--Stembridge conjecture using probabilistic methods, showing that the chromatic symmetric functions of unit interval graphs are $e$-positive. Finding a combinatorial interpretation for these…

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 Stanley chromatic symmetric function $X_G$ of a graph $G$ is a symmetric function generalization of the chromatic polynomial, and has interesting combinatorial properties. We apply the ideas of Khovanov homology to construct a homology…

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…