Northwest Probability Seminar 2014 - Sampling from the Fomin-Kirillov distribution
104
Microsoft Research330 тыс
Следующее
22.06.16 – 6191:05:54Популярные
31 день – 1 41759:42
120 дней – 71115:51Опубликовано 22 июня 2016, 2:12
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.
Свежие видео
4 дня – 1683:43
10 дней – 3 7320:29
11 дней – 56 4485:35
12 дней – 25 4308:55
15 дней – 6 4350:31Случайные видео
236 дней – 3 9944:47
321 день – 878 6224:01
05.06.23 – 38 1160:30
30.10.22 – 293 9159:44
09.04.22 – 2 154 86810:42
24.09.10 – 14 1993:07
4 дня – 4550:15
7 дней – 93 51311:51
7 дней – 710:27
9 дней – 2 7751:00
9 дней – 12 5021:26
10 дней – 1 2540:52