Timeline for Group generated by "adjacent" permutations of graph
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 15 at 20:26 | comment | added | aleph2 | True! Thank you. | |
| Oct 15 at 20:26 | vote | accept | aleph2 | ||
| Oct 15 at 17:24 | comment | added | YCor | @aleph2 1) yes, I only assumed that $u$, $v$ act adjacently (I abused language saying that $G$ acts adjacently, meaning that elements in the generating subset are indeed adjacent — the second paragraph of the post is quite clear on this). 2) No, $s$ definitely has order 8. Indeed it is a 8-cycle on $Y$, and acts by $u$ (which has order 4) outside $Y$. | |
| Oct 15 at 16:28 | comment | added | aleph2 | Unimportantly, the order of $s$ is only at least $8$. | |
| Oct 15 at 16:27 | comment | added | aleph2 | I don't think you can assume in the first place that $Q$ acts adjacently on $X$ if by "adjacent" you mean that $(v,gv)\in E$ for all $v\in V$ and $g\in Q$. You can only assume that $u$ and $v$ "act" in such a way on $X$. | |
| Oct 15 at 12:26 | history | answered | YCor | CC BY-SA 4.0 |