Probabilistic measures and algorithms arising from the Macdonald symmetric functions

Five simple guidelines are proposed to compute the generating function for the nonnegative integer solutions of a system of linear inequalities. In contrast to other approaches, the emphasis is on deriving recurrences. We show how to use the guidelines strategically to solve some nontrivial enumeration problems in the theory of partitions and compositions. This includes a strikingly different approach to lecture hall-type theorems, with new $q$-series identities arising in th...

When $\lambda$ is a partition, the specialized non-symmetric Macdonald polynomial $E_{\lambda}(x;q;0)$ is symmetric and related to a modified Hall--Littlewood polynomial. We show that whenever all parts of the integer partition $\lambda$ is a multiple of $n$, the underlying set of fillings exhibit the cyclic sieving phenomenon (CSP) under a cyclic shift of the columns. The corresponding CSP polynomial is given by $E_{\lambda}(x;q;0)$. In addition, we prove a refined cyclic si...

The concept of $t$-difference operator for functions of partitions is introduced to prove a generalization of Stanley's theorem on polynomiality of Plancherel averages of symmetric functions related to contents and hook lengths. Our extension uses a generalization of the notion of Plancherel measure, based on walks in the Young lattice with steps given by the addition of $t$-hooks. It is well-known that the hook lengths of multiples of $t$ can be characterized by the Littlewo...

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 functions interpolate between Gessel's fundamental ($q=0$) and Stembridge's peak ($q=1$) functions, the natural quasisymmetric expansions of Schur and Schur's $Q$-symmetric functions. In this paper, we show that our $q$-fundamental functions pro...

We prove a Macdonald polynomial analogue of the celebrated Nekrasov-Okounkov hook-length formula from the theory of random partitions. As an application we obtain a proof of one of the main conjectures of Hausel and Rodriguez-Villegas from their work on mixed Hodge polynomials of the moduli space of stable Higgs bundles on Riemann surfaces.

Generalized Hall-Littlewood polynomials (Macdonald spherical functions) and generalized Kostka-Foulkes polynomials ($q$-weight multiplicities) arise in many places in combinatorics, representation theory, geometry, and mathematical physics. This paper attempts to organize the different definitions of these objects and prove the fundamental combinatorial results from ``scratch'', in a presentation which, hopefully, will be accessible and useful for both the nonexpert and resea...

In this paper we use the combinatorics of alcove walks to give a uniform combinatorial formula for Macdonald polynomials for all Lie types. These formulas are generalizations of the formulas of Haglund-Haiman-Loehr for Macdonald polynoimals of type GL(n). At q=0 these formulas specialize to the formula of Schwer for the Macdonald spherical function in terms of positively folded alcove walks and at q=t=0 these formulas specialize to the formula for the Weyl character in terms ...

For any homomorphism V on the space of symmetric functions, we introduce an operation which creates a q-analog of V. By giving several examples we demonstrate that this quantization occurs naturally within the theory of symmetric functions. In particular, we show that the Hall-Littlewood symmetric functions are formed by taking this q-analog of the Schur symmetric functions and the Macdonald symmetric functions appear by taking the q-analog of the Hall-Littlewood symmetric fu...

A recent breakthrough in the theory of (type A) Macdonald polynomials is due to Haglund, Haiman and Loehr, who exhibited a combinatorial formula for these polynomials in terms of a pair of statistics on fillings of Young diagrams. The inversion statistic, which is the more intricate one, suffices for specializing a closely related formula to one for the type A Hall-Littlewood Q-polynomials (spherical functions on p-adic groups). An apparently unrelated development, at the lev...

A breakthrough in the theory of (type A) Macdonald polynomials is due to Haglund, Haiman and Loehr, who exhibited a combinatorial formula for these polynomials in terms of fillings of Young diagrams. Recently, Ram and Yip gave a formula for the Macdonald polynomials of arbitrary type in terms of the corresponding affine Weyl group. In this paper, we show that a Haglund-Haiman-Loehr type formula follows naturally from the more general Ram-Yip formula, via compression. Then we ...