Friday, 12 February 2010

rt.representation theory - representation theoretic interpretation of Jack polynomials

Monomial symmetric polynomials on n variables x1,ldotsxn form a natural basis of the space mathcalSn of symmetric polynomials on n variables and are defined by additive symmetrization of the function xlambda=xlambda11xlambda22ldotsxlambdann. Here lambda is a sequence of n nonnegative numbers, arranged in non-increasing order, hence can also be viewed as partition of some integer with number of parts l(lambda)len.



Power sum polynomials plambda on n variables also form a basis for mathcalSn



and are defined as
plambda=prodni=1plambdai, where pr=sumni=1xri.



Schur functions slambda (polynomials) form a basis of the space of symmetric polynomials, indexed by partitions lambda of at most n parts, and are characterized uniquely by two properties:



  1. langleslambda,smurangle=0 when lambdaneqmu, where the inner product is defined on the power sum basis by langleplambda,pmurangle=deltalambda,muzlambda, and zlambda=prodni=1ialphaialphai!, where alphai is the number of parts in lambda whose lengths all equal i. Notice n!/zlambda is the size of the conjugacy class in the symmetric group Ssumlambdai whose cycle structure is given precisely by lambda.


  2. If one writes slambda as linear combination of mmu's, then the mlambda coefficient is 1 and mmu coefficients are all 0 if mu>lambda, meaning the partial sums inequality sumki=1muigesumki=1lambdai hold for all k and is strict for at least one k. Thus one can say the transition matrix from Schur to monomial polynomial basis is upper triangular with 1's on the diagonal.


Jack polynomials generalize Schur polynomials in the theory of symmetric functions by replacing the inner product in the first characterizing condition above with langleplambda,pmurangle=deltalambda,mualphal(lambda)zlambda. The second condition remains the same. It can be thought of as an exponential tilting of the Schur polynomials, and in fact it is intimately connected with the Ewens sampling distribution with parameter alpha1, a 1-parameter probability measure on Sn or on the set of partitions of n that generalize the uniform measure and the induced measure on partitions respectively.



It turns out that the theory of Schur polynomials has connections with classical representation theory of the symmetric group Sn. For instance the irreducible characters of Sn are related to the change of basis coefficient from Schur polynomials to power sum polynomials in the following way:



if we write slambda=summuclambda,mupmu, then
chilambda(mu)=clambda,muzlambda1.

.



These are eigenfunctions of the so-called random transposition walk on Sn, when viewed as a walk on the space of partitions. The eigenfunctions of the actual random transposition walk on Sn are proportional to the diagonal elements of rho, rho ranges over all irreducible representations of Sn.



The characters chilambda admit natural generalization in the Jack polynomial setting: simply take the transition coefficients from the Jack polynomials to the poewr sum polynomials. And these when properly normalized indeed gives the eigenfunctions for the so-called metropolized random transposition walk that converges to the Ewens sampling distribution, which is an exponentially tilted 1-parameter family of uniform measure on Sn.



My question is, what is the analogue of the diagonal enties of the representations of rho in the Jack case? Certainly they will be functions on Sn.

No comments:

Post a Comment