Timeline for k-partite design
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 26, 2022 at 17:52 | vote | accept | Lior Gishboliner | ||
| Jan 26, 2022 at 13:34 | answer | added | Jukka Kohonen | timeline score: 1 | |
| Jan 26, 2022 at 13:06 | comment | added | Jukka Kohonen | So this "tuples match in at most one coordinate" is the intended meaning? In that case we have an answer to the question. | |
| Jan 26, 2022 at 12:23 | comment | added | Lior Gishboliner | Thanks, Jukka. I missed this simple example.. | |
| Jan 26, 2022 at 1:20 | comment | added | Jukka Kohonen | If it means "tuples match in at most one coordinate", it would be false already for $n=2$, $k=4$. If one of the tuples is (w.l.o.g.) 1111, each of the other three tuples must have three 2's, so any two of them will have two matching 2's. So is there some other meaning of "one common entry"? | |
| Jan 25, 2022 at 21:21 | comment | added | kodlu | please explicitly define "one common entry" since you talk about tuples not sets | |
| Jan 25, 2022 at 20:31 | history | asked | Lior Gishboliner | CC BY-SA 4.0 |