In this paper, we develop the combinatorial interpretations of the transition matrices between the bases of the B,, analogues of the symmetric functions. In order to provide a complete reference, we have included a summary of the transition matrices for symmetric functions as well.
Multisets and the Combinatorics of Symmetrical Functions
β Scribed by M. Mendez
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 782 KB
- Volume
- 102
- Category
- Article
- ISSN
- 0001-8708
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In the study of the irreducible representations of the unitary group U(n), one encounters a class of polynomials defined on n 2 indeterminates z ij , 1 i, j n, which may be arranged into an n\_n matrix array Z=(z ij ). These polynomials are indexed by double Gelfand patterns, or equivalently, by pai
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
The ring QSym of quasi-symmetric functions is naturally the dual of the Solomon descent algebra. The product and the two coproducts of the first (extending those of the symmetric functions) correspond to a coproduct and two products of the second, which are defined by restriction from the symmetric
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 for