Timeline for A balancing property of infinite subsets of $\mathbb{N}$
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 7, 2020 at 14:05 | vote | accept | Dominic van der Zypen | ||
| Jan 7, 2020 at 11:54 | answer | added | bof | timeline score: 6 | |
| Jan 7, 2020 at 11:50 | review | Close votes | |||
| Jan 11, 2020 at 23:38 | |||||
| Jan 7, 2020 at 10:57 | comment | added | Martin Sleziak | Isn't this sometimes called relative density (of the set $A$ with respect to the set $S$)? | |
| Jan 7, 2020 at 10:56 | comment | added | bof | A random subset of $\omega$ (meaning that $n\in A$ iff the $n^{\text{th}}$ toss in an infinite sequence of fair coin tosses comes of heads) will do the job with probability $1$. | |
| Jan 7, 2020 at 10:47 | history | edited | Dominic van der Zypen | CC BY-SA 4.0 |
deleted 88 characters in body
|
| Jan 7, 2020 at 10:46 | comment | added | Dominic van der Zypen | Oh right :-) Will simplify the post accordingly, thanks @GHfromMO | |
| Jan 7, 2020 at 10:45 | comment | added | GH from MO | $\liminf a_n=\limsup a_n=1/2$ can be abbreviated as $\lim a_n=1/2$. | |
| Jan 7, 2020 at 10:42 | comment | added | Dominic van der Zypen | If we take ${\frak S}$ to be the collection of infinite recursive sets of $\omega$, then any such $A$ would correspond to a bitstream that is computationally random. | |
| Jan 7, 2020 at 10:39 | history | asked | Dominic van der Zypen | CC BY-SA 4.0 |