Dear GAP-Forum,

from Rob Wilson's ATLAS of Finite Group Representations (to be found
at http://www.mat.bham.ac.uk/atlas/) I downloaded the faithful permu-
tation representation of Janko's group J_3 on 26163 points.
Then I converted the two generators "a" and "b" into a format readable
by GAP4 and asked the system to

Display( CharacterTable( Group( [a,b] ) ) ); 

Unfortunately, GAP4 aborted this computation because of exceeding its
workspace limit.
The machine I'm working on has a total of 512 MB workspace memory and,
in fact, I started my session by

gap -o  512M <file containing a and b>  .  

Now I'm wondering if the task I want GAP4 to do for me is feasible at
all --- and if so, how much memory do I have to invest?

Just to avoid misunderstandings: I know that I could load the charac-
ter table of J_3 from GAP4's library. But what I'm really interested
in is the capability of the DIXON-SCHNEIDER-algorithm and its imple-
mentation in GAP4, respectively.

Thanks in advance,

Mathias

----------------------------------------------------------------------
Dipl.-Math. Mathias Kratzer           | I_nstitute for 
E-Mail: kratzer@exp-math.uni-essen.de | E_xperimental  
Phone : +49-201-183-7680              | M_athematics     Ellernstr. 29     
Visit : IEM, Room 205                 |                  D-45326 ESSEN