Related papers: Kromatic quasisymmetric functions

We study semifinite harmonic functions on arbitrary branching graphs. We give a detailed exposition of an algebraic method which allows one to classify semifinite indecomposable harmonic functions on some multiplicative branching graphs.…

We introduce new bases for the Hopf algebra of quasisymmetric functions that refine the symmetric powersum basis. These bases are expanded in terms of quasisymmetric monomial functions by using fillings of matrices. We define the analog of…

Egge, Loehr, and Warrington proved a formula for the Schur function expansion of a symmetric function in terms of its expansion in fundamental quasi-symmetric functions. Their formula involves the coefficients of a modified inverse Kostka…

The chromatic symmetric function $X_G$ is a power series that encodes the proper colorings of a graph $G$ by assigning a variable to each color and a monomial to each coloring such that the power of a variable in a monomial is the number of…

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…

We give a new characterization of the vertical-strip LLT polynomials $\mathrm{LLT}_P(x;q)$ as the unique family of symmetric functions that satisfy certain combinatorial relations. This characterization is then used to prove an explicit…

In this paper, we investigate the strength of chromatic symmetric homology as a graph invariant. Chromatic symmetric homology is a lift of the chromatic symmetric function for graphs to a homological setting, and its Frobenius…

We investigate analogs of symmetric functions arising from an extension of the nilHecke algebra defined by Naisse and Vaz. These extended symmetric functions form a subalgebra of the polynomial ring tensored with an exterior algebra. We…

We prove that the number of Hamiltonian paths on the complement of an acyclic digraph is equal to the number of cycle covers. As an application, we obtain a new expansion of the chromatic symmetric function of incomparability graphs in…

We show that with the appropriate choice of coproduct, the type B quasisymmetric functions form a Hopf algebra, and the recently introduced type B peak functions form a Hopf subalgebra.

The ring of symmetric functions occupies a central place in algebraic combinatorics, with a particularly notable role in Schubert calculus, where the standard cell decompositions of Grassmannians yield the celebrated family of Schur…

We show that the chromatic quasisymmetric function (CQF) of a labeled path graph on $n$ vertices is not symmetric unless the labeling is the natural labeling $1, 2, ..., n$ or its reverse $n, ..., 2, 1$. We also show that the star graph…

We prove necessary conditions for certain elementary symmetric functions, $e_\lambda$, to appear with nonzero coefficient in Stanley's chromatic symmetric function as well as in the generalization considered by Shareshian and Wachs. We do…

The algebra of quasisymmetric functions QSym and the shuffle algebra of compositions Sh are isomorphic as graded Hopf algebras (in characteristic zero), and isomorphisms between them can be specified via shuffle bases of QSym. We use the…

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…

A graph is Schur-positive if its chromatic symmetric function expands nonnegatively in the Schur basis. All claw-free graphs are conjectured to be Schur-positive. We introduce a combinatorial object corresponding to a graph G, called a…

We consider a q-analogue of the standard bilinear form on the commutative ring of symmetric functions. The q=-1 case leads to a Z-graded Hopf superalgebra which we call the algebra of odd symmetric functions. In the odd setting we describe…

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…

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…

We develop a composition method to unearth positive $e_I$-expansions of chromatic symmetric functions $X_G$, where the subscript $I$ stands for compositions rather than integer partitions. Using this method, we derive positive and neat…