Timeline for Compute reduced word for element in particular free group
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 2, 2022 at 1:00 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Apr 2, 2022 at 0:01 | answer | added | markvs | timeline score: 1 | |
| Mar 30, 2022 at 8:29 | comment | added | HJRW | This is one of those "well known" things that many people know how to do but that I don't know a good reference for. My suggestion would be to break this question into two parts. Think of $PSL_2(\mathbb{Z})$ (slightly easier to work with) as $\langle C\rangle*\langle D\rangle$ where $C$ is of order 2 and $D$ is of order 3. Now algorithmically write $g$ as a product of $C$'s and $D$'s. (This is basically just row reduction.) Next write $A$ and $B$ as products of $C$'s and $D$'s, and it will then be easy to write $g$ as a product of $A$'s and $B$'s. | |
| Mar 26, 2022 at 13:24 | comment | added | Benjamin Steinberg | This paper arxiv.org/abs/2110.02188 does some of what you want for groups similar to the one in Wiki but the parameters they consider don't include that group. | |
| Mar 26, 2022 at 6:16 | history | asked | Dmitry Vilensky | CC BY-SA 4.0 |