Timeline for Closed paths, traces and spectra
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 22, 2020 at 18:12 | answer | added | Michael Magee | timeline score: 4 | |
| Jun 22, 2020 at 13:31 | comment | added | Abdelmalek Abdesselam | Did you try the decomposition into Lyndon words used for understanding the graph zeta function. See for example the article "A Combinatorial Proof of Bass's Evaluations of the Ihara-Selberg Zeta Function for Graphs" by Foata and Zeilberger ams.org/journals/tran/1999-351-06/S0002-9947-99-02234-5 | |
| Jun 22, 2020 at 11:44 | comment | added | H A Helfgott | I'm not sure of quite what you have in mind. | |
| Jun 22, 2020 at 8:13 | comment | added | Hailong Dao | But then 6 can be broken in a finite number of ways $6=4+1+1=3+3=2+2+2=...$ and each decomposition can be bounded by $N^a$ where $N$ is the number of paths at most $6$ and $a$ is the number of summands, can't we get at least some function of $N$ as upper bound? | |
| Jun 22, 2020 at 8:01 | comment | added | H A Helfgott | That would be the naïve expectation, but I don't see how that happens. | |
| Jun 22, 2020 at 7:54 | comment | added | Hailong Dao | Since a closed walk can be broken down to a number of closed paths (for instance a closed walk of length 6 can be 2 closed paths of length 3), don't you get an upper bound for number of walks from the number of paths? | |
| Jun 22, 2020 at 7:32 | history | edited | H A Helfgott | CC BY-SA 4.0 |
added 107 characters in body
|
| Jun 22, 2020 at 7:25 | history | asked | H A Helfgott | CC BY-SA 4.0 |