2
votes
1answer
225 views

Complexity of establishing finite groups (non)-isomorphism ?

Question Given two finite groups G and H of the same order N what are the algorithms and what is their complexity (in terms of N) to check is G isomorphic to H or not ? Is there polynomial in N ...
7
votes
2answers
715 views

How to compute all irreducible representations of a finite group ? (how GAP is doing this?)

Let us "take" a finite group G. Here "take" I mean any type of group-theoretic description you prefer: e.g. as an explicit subset of GL (or other group) or Cayley table, whatever. Question: How ...
7
votes
4answers
708 views

Is the classification of finite p-groups a smooth problem?

Fix a prime $p$. Then the question is about the difficulty of classifying finite $p$-groups. Originally I was going to ask if this was a "wild" problem but thanks to Joel David Hamkins' answer to ...
10
votes
1answer
449 views

complexity of counting homomorphisms

This is a question I have thought about and asked a number of people, but have never got an answer beyond "It should be true that..." Given a finitely generated group $G$ (eg. a link group ...