Timeline for Combinatorial proof of (a special case of) the spectral theorem?
Current License: CC BY-SA 2.5
8 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Apr 29, 2014 at 2:33 | vote | accept | Qiaochu Yuan | ||
Aug 5, 2010 at 23:14 | history | edited | Gjergji Zaimi | CC BY-SA 2.5 |
added 20 characters in body
|
Aug 5, 2010 at 19:04 | comment | added | Victor Protsak | Very nice! $ $ | |
Aug 5, 2010 at 17:51 | comment | added | Gjergji Zaimi | I edited the post to include the argument of why all roots must be real. Another consequence of these Christoffel-Darboux identities is that the eigenvalues of a graph and the eigenvalues of the graph with one vertex removed have the interlacing property. | |
Aug 5, 2010 at 17:42 | history | edited | Gjergji Zaimi | CC BY-SA 2.5 |
added 498 characters in body
|
Aug 5, 2010 at 16:35 | comment | added | Victor Protsak | I must say I am very surprised and impressed by the positive answer to the question. Can you, please, indicate how does the identity given "immediately imply" that the roots are all real? | |
Aug 5, 2010 at 4:44 | comment | added | Gjergji Zaimi | As it is explained in the paper, one can argue similarly for weighted graphs. | |
Aug 5, 2010 at 3:58 | history | answered | Gjergji Zaimi | CC BY-SA 2.5 |