A generalization of the birthday problem
616
51.3
Microsoft Research331 тыс
Следующее
11.08.16 – 2 43759:49Популярные
46 дней – 4 06715:12
309 дней – 1 55453:47Опубликовано 11 августа 2016, 23:54
The birthday problem states that there is at least half a chance that some two out of twenty-three randomly chosen people will share the same birth date. The calculation for this problem assumes that all birth dates are equally likely. What if the distribution of birth dates is non-uniform and possibly even unknown? Further what if we focus on birthdays shared by two friends rather than any two people? I will present some of our results and conjectures in this generalized setting. I will also show how these results are related to the Stanley-Stembridge poset chain conjecture and the 'shameful conjecture', two famous conjectures in combinatorics.
Свежие видео
4 дня – 150 02035:17
8 дней – 2 64635:22
9 дней – 1 2500:23
18 дней – 202 6009:27
23 дня – 30 993 7912:31
Случайные видео
50 дней – 37 05311:41
128 дней – 18 3061:06
306 дней – 27 8520:10
09.01.23 – 2 151 12718:52
08.12.21 – 11 8031:10
23.10.16 – 13 37213:42
1 день – 1998:43
1 день – 7129:33
5 дней – 1 6300:25
5 дней – 8390:37
8 дней – 58 38215:37
