Related papers: Symmetric function generalizations of graph polyno…
The reconstruction conjecture has remained open for simple undirected graphs since it was suggested in 1941 by Kelly and Ulam. In an attempt to prove the conjecture, many graph invariants have been shown to be reconstructible from the…
We study the polynomial approximation of symmetric multivariate functions and of multi-set functions. Specifically, we consider $f(x_1, \dots, x_N)$, where $x_i \in \mathbb{R}^d$, and $f$ is invariant under permutations of its $N$…
This paper realizes of two families of combinatorial symmetric functions via the complex character theory of the finite general linear group $\mathrm{GL}_{n}(\mathbb{F}_{q})$: chromatic quasisymmetric functions and vertical strip LLT…
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…
We present the basic elements of a generalization of symmetric function theory involving functions of commuting and anticommuting (Grassmannian) variables. These new functions, called symmetric functions in superspace, are invariant under…
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…
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…
Steingrimsson (2001) showed that the chromatic polynomial of a graph is the Hilbert function of a relative Stanley-Reisner ideal. We approach this result from the point of view of Ehrhart theory and give a sufficient criterion for when the…
The bivariate chromatic polynomial $\chi_G(x,y)$ of a graph $G = (V, E)$, introduced by Dohmen-P\"{o}nitz-Tittmann (2003), counts all $x$-colorings of $G$ such that adjacent vertices get different colors if they are $\le y$. We extend this…
Plethysm is a fundamental operation in symmetric function theory, derived directly from its connection with representation theory. However, it does not admit a simple combinatorial interpretation, and finding coefficients of Schur function…
The chromatic polynomials are studied by several authors and have important applications in different frameworks, specially, in graph theory and enumerative combinatorics. The aim of this work is to establish some properties of the…
In this paper, usual Sturm-Liouville problems are extended for symmetric functions so that the corresponding solutions preserve the orthogonality property. Two basic examples, which are special cases of a generalized Sturm-Liouville…
We expand the chromatic symmetric functions for Dyck paths of bounce number three in the elementary symmetric function basis using a combinatorial interpretation of the inverse of the Kostka matrix studied in E\u{g}ecio\u{g}lu-Remmel…
We compute an explicit $e$-positive formula for the chromatic symmetric function of a lollipop graph, $L_{m,n}$. From here we deduce that there exist countably infinite distinct $e$-positive, and hence Schur-positive, bases of the algebra…
We describe how the chromatic symmetric function of two graphs glued at a single vertex can be expressed as a matrix multiplication using certain information of the two individual graphs. We then prove new $e$-positivity results by using a…
We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…
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…
We study the chromatic symmetric functions of graph classes related to spiders, namely generalized spider graphs (line graphs of spiders), and what we call horseshoe crab graphs. We show that no two generalized spiders have the same…
In this paper, we introduce and study two variants of the chromatic quasisymmetric function of a graph: the total chromatic quasisymmetric function via vertex labeling and via acyclic orientations. The original definition of the chromatic…
We investigate the existence and the orthogonality of the generalized Jack symmetric functions which play an important role in the AGT relations. We show their orthogonality by deforming them to the generalized Macdonald symmetric…