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 16:16 | answer | added | Blue | timeline score: 3 | |
| Aug 5, 2010 at 4:53 | comment | added | Qiaochu Yuan | @Per: unfortunately I don't know a reference which discusses these things in detail. It's just something I like to think about from time to time. | |
| Aug 5, 2010 at 4:29 | comment | added | Per Vognsen | Qiaochu: If you know of any other useful ways of thinking about linear algebra combinatorially, I'd appreciate references! | |
| Aug 5, 2010 at 3:58 | answer | added | Gjergji Zaimi | timeline score: 7 | |
| May 7, 2010 at 11:41 | comment | added | Qiaochu Yuan | Yes. That will lead to the second bullet point, which I think is detectable combinatorially. | |
| May 7, 2010 at 3:53 | comment | added | S. Carnahan♦ | If A is not symmetric, it might not be diagonalizable. Is that a situation you want to consider? | |
| May 7, 2010 at 3:09 | history | asked | Qiaochu Yuan | CC BY-SA 2.5 |