Probabilistic measures and algorithms arising from the Macdonald symmetric functions
| dc.creator | Fulman, Jason | |
| dc.date | 1997-12-09 | |
| dc.date.accessioned | 2026-07-07T05:23:23Z | |
| dc.date.available | 2026-07-07T05:23:23Z | |
| dc.description | 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. | |
| dc.description | 30 pages | |
| dc.identifier | https://arxiv.org/abs/math/9712237 | |
| dc.identifier | http://arxiv.org/abs/math/9712237 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/76417 | |
| dc.subject | Combinatorics | |
| dc.subject | Probability | |
| dc.subject | Quantum Algebra | |
| dc.subject | 05E05;60C05 | |
| dc.title | Probabilistic measures and algorithms arising from the Macdonald symmetric functions | |
| dc.type | text |