I'm currently trying to use GAP's function IrreducibleRepresentations() to compute the complex irreducible representations of some group $G$. We're using this function to determine whether each representation has a fixed point by taking the determinant of the representation minus the identity.
The problem is, for the groups that we're interested in (specifically the central extensions of $A_7$ and higher alternating groups) the program takes too long. Are there optimizations that we can make to have it run faster? We've already tried letting it run overnight.
Thanks!