Timeline for Largest permutation groups without "non-mixing" subgroups
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 4, 2014 at 23:48 | comment | added | Stefan Kohl♦ | @SébastienPalcoux: Let $G$ be the group mentioned under "Ad 2" in mathoverflow.net/questions/112527, and let $H$ be the permutation group induced by $G$ on $\mathbb{N}$. If $H$ is a subgroup of one of the groups this question asks for, then the Collatz graph has only finitely many connected components. -- That said, the question is much more general, and a sufficiently explicit answer could be of interest well beyond the Collatz conjecture. | |
| Mar 4, 2014 at 22:34 | comment | added | Sebastien Palcoux | What's the relation with the Collatz conjecture ? | |
| Jan 25, 2014 at 11:10 | history | edited | Stefan Kohl♦ | CC BY-SA 3.0 |
Tried to make the question easier to parse, following HJRW's comment.
|
| Jan 25, 2014 at 10:15 | history | asked | Stefan Kohl♦ | CC BY-SA 3.0 |