A random \(q,t\)-hook walk and a sum of Pieri coefficients (Q1268629): Difference between revisions

The authors adopt a method by \textit{C. Greene, A. Nijenhuis} and \textit{H. S. Wilf} [Adv. Math. 31, 104-109 (1979; Zbl 0398.05008)] to give a combinatorial proof of an identity whose right-hand side is the biexponent generator of a (number) partition \(\mu\). The biexponent generator is the two-variable generating polynomial of the co-arm and co-leg of the boxes of the partition \(\mu\) written as a Ferrers diagram. It is mentioned that the result has another proof using deep identities established by Macdonald. The left-hand side of the identity is a sum over functions related to the Pieri rule for Macdonald polynomials and indexed by partitions \(\nu\) that immediately precede \(\mu\) in Young's lattice; in particular, they have one box less than \(\mu\). By the modified Greene-Nijenhuis-Wilf method the terms in the identity are interpreted through probabilities in a random walk on the Ferrers board.