Probabilistic measures and algorithms arising from the Macdonald symmetric functions

Using the combinatorial formula for the transformed Macdonald polynomials of Haglund, Haiman, and Loehr, we investigate the combinatorics of the symmetry relation $\widetilde{H}_\mu(\mathbf{x};q,t) = \widetilde{H}_{\mu^\ast}(\mathbf{x};t,q)$. We provide a purely combinatorial proof of the relation in the case of Hall-Littlewood polynomials ($q=0$) when $\mu$ is a partition with at most three rows, and for the coefficients of the square-free monomials in $\mathbf{x}$ for all s...

Symmetric functions provide one of the most efficient tools for combinatorial enumeration, in the context of objects that may be acted upon by permutations. Only assuming a basic knowledge of linear algebra, we introduce and describe the classical toolbox of symmetric functions, and give many examples of their uses. In particular, we present how classical formulas of enumerative combinatorics afford a natural generalization in terms of symmetric functions. We then rapidly pre...

This paper uses the theory of dual equivalence graphs to give explicit Schur expansions for several families of symmetric functions. We begin by giving a combinatorial definition of the modified Macdonald polynomials and modified Hall-Littlewood polynomials indexed by any diagram $\delta \subset {\mathbb Z} \times {\mathbb Z}$, written as $\widetilde H_{\delta}(X;q,t)$ and $\widetilde H_{\delta}(X;0,t)$, respectively. We then give an explicit Schur expansion of $\widetilde H_...

We prove a combinatorial formula for the Macdonald polynomial H_mu(x;q,t) which had been conjectured by the first author. Corollaries to our main theorem include the expansion of H_mu(x;q,t) in terms of LLT polynomials, a new proof of the charge formula of Lascoux and Schutzenberger for Hall-Littlewood polynomials, a new proof of Knop and Sahi's combinatorial formula for Jack polynomials as well as a lifting of their formula to integral form Macdonald polynomials, and a new c...

Given a partition $\la = (\la_1, \la_2, ... \la_k)$, let $\la^{rc} = (\la_2-1, \la_3-1, ... \la_k-1)$. It is easily seen that the diagram $\la\slash \la^{rc}$ is connected and has no $2 \times 2$ subdiagrams which we shall refer to as a ribbon. To each ribbon $R$, we associate a symmetric function operator $S^R$. We may define the major index of a ribbon $maj(R)$ to be the major index of any permutation that fits the ribbon. This paper is concerned with the operator $H_{1^k}^...

Macdonald processes are probability measures on sequences of partitions defined in terms of nonnegative specializations of the Macdonald symmetric functions and two Macdonald parameters q,t in [0,1). We prove several results about these processes, which include the following. (1) We explicitly evaluate expectations of a rich family of observables for these processes. (2) In the case t=0, we find a Fredholm determinant formula for a q-Laplace transform of the distribution of...

The asymptotic study of the conjugacy classes of a random element of the finite affine group leads one to define a probability measure on the set of all partitions of all positive integers. Four different probabilistic understandings of this measure are given--three using symmetric function theory and one using Markov chains. This leads to non-trivial enumerative results. Cycle index generating functions are derived and are used to compute the large dimension limiting probabi...

We give an explicit combinatorial formula for the Schur expansion of Macdonald polynomials indexed by partitions with second part at most two. This gives a uniform formula for both hook and two column partitions. The proof comes as a corollary to the result that generalized dual equivalence classes of permutations are unions of standard dual equivalence classes of permutations for certain cases, establishing an earlier conjecture of the author.

We investigate the connections between various noncommutative analogues of Hall-Littlewood and Macdonald polynomials, and define some new families of noncommutative symmetric functions depending on two sequences of parameters.

The Macdonald process is a stochastic process on the collection of partitions that is a $(q,t)$-deformed generalization of the Schur process. In this paper, we approach the Macdonald process identifying the space of symmetric functions with a Fock representation of a Heisenberg algebra. By using the free field realization of operators diagonalized by the Macdonald symmetric functions, we propose a method of computing several correlation functions with respect to the Macdonald...