Timeline for Are Gray codes in $\{0,1\}^n$ isomorphic?
Current License: CC BY-SA 4.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 19, 2018 at 5:23 | vote | accept | Dominic van der Zypen | ||
| Oct 19, 2018 at 2:00 | history | edited | Keith Kearnes | CC BY-SA 4.0 |
deleted 4 characters in body
|
| Oct 19, 2018 at 1:11 | history | edited | Keith Kearnes | CC BY-SA 4.0 |
added 808 characters in body
|
| Oct 18, 2018 at 22:50 | comment | added | verret | @GerryMyerson Based on the (limited) data here ftp.inf.ethz.ch/doc/tech-reports/6xx/601.pdf, it does seem like the number of Hamiltonian cycles grows (much) more quickly than the size of the automorphism group (which is n!*2^n). | |
| Oct 18, 2018 at 22:36 | comment | added | Gerry Myerson | I wonder whether an existence proof can be created by showing that there are fewer automorphisms than there are cyclic Gray codes. | |
| Oct 18, 2018 at 22:10 | history | edited | Keith Kearnes | CC BY-SA 4.0 |
added 415 characters in body
|
| Oct 18, 2018 at 20:33 | comment | added | Gerhard Paseman | It's interesting that you say the cut sequence (4,4,2,6) is unordered. I would say it is ordered by key, and not by value. Gerhard "Has Been Reviewing Python Dictionaries" Paseman, 2018.10.18. | |
| Oct 18, 2018 at 18:31 | history | edited | Keith Kearnes | CC BY-SA 4.0 |
deleted 1 character in body
|
| Oct 18, 2018 at 17:01 | history | edited | Keith Kearnes | CC BY-SA 4.0 |
added 1339 characters in body
|
| Oct 18, 2018 at 15:16 | history | edited | Keith Kearnes | CC BY-SA 4.0 |
added 369 characters in body
|
| Oct 18, 2018 at 14:55 | history | edited | Keith Kearnes | CC BY-SA 4.0 |
added 9 characters in body
|
| Oct 18, 2018 at 14:46 | history | edited | Keith Kearnes | CC BY-SA 4.0 |
added 839 characters in body
|
| Oct 18, 2018 at 14:41 | history | edited | Keith Kearnes | CC BY-SA 4.0 |
added 839 characters in body
|
| Oct 18, 2018 at 14:32 | history | answered | Keith Kearnes | CC BY-SA 4.0 |