Timeline for Problem about expectation of maximum partial sum
Current License: CC BY-SA 3.0
16 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 17, 2012 at 19:31 | answer | added | Henry | timeline score: 2 | |
| Jan 20, 2012 at 11:59 | vote | accept | Fan Zhang | ||
| Jan 20, 2012 at 11:59 | history | bounty ended | Fan Zhang | ||
| Jan 20, 2012 at 1:23 | answer | added | Noam D. Elkies | timeline score: 11 | |
| Jan 19, 2012 at 5:13 | answer | added | Aaron Meyerowitz | timeline score: 3 | |
| Jan 14, 2012 at 2:23 | comment | added | Fan Zhang | @Ori-Gurel-Gurevich Oh, I see. m could tend to infinity. when n should vary from a small number to a large number, I want to see how E changes when n changes given m is a very large number. | |
| Jan 13, 2012 at 18:29 | comment | added | Ori Gurel-Gurevich | @Fan: OK, but again what range for $n$ and $m$? are you interested in asymptotics when they tend to infinity? | |
| Jan 13, 2012 at 18:07 | comment | added | Fan Zhang | @Ori-Gurel-Gurevich I am also interested in the Upper bound. | |
| Jan 13, 2012 at 17:58 | comment | added | Ori Gurel-Gurevich | Do you need the exact expectation? Assuming not, what range of the parameters are you interested in? | |
| Jan 13, 2012 at 14:10 | history | bounty started | Fan Zhang | ||
| Jan 11, 2012 at 19:13 | comment | added | Alan Haynes | @Fan Zhang Ok fair enough, I think it's still an interesting question. | |
| Jan 11, 2012 at 15:17 | comment | added | Fan Zhang | @AH I am not assuming that the parts are written in increasing order. It is number composition, so order is significant here. | |
| Jan 11, 2012 at 14:20 | comment | added | Alan Haynes | @Fan Zhang Are you assuming that the parts are written in increasing order? If not then all of the $E(X_i)$'s are the same, just by considering all possible permutations. | |
| Jan 11, 2012 at 13:59 | comment | added | Fan Zhang | @IgorRivin It is not homework. I want to analyze a algorithm I proposed. And it can be converted to the above problem. | |
| Jan 11, 2012 at 13:13 | comment | added | Igor Rivin | And why do you want to compute this? Is this homework? | |
| Jan 11, 2012 at 12:14 | history | asked | Fan Zhang | CC BY-SA 3.0 |