Mathematics – Combinatorics
Scientific paper
1997-12-09
Mathematics
Combinatorics
30 pages
Scientific paper
The Macdonald symmetric functions are used to define measures on the set of all partitions of all integers. Probabilistic algorithms are given for growing partitions according to these measures. The case of Hall-Littlewood polynomials is related to the finite classical groups, and the corresponding algorithms simplify. The case of Schur functions leads to a $q$-analog of Plancharel measure, and a conditioned version of the corresponding algorithms yields generalizations of the hook walk of combinatorics.
No associations
LandOfFree
Probabilistic measures and algorithms arising from the Macdonald symmetric functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Probabilistic measures and algorithms arising from the Macdonald symmetric functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Probabilistic measures and algorithms arising from the Macdonald symmetric functions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-16489