Timeline for Number of spanning trees in a grid
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 7, 2010 at 13:43 | comment | added | David E Speyer | The two constants are not the same, but Konrad's answer is for the square grid. See the updated version of Martin's answer. | |
| Jan 6, 2010 at 22:13 | comment | added | Michael Lugo | But the Glasser-Wu paper is working over the triangular lattice; this is for the square lattice. Is there some reason the constants for the two lattices should be equal? | |
| Jan 6, 2010 at 21:37 | comment | added | Konrad Swanepoel | So this shows that the asymptotics is in fact exponential in the number of vertices $n^2$. | |
| Jan 6, 2010 at 21:35 | comment | added | Konrad Swanepoel | According to the paper by Glasser and Wu cited in Martin's answer, the constant near 3.21 is in fact exactly $\exp(\frac{4}{\pi}(1-1/3^2+1/5^2-1/7^2+\dots))$. | |
| Jan 6, 2010 at 16:44 | history | answered | Michael Lugo | CC BY-SA 2.5 |