Timeline for Recovering set of $k$-subsets without specific element $t$ by modifying subsets with element $t$
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 28, 2020 at 2:10 | vote | accept | timudk | ||
| Oct 28, 2020 at 1:35 | comment | added | Tony Huynh | I edited the question to what I think is intended and corrected some typos. Feel free to edit if I misinterpreted you. | |
| Oct 28, 2020 at 1:34 | history | edited | Tony Huynh | CC BY-SA 4.0 |
added 6 characters in body
|
| Oct 28, 2020 at 0:16 | answer | added | Tony Huynh | timeline score: 3 | |
| Oct 27, 2020 at 23:47 | comment | added | Tony Huynh | @LSpice I assume what is meant is whether it is possible to choose elements such that the collection of all $T_i \setminus \{t\} \cup \{u_i\}$ (not the union) is equal to $\mathcal R$. Also, it seems as if the sequence should be $(2,4,5,2)$ instead of $(2,4,5,1)$. | |
| Oct 27, 2020 at 23:42 | review | Close votes | |||
| Nov 13, 2020 at 2:32 | |||||
| Oct 27, 2020 at 22:32 | comment | added | LSpice | This seems ill typed. Each $T_i \setminus \{t\} \cup \{u_i\}$ is a subset of $S$. How can the union of such objects equal $\mathcal R$, which is a subset of $2^S$? (Maybe you mean to start with a specific $R \in \mathcal R$. But then do you really mean to pick randomly? The rest of the problem seems not to be asking anything probabilistic.) | |
| Oct 27, 2020 at 22:26 | review | First posts | |||
| Oct 28, 2020 at 7:15 | |||||
| Oct 27, 2020 at 22:26 | history | asked | timudk | CC BY-SA 4.0 |