Related papers: Chromatic classical symmetric functions

This paper investigates methods for calculating the chromatic symmetric function (CSF) of a graph in chromatic-bases and the $m_\lambda$-basis. Our key contributions include a novel approach for calculating the CSF in chromatic-bases…

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…

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…

Cylindric skew Schur functions, which are a generalisation of skew Schur functions, arise naturally in the study of P-partitions. Also, recent work of A. Postnikov shows they have a strong connection with a problem of considerable current…

Given an element in a finite-dimensional real vector space, $V$, that is a nonnegative linear combination of basis vectors for some basis $B$, we compute the probability that it is furthermore a nonnegative linear combination of basis…

In the present paper, we introduce the concept of universal graph series. We then present four invariants of graphs and discuss some of their properties. In particular, one of these invariants is a generalization of the chromatic symmetric…

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…

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…

A well-known result of Stanley's shows that given a graph $G$ with chromatic symmetric function expanded into the basis of elementary symmetric functions as $X_G = \sum c_{\lambda}e_{\lambda}$, the sum of the coefficients $c_{\lambda}$ for…

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…

In this paper, we introduce the \emph{$\alpha$-chromatic symmetric functions} $\chi^{(\alpha)}_\pi[X;q]$, extending Shareshian and Wachs' chromatic symmetric functions with an additional real parameter $\alpha$. We present positive…

We generalize several classical results about Schur functions to the family of cylindric Schur functions. First, we give a combinatorial proof of a Murnaghan--Nakayama formula for expanding cylindric Schur functions in the power-sum basis.…

Skewing operators play a central role in the symmetric function theory because of the importance of the product structure of the symmetric function space. The theory of noncommutative symmetric functions is a useful tool for studying…

We consider s-chromatic polynomials of simplicial complexes, higher dimensional analogues of chromatic polynomials for graphs.

We describe a way to decompose the chromatic symmetric function as a positive sum of smaller pieces. We show that these pieces are $e$-positive for cycles. Then we prove that attaching a cycle to a graph preserves the $e$-positivity of…

We prove Stanley's conjecture that, if delta_n is the staircase shape, then the skew Schur functions s_{delta_n / mu} are non-negative sums of Schur P-functions. We prove that the coefficients in this sum count certain fillings of shifted…

We consider a filtration of the symmetric function space given by $\Lambda^{(k)}_t$, the linear span of Hall-Littlewood polynomials indexed by partitions whose first part is not larger than $k$. We introduce symmetric functions called the…

We define a new type of vertex coloring which generalizes vertex coloring in graphs, hypergraphs, and simplicial complexes. This coloring also generalizes oriented coloring, acyclic coloring, and star coloring. There is an associated…

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…

Stanley introduced the concept of chromatic symmetric functions of graphs which extends and refines the notion of chromatic polynomials of graphs, and asked whether trees are determined up to isomorphism by their chromatic symmetric…