Timeline for Prove log of eigenvalues are dense in R?
Current License: CC BY-SA 3.0
13 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Sep 21, 2012 at 3:30 | vote | accept | Ivy | ||
Sep 21, 2012 at 3:29 | vote | accept | Ivy | ||
Sep 21, 2012 at 3:30 | |||||
S Sep 21, 2012 at 3:29 | vote | accept | Ivy | ||
Sep 21, 2012 at 3:29 | |||||
Sep 21, 2012 at 3:29 | vote | accept | Ivy | ||
S Sep 21, 2012 at 3:29 | |||||
Sep 21, 2012 at 3:28 | vote | accept | Ivy | ||
Sep 21, 2012 at 3:29 | |||||
Sep 20, 2012 at 15:15 | answer | added | Nikita Sidorov | timeline score: 1 | |
Sep 20, 2012 at 8:54 | comment | added | Felix Goldberg | See also this question: mathoverflow.net/questions/23989/… | |
Sep 20, 2012 at 7:50 | comment | added | Ivy | Yes, it only has to have entries of $0$ or $1$. | |
Sep 20, 2012 at 6:02 | answer | added | Douglas Lind | timeline score: 10 | |
Sep 20, 2012 at 5:52 | comment | added | Qiaochu Yuan | What is an adjacency matrix to you? Does it have to have only entries of $0$ or $1$? Does it have to have zeroes along the diagonal? Does it have to be symmetric? | |
Sep 20, 2012 at 5:52 | history | edited | Qiaochu Yuan |
edited tags
|
|
Sep 20, 2012 at 5:33 | comment | added | 36min | adjacency matrices means entries are either 0 or 1? | |
Sep 20, 2012 at 5:30 | history | asked | Ivy | CC BY-SA 3.0 |