Timeline for Which integer recurrence relations can be formulated as counting walks on a graph?
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 30, 2022 at 21:02 | history | edited | Glorfindel | CC BY-SA 4.0 |
broken link fixed, cf. https://meta.mathoverflow.net/q/5301/70594
|
| Jun 15, 2020 at 7:27 | history | edited | CommunityBot |
Commonmark migration
|
|
| Oct 30, 2010 at 8:02 | comment | added | sleepless in beantown | @Mike-Spivey, the undirected graph can be transformed into a directed graph, retaining the "undirectedness" of the original graph by: $$ $$ replacing each undirected edge between two vertices with a pair of directed edges between the same two vertices. A directed graph version of this allows for a direct correspondence to the class of regular languages accepted by a Nondeterministic Finite Automaton. (see my comment below Qiaochu Yuan's answer on this page) | |
| Oct 30, 2010 at 4:23 | answer | added | Aaron Meyerowitz | timeline score: 1 | |
| Oct 29, 2010 at 21:40 | comment | added | Douglas S. Stones | At this point, I don't care about the specifics, just as long as it's possible to count walks. | |
| Oct 29, 2010 at 17:26 | comment | added | Mike Spivey | Must the graphs be undirected? (Your example has undirected edges, but you don't state that in your question itself.) | |
| Oct 29, 2010 at 8:12 | answer | added | Qiaochu Yuan | timeline score: 2 | |
| Oct 29, 2010 at 8:04 | comment | added | Qiaochu Yuan | Duplicate? mathoverflow.net/questions/3939/… | |
| Oct 29, 2010 at 6:04 | history | asked | Douglas S. Stones | CC BY-SA 2.5 |