Timeline for Permutation matrices with large distance
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 29, 2021 at 23:21 | comment | added | kodlu | Has the very nice answer addressed your question? | |
| Jul 28, 2021 at 22:37 | answer | added | Ilya Bogdanov | timeline score: 7 | |
| Jul 27, 2021 at 0:28 | comment | added | Tony Huynh | @SamHopkins I think your interpretation is correct, except the OP is probably taking the $\ell_\infty$ distance instead of the taxi cab distance (this would give $d=2$). If this is what is intended, I agree the question is interesting. | |
| Jul 26, 2021 at 18:01 | comment | added | Sam Hopkins | With the interpretation from my comment above, I believe this is an interesting question, and so I want to record that I am against closing it. | |
| Jul 26, 2021 at 13:56 | comment | added | Sam Hopkins | I think I understand what the OP is asking: they mean minimum taxicab distance between two cells containing 1's. Although I would say this example has distance 3. | |
| Jul 26, 2021 at 10:07 | review | Close votes | |||
| Aug 2, 2021 at 3:06 | |||||
| Jul 26, 2021 at 9:15 | comment | added | Sean Eberhard | To me the Hamming distance between vectors $x$ and $y$ is the number of indices $i$ such that $x_i \neq y_i$. So here is $d \in \{0, 1, 2\}$? And for any nontrivial permutation matrix $d = 2$? | |
| Jul 26, 2021 at 9:13 | comment | added | Gerry Myerson | Not clear to me what the Hamming distance between a pair of ones is. | |
| Jul 26, 2021 at 9:06 | review | First posts | |||
| Jul 26, 2021 at 9:51 | |||||
| Jul 26, 2021 at 8:58 | history | asked | user6748658 | CC BY-SA 4.0 |