Timeline for How many unit squares can you pack into a rectangle with nearly integer side lengths?
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Oct 9, 2017 at 3:38 | history | suggested | jeq | CC BY-SA 3.0 |
Copied image to imgur.com, as it was not being displayed because of the new https rule. Added link to original image source.
|
| Oct 9, 2017 at 3:16 | review | Suggested edits | |||
| S Oct 9, 2017 at 3:38 | |||||
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| May 17, 2014 at 15:08 | answer | added | Erich Friedman | timeline score: 4 | |
| Jul 21, 2013 at 4:38 | answer | added | Wlodek Kuperberg | timeline score: 8 | |
| Mar 27, 2010 at 21:18 | vote | accept | Anton Geraschenko | ||
| Mar 27, 2010 at 18:45 | comment | added | Anton Geraschenko | @unknown: Yes, that's what I meant, but it doesn't actually matter. If you come up with a packing where there are intersections on the boundary, then after possibly decreasing your ε, you can modify the packing so that there are no intersections at all. | |
| Mar 27, 2010 at 15:01 | history | edited | Anton Petrunin |
edited tags
|
|
| Mar 27, 2010 at 6:54 | answer | added | Gerry Myerson | timeline score: 7 | |
| Mar 27, 2010 at 6:37 | comment | added | Qfwfq | Just to be pedantic: of course, by "non overlapping" you mean that two (hyper)cubes can intersect at most in a subset of their boundary, right? | |
| Mar 27, 2010 at 5:34 | history | asked | Anton Geraschenko | CC BY-SA 2.5 |