Timeline for Complex Eigenvalues of Directed Graphs
Current License: CC BY-SA 3.0
6 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Sep 8, 2011 at 4:28 | comment | added | Brendan McKay | Yes you are right. I had in mind $k+i$, which is an eigenvalue of a digraph for any positive integer $k$. | |
Sep 8, 2011 at 4:05 | comment | added | Douglas Zare | That conclusion doesn't follow directly from the failure of closure of the reals times roots of unity since not all such numbers are eigenvalues of digraphs, but that is a good method for constructing counterexamples. | |
Sep 7, 2011 at 14:49 | comment | added | Brendan McKay | @igor: Actually it is so early in the morning (12:50am) that I don't understand your comment. | |
Sep 7, 2011 at 14:48 | history | edited | Brendan McKay | CC BY-SA 3.0 |
first part is wrong
|
Sep 7, 2011 at 14:39 | comment | added | Igor Rivin | True, but I would think you would have to wake up pretty early in the morning to have things so reducible... | |
Sep 7, 2011 at 14:28 | history | answered | Brendan McKay | CC BY-SA 3.0 |