Timeline for Maximal disarrangement of $n \times n$ numbers
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 11, 2017 at 10:28 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
Image link broken; now fixed.
|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Feb 14, 2012 at 11:42 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
added 264 characters in body; added 13 characters in body; edited body
|
| Feb 14, 2012 at 11:08 | vote | accept | Joseph O'Rourke | ||
| Feb 14, 2012 at 3:48 | comment | added | Gjergji Zaimi | I added the graph-theory tag, since this is a well-known problem in that area. | |
| Feb 14, 2012 at 3:46 | history | edited | Gjergji Zaimi |
edited tags
|
|
| Feb 14, 2012 at 3:46 | answer | added | Gjergji Zaimi | timeline score: 15 | |
| Feb 14, 2012 at 2:39 | comment | added | Gerhard Paseman | I have a sense that the d-dimensional version will have (n/2)^d as the limit for the minimum. Perhaps fedja or Gjergji can favor us with a proof or refutation? Gerhard "Ask Me About System Design" Paseman, 2012.02.13 | |
| Feb 14, 2012 at 2:34 | comment | added | Gerhard Paseman | For large even n, one should get close to N=n^2/4 by using 2x2 tiles having j, j+N, j+2N, j+3N, for ascending values of j. I think a pigeonhole argument will show N is optimal, but I do not have a proof yet. Gerhard "Ask Me About System Design" Paseman, 2012.02.13 | |
| Feb 14, 2012 at 2:06 | history | asked | Joseph O'Rourke | CC BY-SA 3.0 |