Page not found
This question was removed from MathOverflow for reasons of moderation. Please refer to the help center for possible explanations why a question might be removed.
Here are some similar questions that might be relevant:
- Is it decidable whether a given set generates the whole group?
- Looking for a musical group
- Which Turing machines accept the language of trivial words in a finitely presented group?
- The complexity of the word problem in linear groups
- Can a group be a universal Turing machine?
- How to compute all irreducible representations of a finite group ? (how GAP is doing this?)
- The equality problem between conjugate group elements
- Computing a transversal of a subgroup $H$ of $G$ in expected $O(|G : H|^2 \log |G : H| + |H|)$ time
- Groups whose word problem can be solved in constant time
- Possible symmetry groups of power terms
Try a Google Search
Try searching for similar questions
Browse our recent questions
Browse our popular tags
If you feel something is missing that should be here, contact us.