Timeline for Is there an algorithm to decide if a word is in a finitely generated subgroup of a free group?
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 30, 2018 at 16:06 | comment | added | Nico A | I saw this in the hot questions list and went, "Huh! We worked on something similar at Hampshire but didn't get far.". Lo and behold :D | |
| Dec 30, 2018 at 5:31 | comment | added | YCor | This is known as "solvable uniform (subgroup) membership problem". | |
| Dec 30, 2018 at 5:25 | history | edited | YCor | CC BY-SA 4.0 |
fixed Schreier spelling
|
| Dec 30, 2018 at 4:55 | vote | accept | Milo Brandt | ||
| Dec 30, 2018 at 4:32 | answer | added | Andy Putman | timeline score: 18 | |
| Dec 30, 2018 at 4:27 | comment | added | Dima Pasechnik | oops, right. sorry for noise. | |
| Dec 30, 2018 at 4:23 | comment | added | Andy Putman | @DimaPasechnik: What you write down is not a group since the subgroup you are trying to take the quotient by is not normal. | |
| Dec 30, 2018 at 4:21 | comment | added | Dima Pasechnik | If you can decide this then you can decide whether $F/\langle w_1,...,w_k\rangle$ is trivial, just check for each $w$ being an element of $S$, right? Thus it's undecideable... | |
| Dec 30, 2018 at 3:47 | history | edited | Milo Brandt | CC BY-SA 4.0 |
edited body
|
| Dec 30, 2018 at 3:39 | history | asked | Milo Brandt | CC BY-SA 4.0 |