Northwest Probability Seminar 2014 - Sampling from the Fomin-Kirillov distribution
Channel:
Subscribers:
349,000
Published on ● Video Link: https://www.youtube.com/watch?v=ZPcaBZlnJOw
I will describe recent joint work with Sara Billey (UW) and Alexander Holroyd (MSR), generalizing earlier work of mine, in which we bijectively prove the general case of Macdonald's identity in Schubert calculus. As a consequence, we also get a sampling algorithm for a probability distribution on reduced words which is implicit in work of Fomin and Kirillov. The proof involves several novel uses of David Little's generalized "bumping" algorithm.
Other Videos By Microsoft Research
Tags:
microsoft research
mathematics