Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with gr.group-theory
Search options not deleted
user 125391
Questions about the branch of algebra that deals with groups.
8
votes
Accepted
Decidability of word problem for group admitting certain action
Yes. There is such a reason.
I will write a subset of $G$ is RE if the set of those words over the generators for $G$ which represent elements of the subset is recursively enumerable.
As IJL argued, s …
- 191
8
votes
Accepted
Is Thompson's group definably orderable?
Yes, Thompson's group $F$ is definably bi-orderable.
Let $a$ be some element of $F$ with the support of $a$ equal to $(0,1/2)$. Let $b$ be some element of $F$ with the support of $b$ equal to $(1/2,1) …
- 191