Timeline for counting edges in tesselations of a torus
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 31, 2011 at 19:08 | comment | added | Noam D. Elkies | @Michael: Good question. Maybe it's just that the triangles are simply connected? I'm not sure if there's even a good notion of a dual graph if the faces are not all contractible. | |
| Dec 31, 2011 at 17:45 | comment | added | Michael Hardy | @Noam : I had a hypothesis that the polygons are simply connected. I think that can't be dropped. What would replace that in the proposed dual statement? | |
| Dec 31, 2011 at 6:43 | comment | added | agt | Hoping to be useful I would include the link to the related discussion on MathStackExchange: math.stackexchange.com/questions/95011/… | |
| Dec 31, 2011 at 5:47 | answer | added | Will Jagy | timeline score: 2 | |
| Dec 31, 2011 at 5:40 | comment | added | Mariano Suárez-Álvarez | What exactly do you want to find? the massaging is sufficiently simple to not require any reference, isn't it? | |
| Dec 31, 2011 at 5:28 | comment | added | Noam D. Elkies | Perhaps you can find the dual statement that in a tiling of the torus by triangles the average of the degree over all vertices is $6$. | |
| Dec 31, 2011 at 4:23 | history | asked | Michael Hardy | CC BY-SA 3.0 |