Timeline for The density hex
Current License: CC BY-SA 2.5
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 17, 2009 at 18:03 | comment | added | Harrison Brown | @Alex: You're right, of course, but it's worth noting that since we can formulate any proposed "density version" without any recourse to color, requiring i = j would be silly. In any case, this seems to be the "correct" density version, and it's the one with loose connections to traditional Ramsey theory, which is why it's the one I was curious about. | |
| Dec 17, 2009 at 17:45 | comment | added | Alex Fink | In your density version, you're looking for a path of color i which connects the j-th pair of sides for a pair (i,j) with no restrictions? In Hex one requires i=j, and then there's no density result (one can fill in all cells but one of the board without creating a Hex path). | |
| Dec 15, 2009 at 11:47 | vote | accept | Harrison Brown | ||
| Dec 14, 2009 at 19:22 | answer | added | Gil Kalai | timeline score: 6 | |
| Dec 14, 2009 at 17:42 | history | edited | Ilya Nikokoshev | CC BY-SA 2.5 |
minor edit: wikipedia link + expand acronym
|
| Dec 13, 2009 at 21:13 | comment | added | Kristal Cantwell | I have found the Gale paper online: cs.cmu.edu/afs/cs/academic/class/15859-f01/www/notes/… | |
| Dec 13, 2009 at 17:41 | history | edited | Harrison Brown | CC BY-SA 2.5 |
added 392 characters in body
|
| Dec 13, 2009 at 17:01 | comment | added | Mariano Suárez-Álvarez | @Harrison: can you move the statement of what you had in mind to the statement of question? | |
| Dec 13, 2009 at 12:21 | comment | added | Konrad Swanepoel | David Gale, The game of hex and the Brouwer fixed-point theorem, American Mathematical Monthly, Dec 1979, 818-827. | |
| Dec 13, 2009 at 12:17 | comment | added | Gil Kalai | "Gale famously showed..." I did not know it. Any link/reference? | |
| Dec 13, 2009 at 11:32 | comment | added | Harrison Brown | @Ilya: What I had in mind was, for any $\delta > 0$, and to be safe we'll fix n, for sufficiently large dimension d any choice of $\delta n^d$ moves must connect two opposite sides of the cube. | |
| Dec 13, 2009 at 11:25 | comment | added | Ilya Nikokoshev | Actually, what is the density version of the determinacy of Hex? | |
| Dec 13, 2009 at 11:22 | history | asked | Harrison Brown | CC BY-SA 2.5 |