Timeline for Walk in the graph induced by a group action
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 14, 2018 at 14:38 | comment | added | Ben Barber | These graphs are called Cayley graphs. I don't know of any situations in which thinking about Cayley graphs helps to achieve efficient computation in the group. | |
| Oct 14, 2018 at 12:25 | review | Close votes | |||
| Oct 23, 2018 at 11:12 | |||||
| Oct 14, 2018 at 9:27 | comment | added | Taylor Huang | The problem I'd like to solve algorithmically is to take input $e_1,...,e_r$ and outputs $\alpha_1^{e_1}...\alpha_r^{e_r}x.$ | |
| Oct 14, 2018 at 8:32 | comment | added | Andrej Bauer | What is the precise question you are asking? What problem would you like to solve algorithmically? | |
| Oct 14, 2018 at 5:00 | history | edited | Taylor Huang | CC BY-SA 4.0 |
Add definition of graph "induced by" a group action.
|
| Oct 14, 2018 at 4:52 | comment | added | Taylor Huang | It is the graph with vertex set $X$ and $x_1,x_2$ connected when $\alpha_i x_1=x_2,$ for some $\alpha_i$ | |
| Oct 14, 2018 at 1:00 | comment | added | YCor | What do you mean for a graph to be "induced" by a group? | |
| Oct 13, 2018 at 17:10 | review | First posts | |||
| Oct 13, 2018 at 19:31 | |||||
| Oct 13, 2018 at 17:06 | history | asked | Taylor Huang | CC BY-SA 4.0 |