Related papers: Power sum expansions for Kromatic symmetric functi…
For any positive integer $k$ and nonnegative integer $m$, we consider the symmetric function $G\left( k,m\right)$ defined as the sum of all monomials of degree $m$ that involve only exponents smaller than $k$. We call $G\left( k,m\right)$ a…
In our previous works we introduced a $q$-deformation of the generating functions for enriched $P$-partitions. We call the evaluation of this generating functions on labelled chains, the $q$-fundamental quasisymmetric functions. These…
The purpose of this paper is to introduce and study the following graph theoretic paradigm. Let $$T_Kf(x)=\int K(x,y) f(y) d\mu(y),$$ where $f: X \to {\Bbb R}$, $X$ a set, finite or infinite, and $K$ and $\mu$ denote a suitable kernel and a…
Chromatic quasisymmetric functions of labeled graphs were defined by Shareshian and Wachs as a refinement of Stanley's chromatic symmetric functions. In this extended abstract, we consider an extension of their definition from labeled…
Given a graph $G$, the $k$-coloring graph $\mathcal{C}_k(G)$ is constructed by selecting proper $k$-colorings of $G$ as vertices, with an edge between two colorings if they differ in the color of exactly one vertex. The number of vertices…
The Knop-Sahi interpolation Macdonald polynomials are inhomogeneous and nonsymmetric generalisations of the well-known Macdonald polynomials. In this paper we apply the interpolation Macdonald polynomials to study a new type of basic…
We compare the space of square-summable functions on an infinite graph (denoted $\ell^2(G)$) with the space of functions of finite energy (denoted $\mathcal{H}_{\mathcal{E}}$). There is a notion of inclusion that allows $\ell^2(G)$ to be…
This article is dedicated to the study of positivity phenomena for the chromatic symmetric function of a graph with respect to various bases of symmetric functions. We give a new proof of Gasharov's theorem on the Schur-positivity of the…
We have recently proposed arXiv:2105.11565 a powerful method for computing group factors of the perturbative series expansion of the Wilson loop in the Chern-Simons theory with $SU(N)$ gauge group. In this paper, we apply the developed…
This paper presents the basic properties of chromatic derivatives and chromatic expansions and provides an appropriate motivation for introducing these notions. Chromatic derivatives are special, numerically robust linear differential…
In 1995, Richard Stanley introduced the chromatic symmetric function $X_G$ of a graph $G$ and proved that, when written in terms of the elementary symmetric functions, it reveals the number of acyclic orientations of $G$ with a given number…
The machinery of noncommutative Schur functions provides a general tool for obtaining Schur expansions for combinatorially defined symmetric functions. We extend this approach to a wider class of symmetric functions, explore its strengths…
Let $T$ be an unrooted tree. The \emph{chromatic symmetric function} $X_T$, introduced by Stanley, is a sum of monomial symmetric functions corresponding to proper colorings of $T$. The \emph{subtree polynomial} $S_T$, first considered…
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…
Linearized polynomials over finite fields have been intensively studied over the last several decades. Interesting new applications of linearized polynomials to coding theory and finite geometry have been also highlighted in recent years.…
Asvin G and Andrew O'Desky recently introduced the graded algebra P$\Lambda$ of polysymmetric functions as a generalization of the algebra $\Lambda$ of symmetric functions. This article develops combinatorial formulas for some…
This paper describes how many known graph polynomials arise from the coefficients of chromatic symmetric function expansions in different bases, and studies a new polynomial arising by expanding over a basis given by chromatic symmetric…
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…
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…
Graph polynomials are deemed useful if they give rise to algebraic characterizations of various graph properties, and their evaluations encode many other graph invariants. Algebraic: The complete graphs $K_n$ and the complete bipartite…