Timeline for For which groups is (non-)left orderability decidable?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 24, 2017 at 8:29 | comment | added | HJRW | @YCor, well, the question actually only asks for a one-sided algorithm that answers "NO" if the given fp group is not left-orderable. But my answer describes a YES/NO algorithm, as in your comment, that works in the class of finitely presented subgroups of one-relator groups. | |
| May 23, 2017 at 22:29 | comment | added | YCor | I'd be delighted to know what you're answering. I only have a rough guess based on your comments and Benjamin's. My most plausible guess is the following: the question is whether there is an algorithm where the input is a group presentation and a possible algorithm for the word problem; the algorithm runs and when the algorithm of the input indeed solves the word problem for this presentation in the input, it stops in finite time with answer YES/NO giving a correct answer to the question "does the given group presentation define a left-orderable group?". | |
| May 23, 2017 at 19:46 | history | answered | HJRW | CC BY-SA 3.0 |