Timeline for Two game-set inequalities
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 18, 2017 at 8:51 | comment | added | Alexander Burstein | @მამუკაჯიბლაძე Maybe, and it's also interesting to figure out exactly where the overage comes from. | |
| Nov 18, 2017 at 8:39 | comment | added | მამუკა ჯიბლაძე | Yes, I agree - I just wanted to say that maybe the central question must be how to obtain that explicit expression combinatorially. | |
| Nov 18, 2017 at 8:38 | comment | added | Alexander Burstein | @მამუკაჯიბლაძე Yes, it may be straightforward to some degree, but not very revealing. | |
| Nov 18, 2017 at 8:31 | comment | added | მამუკა ჯიბლაძე | Well, direct or indirect, an explicit expression is to the point anyway. According to the paper, $P(n,k,p)=P(n,P(k,p))$ and$$P(k,p)=p^k\sum_{i=0}^{k-1}\binom{k-1+i}{k-1}(1-p)^i$$(Lemma 1). I believe the rest must be easy after that. | |
| Nov 18, 2017 at 7:39 | history | edited | Alexander Burstein | CC BY-SA 3.0 |
added 1 character in body
|
| Nov 18, 2017 at 7:23 | history | asked | Alexander Burstein | CC BY-SA 3.0 |