Timeline for n-cube connectivity problem
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 27, 2014 at 10:26 | vote | accept | Xorwell | ||
| Nov 27, 2014 at 10:05 | answer | added | Ilya Bogdanov | timeline score: 3 | |
| Nov 27, 2014 at 10:02 | history | edited | Xorwell | CC BY-SA 3.0 |
added 5 characters in body
|
| Nov 27, 2014 at 9:55 | comment | added | Xorwell | the orientation is by set inclusion: (x,y)\in E iff x\subset y and hamming_dist(x,y)=1. And yes $0^n,1^n$ are not in $S$. Thank you. | |
| Nov 27, 2014 at 9:54 | history | edited | Xorwell | CC BY-SA 3.0 |
deleted 1 character in body
|
| Nov 27, 2014 at 9:49 | comment | added | Joonas Ilmavirta | What is the orientation of the edges, even for $H_3$? The $n-1$ dimensional faces of $H_n$ inherit an orientation from $H_n$, but already the $n-2$ dimensional edges inherit opposite orientations from the two adjacent $n-1$ dimensional faces. Also, do you want to assume $0^n,1^n\notin S$? | |
| Nov 27, 2014 at 9:47 | history | edited | Xorwell | CC BY-SA 3.0 |
deleted 1 character in body
|
| Nov 27, 2014 at 9:33 | history | asked | Xorwell | CC BY-SA 3.0 |