Related papers: Chromatic symmetric functions in noncommuting vari…
Richard P. Stanley defined the chromatic symmetric function of a simple graph and has conjectured that every tree is determined by its chromatic symmetric function. Recently, Takahiro Hasebe and the author proved that the order…
We explore several generalizations of Whitney's theorem -- a classical formula for the chromatic polynomial of a graph. Following Stanley, we replace the chromatic polynomial by the chromatic symmetric function. Following Dohmen and Trinks,…
We study the $H$-chromatic symmetric functions $X_G^H$ (introduced in (arXiv:2011.06063) as a generalization of the chromatic symmetric function (CSF) $X_G$), which track homomorphisms from the graph $G$ to the graph $H$. We focus first on…
The chromatic polynomial $P(G,x)$ of a graph $G$ of order $n$ can be expressed as $\sum\limits_{i=1}^n(-1)^{n-i}a_{i}x^i$, where $a_i$ is interpreted as the number of broken-cycle free spanning subgraphs of $G$ with exactly $i$ components.…
For each indifference graph, there is an associated regular semisimple Hessenberg variety, whose cohomology recovers the chromatic symmetric function of the graph. The decomposition theorem applied to the forgetful map from the regular…
Cylindric skew Schur functions, a generalization of skew Schur functions, are closely related to the famous problem finding a combinatorial formula for the 3-point Gromov-Witten invariants of Grassmannian. In this paper, we prove cylindric…
The generalised colouring numbers $\mathrm{adm}_r(G)$, $\mathrm{col}_r(G)$, and $\mathrm{wcol}_r(G)$ were introduced by Kierstead and Yang as generalisations of the usual colouring number, also known as the degeneracy of a graph, and have…
We introduce a quasisymmetric class function associated with a group acting on a double poset or on a directed graph. The latter is a generalization of the chromatic quasisymmetric function of a digraph introduced by Ellzey, while the…
We study a linear map on symmetric functions that ``divides'' a partition by a positive integer $k$, sending a Schur function indexed by a partition of $kn$ to a symmetric function indexed by partitions of $n$. We determine its Schur…
We introduce a basis of the symmetric functions that evaluates to the (irreducible) characters of the symmetric group, just as the Schur functions evaluate to the irreducible characters of $GL_n$ modules. Our main result gives three…
We introduce and study a family of inhomogeneous symmetric functions which we call the Frobenius-Schur functions. These functions are indexed by partitions and differ from the conventional Schur functions in lower terms only. Our interest…
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…
In this work, we generalize and utilize the linear relations of LLT polynomials introduced by Lee \cite{Lee}. By using the fact that the chromatic quasisymmetric functions and the unicellular LLT polynomials are related via plethystic…
The involution Stanley symmetric functions $\hat{F}_y$ are the stable limits of the analogues of Schubert polynomials for the orbits of the orthogonal group in the flag variety. These symmetric functions are also generating functions for…
We describe a combinatorial formula for the coefficients when the dual immaculate quasisymmetric functions are decomposed into Young quasisymmetric Schur functions. We prove this using an analogue of Schensted insertion. Using this result,…
Stanley asked whether a tree is determined up to isomorphism by its chromatic symmetric function. We approach Stanley's problem by studying the relationship between the chromatic symmetric function and other invariants. First, we prove…
The irreducible characters of the symmetric group are a symmetric polynomial in the eigenvalues of a permutation matrix. They can therefore be realized as a symmetric function that can be evaluated at a set of variables and form a basis of…
In work with A. Yong, the author introduced genomic tableaux to prove the first positive combinatorial rule for the Littlewood-Richardson coefficients in torus-equivariant $K$-theory of Grassmannians. We then studied the genomic Schur…
The $e$-positivity conjecture and the $e$-unimodality conjecture of chromatic quasisymmetric functions are proved for some classes of natural unit interval orders. Recently, J. Shareshian and M. Wachs introduced chromatic quasisymmetric…
We study the symmetric function and polynomial combinatorial invariants of Hopf algebras of permutations, posets and graphs. We investigate their properties and the relations among them. In particular, we show that the chromatic symmetric…