Related papers: A proof of the Stanley--Stembridge conjecture

We compute the whole asymptotic expansion of the probability that a large uniform labeled graph is connected, and of the probability that a large uniform labeled tournament is irreducible. In both cases, we provide a combinatorial…

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…

Let G be a graph, and let $\chi$G be its chromatic polynomial. For any non-negative integers i, j, we give an interpretation for the evaluation $\chi$ (i) G (--j) in terms of acyclic orientations. This recovers the classical interpretations…

The Stanley chromatic symmetric function $X_G$ of a graph $G$ is a symmetric function generalization of the chromatic polynomial, and has interesting combinatorial properties. We apply the ideas of Khovanov homology to construct a homology…

The chromatic symmetric $X_G$ function is a symmetric function generalization of the chromatic polynomial of a graph, introduced by Stanley (1995). Stanley gave an expansion formula for $X_G$ in terms of the power sum symmetric functions…

We prove a general inclusion-exclusion relation for the extended chromatic symmetric function of a weighted graph, which specializes to (extended) $k$-deletion, and we give two methods to obtain numerous new bases from weighted graphs for…

The chromatic symmetric function of a graph is a generalization of the chromatic polynomial. The key motivation for studying the structure of a chromatic symmetric function is to answer positivity conjectures by Stanley in 1995 and Gasharov…

We study the chromatic symmetric function on graphs, and show that its kernel is spanned by the modular relations. We generalize this result to the chromatic quasisymmetric function on hypergraphic polytopes, a family of generalized…

We give an elementary proof of the development of Macdonald polynomials in terms of "modified complete" and elementary symmetric functions.

We propose that geometric quantization of symplectic manifolds is the arrow part of a functor, whose object part is deformation quantization of Poisson manifolds. The `quantization commutes with reduction' conjecture of Guillemin and…

The chromatic polynomial and its generalization, the chromatic symmetric function, are two important graph invariants. Celebrated theorems of Birkhoff, Whitney, and Stanley show how both objects can be expressed in three different ways: as…

We define the acyclic orientation polynomial of a graph to be the generating function for the sinks of its acyclic orientations. Stanley proved that the number of acyclic orientations is equal to the chromatic polynomial evaluated at $-1$…

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…

We provide a construction for the kromatic symmetric function $\overline{X}_G$ of a graph introduced by Crew, Pechenik, and Spirkl using combinatorial (linearly compact) Hopf algebras. As an application, we show that $\overline{X}_G$ has a…

We prove the Strengthened Hanna Neumann Conjecture, in its common graph theoretic formulation. Our original approach to this conjecture used cohomology of sheaves on graphs, although here we give a short combinatorial proof that we found in…

Schur functions are a basis of the symmetric function ring that represent Schubert cohomology classes for Grassmannians. Replacing the cohomology ring with $K$-theory yields a rich combinatorial theory of inhomogeneous deformations, where…

We define a new family of symmetric functions which are affine analogues of Stanley symmetric functions. We establish basic properties of these functions including symmetry, dominance and conjugation. We conjecture certain positivity…

For a hypergraphic polytope there is a weighted quasisymmetric function which enumerates positive integer points in its normal fan and determines its f-polynomial. This quasisymmetric function invariant of hypergraphs extends the Stanley…

We give an upper bound for the Stanley depth of the edge ideal $I$ of a $k$-partite complete graph and show that Stanley's conjecture holds for $I$. Also we give an upper bound for the Stanley depth of the edge ideal of a $k$-uniform…

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…