Skip to main content

All Questions

Filter by
Sorted by
Tagged with
10 votes
1 answer
638 views

Computing homology groups with GAP

I’m studying the homology groups of arithmetic groups such as $SL(5,\mathbb{Z})$. I saw in the answer to this post that we can use GAP to compute some of the homology groups for $SL(3,\mathbb{Z})$. Is ...
Noah B's user avatar
  • 545
0 votes
0 answers
274 views

Algorithm to compute automorphism group of a finite group

Is there an algorithm to compute automorphism group of a finite group? GAP has a function to do this, but while perusing their GitHub repo, I could not find an implementation. I'm struggling to find ...
Jerry Halisberry's user avatar
0 votes
1 answer
330 views

Computational Algebra and Symbolic Computation - Where? [closed]

Following the line of this question, I'm in my last year of M.Sc., and I'm looking for a place where I can start my PHD. Since that question has been asked 4 years ago, I thought it may be wise to ask ...
Exodd's user avatar
  • 201
6 votes
1 answer
517 views

Using math software to show that the following groups are infinite?

I would like to show that the following finitely presented group in 3 generators $P, Q, R$ is infinite in certain cases: $$P^p, Q^q, R^r, (PQ)^2, (QR)^2, (PQR)^2, (QR^{r/2+1})^a (RQR^{r/2})^b$$ For ...
Matthias's user avatar
  • 656
15 votes
4 answers
4k views

Program for computing group cohomology

Is there any computer program with which I can compute the group cohomology H^n(G,V) for a group G acting linearly on a vector space? I mainly care about infinite groups.
google's user avatar
  • 151
22 votes
4 answers
1k views

Is there a way of canonically labelling permutation groups?

When working with large numbers of graphs, a canonical labelling routine is essential as, after the initial cost of canonically labelling each graph, it permits isomorphism checks to be replaced with ...
Gordon Royle's user avatar
  • 12.7k