Related papers: A new polynomial on compositions of integers: on d…

We present families of combinatorial classes described as trees with nodes that can carry one of two types of "flowers": integer partitions or integer compositions. Two parameters on the flowers of trees will be considered: the number of…

The monomial basis for polynomials in N variables is labeled by compositions. To each composition there is associated a hook-length product, which is a product of linear functions of a parameter. The zeroes of this product are related to…

We give a new interpretation of the chromatic polynomial of a simple graph G in terms of the Kac-Moody Lie algebra with Dynkin diagram G. We show that the chromatic polynomial is essentially the q-Kostant partition function of this Lie…

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…

We introduce and study several combinatorial properties of a class of symmetric polynomials from the point of view of integrable vertex models in finite lattice. We introduce the $L$-operator related with the $U_q(sl_2)$ $R$-matrix, and…

In this article we show how to compute the chromatic quasisymmetric function of indifference graphs from the modular law introduced by Guay-Paquet. We provide an algorithm which works for any function that satisfies this law, such as…

We study the combinatorial geometry of "lattice" Jenkins--Strebel differentials with simple zeroes and simple poles on $\mathbb{C}P^1$ and of the corresponding counting functions. Developing the results of M. Kontsevich we evaluate the…

In 1995, Stanley introduced the well-known chromatic symmetric function $X_{G}(x_{1},x_{2},\ldots)$ of a graph $G$. It is a sum of monomial symmetric functions such that for each vertex coloring of $G$ there is exactly one of these…

Representation theory of the symmetric group $\mathfrak{S}_n$ has a very distinctive combinatorial flavor. The conjugacy classes as well as the irreducible characters are indexed by integer partitions $\lambda \vdash n$. We introduce class…

The paper [GLZ] "L-functions of Carlitz modules, resultantal varieties and rooted binary trees" is devoted to a description of some resultantal varieties related to L-functions of Carlitz modules. It contains a conjecture that some of these…

The $B$-polynomial defined by J. Awan and O. Bernardi is a generalization of Tutte Polynomial to digraphs. In this paper, we solve an open question raised by J. Awan and O. Bernardi regarding the expansion of $B$-polynomial in elementary…

In this article we describe a new inductive approach to compute the chromatic polynomial of simple graphs and the characteristic polynomial of central hyperplane arrangements.

As introduced by Gutman and Harary, the independence polynomial of a graph serves as the generating polynomial of its independent sets. In 1987, Alavi, Malde, Schwenk and Erd\H{o}s conjectured that the independence polynomials of all trees…

In this article we introduce a new matroid invariant, a combinatorial analog of the topological zeta function of a polynomial. More specifically we associate to any ranked, atomic meet-semilattice L a rational function Z(L,s), in such a way…

This paper discusses ways to categorify chromatic, dichromatic and Penrose polynomials, including categorifications of integer evaluations of chromatic polynomials. We show that with an appropriate choice of variables the coefficients of…

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…

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…

We elaborate on the notion of a filtration of an operad defined in terms of a lattice-valued operad serving as an indexing object. That covers ordinary integer-indexed filtrations of associative algebras and operads as a special case, yet…

The independence polynomial $I(G, x)$ of a graph $G$ is the polynomial in variable $x$ in which the coefficient $a_n$ on $x^n$ gives the number of independent subsets $S \subseteq V(G)$ of vertices of $G$ such that $|S| = n$. $I(G, x)$ is…

We define an equivalence relation on integer compositions and show that two ribbon Schur functions are identical if and only if their defining compositions are equivalent in this sense. This equivalence is completely determined by means of…