Timeline for Matrix groups with two generators
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 27, 2021 at 11:22 | comment | added | Alexandre Eremenko | Here is a survey on this question: MR0974424 Gehring, F. W.; Martin, G. J. Iteration theory and inequalities for Kleinian groups. Bull. Amer. Math. Soc. (N.S.) 21 (1989), no. 1, 57–63. | |
| Aug 16, 2020 at 0:50 | comment | added | Moishe Kohan | @darkl: These are "elementary" subgroups and usually are excluded from the discussion of discreteness algorithms. In many ways, they are quite different from the nonelementary subgroups for which algorithms work. | |
| Aug 13, 2020 at 23:55 | comment | added | darkl | Consider for instance the group generated by two upper triangular matrices with 1 one the diagonal, where the top right entry in the first matrix is 1 and in the second matrix is $\sqrt{2}$. The topological closure is isomorphic to $\mathbb{R}$. You can do the same trick be taking diagonal matrices with $e^1, e^{-1}$ and $e^{\sqrt{2}}, e^{-\sqrt{2}}$ and similarly with rotation matrices (the topological closure will be the circle). | |
| Aug 13, 2020 at 23:51 | comment | added | Moishe Kohan | Does this answer your question: mathoverflow.net/questions/109967/… ? | |
| Aug 13, 2020 at 23:02 | history | asked | KhashF | CC BY-SA 4.0 |