Koike, K., On a conjecture of Stanley on Jack symmetric functions, Discrete Mathematics 115 (1993) 211-216. The Jack symmetric function J,(x; G() is a symmetric function with interesting properties that J,(x; 2) is a spherical function of the symmetric pair (GL(n, FQ O(n, [w)) and that J,(x; 1) is
A Markov chain on the symmetric group and Jack symmetric functions
β Scribed by Phil Hanlon
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 872 KB
- Volume
- 99
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
Hanlon, P., A Markov chain on the symmetric group and Jack symmetric functions, Discrete Mathematics 99 (1992) 123-140. Diaconis and Shahshahani studied a Markov chain Wf(l) whose states are the elements of the symmetric group S,. In W,(l), you move from a permutation n to any permutation of the form a(i, j) with equal probability. In this paper we study a deformation W,(a) of this Markov chain which is obtained by applying the Metropolis algorithm to Wf(l). The stable distribution of W,(a) is 6-C(Z) where C(A) denotes the number of cycles of x. Our main result is that the eigenvectors of the transition matrix of W,(a) are the Jack symmetric functions.
We use facts about the Jack symmetric functions due to Macdonald and Stanley to obtain precise estimates for the rate of convergence of W,( (u) to its stable distribution.
π SIMILAR VOLUMES
We show that the number of factorizations \_=/ 1 } } } / r of a cycle of length n into a product of cycles of lengths a 1 , ..., a r , with r j=1 (a j &1)=n&1, is equal to n r&1 . This generalizes a well known result of J. Denes, concerning factorizations into a product of transpositions. We investi
We present a general recursive algorithm for the efficient construction of N-body wave functions that belong to a given irreducible representation (irrep) of the orthogonal group and are at the same time characterized by a well-defined permutational symmetry. The main idea is to construct independen
In unpublished work, Macdonald gave an indirect proof that the connexion coefficients for certain symmetric functions coincide with the connexion coefficients of the class algebra of the symmetric group. We give a direct proof of this result and demonstrate the use of these functions in a number of