Timeline for For which kinds of group $G$, can we identify a square element efficiently?
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 4, 2019 at 1:33 | vote | accept | Licheng Wang | ||
| Apr 4, 2019 at 1:33 | |||||
| Apr 4, 2019 at 1:24 | vote | accept | Licheng Wang | ||
| Apr 4, 2019 at 1:33 | |||||
| Apr 4, 2019 at 1:18 | vote | accept | Licheng Wang | ||
| Apr 4, 2019 at 1:18 | |||||
| Aug 12, 2018 at 14:53 | comment | added | user6976 | @StevenStadnicki: I wrote a comment there. | |
| Aug 12, 2018 at 5:30 | comment | added | Steven Stadnicki | I got curious enough to ask this as a separate question: mathoverflow.net/questions/308077/… | |
| Aug 12, 2018 at 4:40 | comment | added | Steven Stadnicki | This does still leave one interesting piece of the puzzle, though: if $G$ is infinite and finitely presented but has decidable word problem, must the square problem be decidable? It's clearly semidecidable (just enumerate all words and check) but even in the decidable case it's not clear that there has to be any recursive bound on the potential size of a 'square root'... | |
| Aug 12, 2018 at 2:24 | history | edited | user6976 | CC BY-SA 4.0 |
added 1 character in body
|
| Aug 11, 2018 at 21:53 | history | edited | user6976 | CC BY-SA 4.0 |
added an explanation
|
| May 13, 2018 at 1:08 | comment | added | YCor | A distinct similar fact is that there is no algorithm whose input is a finite presentation and output tells whether the first generator is a square (easy consequence of the undecidability of the triviality problem). | |
| May 12, 2018 at 20:44 | history | answered | user6976 | CC BY-SA 4.0 |