Related papers: LLT cumulants and graph coloring

Kerov functions provide an infinite-parametric deformation of the set of Schur functions, which is a far-going generalization of the 2-parametric Macdonald deformation. In this paper, we concentrate on a particular subject: on Kerov…

We consider sequences of symmetric $U$-statistics, not necessarily Hoeffding-degenerate, both in a one- and multi-dimensional setting, and prove quantitative central limit theorems (CLTs) based on the use of {\it contraction operators}. Our…

We give a combinatorial expansion of the stable Grothendieck polynomials of skew Young diagrams in terms of skew Schur functions, using a new row insertion algorithm for set-valued semistandard tableaux of skew shape. This expansion unifies…

Motivated by Stanley's generalization of the chromatic polynomial of a graph to the chromatic symmetric function, we introduce the characteristic polynomial of a representation of the symmetric group, or more generally, of a symmetric…

We introduce Macdonald characters and use algebraic properties of Macdonald polynomials to study them. As a result, we produce several formulas for Macdonald characters, which are generalizations of those obtained by Gorin and Panova in…

We associate a polynomial to any diagram of unit cells in the first quadrant of the plane using Kohnert's algorithm for moving cells down. In this way, for every weak composition one can choose a cell diagram with corresponding row-counts,…

In \cite{MPU} a functional CLT was obtained for triangular arrays satisfying the Lindeberg condition, that the sum of the individual variances is at most the same order as the variance of the underlying sum, and under the optimal mixing…

Dual equivalence graphs are a powerful tool in symmetric function theory that provide a general framework for proving that a given quasisymmetric function is symmetric and Schur positive. In this paper, we study a larger family of graphs…

This work highlights the existence of partial symmetries in large families of iterated plethystic coefficients. The plethystic coefficients involved come from the expansion in the Schur basis of iterated plethysms of Schur functions indexed…

Given a zero-mean Gaussian random field with a covariance function that belongs to a parametric family of covariance functions, we introduce a new notion of likelihood approximations, termed truncated-likelihood functions.…

We prove that the HOMFLYPT polynomial of a link, colored by partitions with a fixed number of rows is a $q$-holonomic function. Specializing to the case of knots colored by a partition with a single row, it proves the existence of an…

Colored lattice models can be used to describe many different types of special functions of interest in both algebraic combinatorics and representation theory, for example Schur polynomials, nonsymmetric Macdonald polynomials, and…

In their 2011 paper on the AGT conjecture, Alba, Fateev, Litvinov and Tarnopolsky (AFLT) obtained a closed-form evaluation for a Selberg integral over the product of two Jack polynomials, thereby unifying the well-known Kadell and…

Stanley introduced the chromatic symmetric function of a simple graph, which is a generalization of a chromatic polynomial. This is expressed in terms of the integer points of the complements of the corresponding graphic arrangement.…

Leighton's graph covering theorem states that a pair of finite graphs with isomorphic universal covers have a common finite cover. We provide a new proof of Leighton's theorem that allows generalizations; we prove the corresponding result…

We introduce path-conjoined graphs defined for two rooted graphs by joining their roots with a path, and investigate the chromatic symmetric functions of its two generalizations: spider-conjoined graphs and chain-conjoined graphs. By using…

FPSAC 2013 Extended Abstract. We introduce a new basis of the non-commutative symmetric functions whose elements have Schur functions as their commutative images. Dually, we build a basis of the quasi-symmetric functions which expand…

We provide a formula for every Schur coefficient in the chromatic symmetric function of a graph in terms of special rim hook tabloids. This formula is useful in confirming the non-Schur positivity of the chromatic symmetric function of a…

Motivated by a connection between the topology of (generalized) configuration spaces and chromatic polynomials, we show that generating functions of Hodge-Deligne polynomials of quasiprojective varieties and colorings of acyclic directed…

For a graph $G$, its Tutte symmetric function $XB_G$ generalizes both the Tutte polynomial $T_G$ and the chromatic symmetric function $X_G$. We may also consider $XB$ as a map from the $t$-extended Hopf algebra $\mathbb{G}[t]$ of labelled…