Timeline for How can I prove that a sequence of squares of graph norms is never cyclotomic?
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 30, 2009 at 4:08 | vote | accept | Kim Morrison | ||
| Oct 22, 2009 at 16:33 | comment | added | Kim Morrison | Indeed, this is where the paper of Asaeda-Yasuda begins: they show that the characteristic polynomials (divided by (x-2)^2) satisfy q_k(x) = (x^2 − 4x + 2)q_{k−1}(x) − q_{k−2}(x) It's then another 19 pages of hard 19th century number theory to the result! | |
| Oct 22, 2009 at 15:26 | comment | added | Qiaochu Yuan | There should always be such a recurrence which you can compute by expansion by minors; I expect that you should then be able to write down the generating function for the characteristic polynomials and then see what happens from there. | |
| Oct 22, 2009 at 15:24 | history | answered | David E Speyer | CC BY-SA 2.5 |