Timeline for Factorization of the characteristic polynomial of the adjacency matrix of a graph
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 6, 2020 at 23:01 | vote | accept | Joe Silverman | ||
| Sep 6, 2020 at 22:54 | comment | added | Joe Silverman | Thanks. This is all very helpful, especially the use of the symmetry group of the graph, and the representation that you describe, to deduce factorization. For my graphs, I expect that the symmetry group is fairly large, but not necessarily easy to compute, so I may be able to play the factorization off against potential pieces of the symmetry group. In any case, you've provided me much food for thought. | |
| Sep 6, 2020 at 20:21 | comment | added | Mirco A. Mannucci | Marvelous. Particularly your blog post: I wonder if there is some literature on taking your "toy model" seriously. By this I mean: can one approximate at any level of accuracy any quantum system as a graph quantum model when the finite graph grows? I bet it can. On a related note: Feynman ' s approach via paths actually becomes quantum random walks on your graph, and no infinities involved... | |
| Sep 6, 2020 at 17:33 | history | edited | Qiaochu Yuan | CC BY-SA 4.0 |
edited body
|
| Sep 6, 2020 at 8:26 | history | answered | Qiaochu Yuan | CC BY-SA 4.0 |