Timeline for Number of config. of a binary string invariant under cyclic permutation.
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 1, 2010 at 9:33 | comment | added | jonalm | Thank you for the input. @Streve: do you know of a reference for the solution of the 1D Ising model related to Necklace combinatorics. | |
| May 30, 2010 at 19:37 | vote | accept | jonalm | ||
| May 30, 2010 at 13:09 | comment | added | Steve Huntsman | And for 2D: mathoverflow.net/questions/10752 | |
| May 30, 2010 at 13:06 | comment | added | Steve Huntsman | As your question implies, you can solve the 1D spin-1/2 Ising model this way, and more generally short-ranged spin models. In two dimensions the problem is that there's not a suitable generalization of the matrix-tree theorem. See also mathoverflow.net/questions/12214/… | |
| May 30, 2010 at 12:59 | answer | added | Charles Matthews | timeline score: 1 | |
| May 30, 2010 at 12:58 | comment | added | Gjergji Zaimi | You are counting bracelets. en.wikipedia.org/wiki/Necklace_(combinatorics) | |
| May 30, 2010 at 12:43 | history | asked | jonalm | CC BY-SA 2.5 |