Related papers: Stanley's character polynomials and coloured facto…

Let $I\supsetneq J$ be two monomial ideals of a polynomial algebra over a field generated in degree $\geq d$, resp. $\geq d+1$ . We study when the Stanley Conjecture holds for $I/J$ using the recent result of \cite{IKM} concerning the…

We survey three methods for proving that the characteristic polynomial of a finite lattice factors over the nonnegative integers and indicate how they have evolved recently. The first technique uses geometric ideas and is based on…

It is known that the Ehrhart polynomials of cross-polytopes, as well as of pyramids over them, have positive coefficients. We give a combinatorial proof of this fact by showing that a scaled version of the Ehrhart polynomials are generating…

We formulate several polynomial identities. One side of these identities has a nice simple form. Whereas the other has a form of a polynomial whose coefficients contain binomial coefficients double factorials or (and) rising factorials. The…

Stanley's theory of $(P,\omega)$-partitions is a standard tool in combinatorics. It can be extended to allow for the presence of a restriction, that is a given maximal value for partitions at each vertex of the poset, as was shown by Assaf…

We use character polynomials to obtain a positive combinatorial interpretation of the multiplicity of the sign representation in irreducible polynomial representations of $GL_n(\mathbb{C})$ indexed by two-column and hook partitions. Our…

Stanley's inequalities for partially ordered sets establish important log-concavity relations for sequences of linear extensions counts. Their extremals however, i.e., the equality cases of these inequalities, were until now poorly…

Kerov's polynomials give irreducible character values in term of the free cumulants of the associated Young diagram. We prove in this article a positivity result on their coefficients, which extends a conjecture of S. Kerov. Our method,…

This paper deals with the so-called Stanley conjecture, which asks whether they are non-isomorphic trees with the same symmetric function generalization of the chromatic polynomial. By establishing a correspondence between caterpillars…

We propose a new refinement of the McKay conjecture and we prove it for symmetric groups.

In the seminal work of Stanley, several conjectures were made on the structure of Littlewood-Richardson coefficients for the multiplication of Jack symmetric functions. Motivated by recent results of Alexandersson and the present author, we…

A well-known open problem in graph theory asks whether Stanley's chromatic symmetric function, a generalization of the chromatic polynomial of a graph, distinguishes between any two non-isomorphic trees. Previous work has proven the…

Motivated by a recent conjecture of R. P. Stanley we offer a lower bound for the sum of the coefficients of a Schubert polynomial in terms of $132$-pattern containment.

We identify the Atkin polynomials in terms of associated Jacobi polynomials. Our identificationthen takes advantage of the theory of orthogonal polynomials and their asymptotics to establish many new properties of the Atkin polynomials.…

These are (mostly) expository notes for lectures on affine Stanley symmetric functions given at the Fields Institute in 2010. We focus on the algebraic and combinatorial parts of the theory. The notes contain a number of exercises and open…

Tatsuyuki Hikita recently proved the Stanley--Stembridge conjecture using probabilistic methods, showing that the chromatic symmetric functions of unit interval graphs are $e$-positive. Finding a combinatorial interpretation for these…

In recent years we have worked on a project involving poset topology, various analogues of Eulerian polynomials, and a refinement of Richard Stanley's chromatic symmetric function. Here we discuss how Stanley's ideas and results have…

A combinatorial methods are used to investigate some properties of certain generalized Stirling numbers, including explicit formula and recurrence relations. Furthermore, an expression of these numbers with symmetric function is deduced.

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…

The first author introduced a sequence of polynomials (\cite{8}, sequence A174531) defined recursively. One of the main results of this study is proof of the integrality of its coefficients.