Timeline for Does a sequence of coin-tosses a.s. have a subsequence on which the remainder of the sequence can be identified with the position in the sequence?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 26, 2022 at 1:01 | vote | accept | Julian Newman | ||
| Mar 25, 2022 at 17:24 | answer | added | Yuval Peres | timeline score: 2 | |
| Mar 24, 2022 at 17:01 | comment | added | Julian Newman | @JohanWästlund But at least, I guess there should exist some monotone transformation of your $h$ that works? | |
| Mar 24, 2022 at 16:48 | comment | added | Julian Newman | @JohanWästlund Nice - is the proof obvious that your $h$ fulfils the requirement? | |
| Mar 24, 2022 at 16:17 | comment | added | Johan Wästlund | It seems to me we can just interpret the sequence as the binary representation of a number between 0 and 1, and let h(X) be the reciprocal of this number, rounded down to an integer. | |
| Mar 24, 2022 at 15:22 | history | asked | Julian Newman | CC BY-SA 4.0 |