bs@faron.UUCP (Robert D. Silverman) (03/24/85)
Given: The multiplication table for a non-Abelian finite group. Assume that the order of the group is N, a non-prime. Does anyone know of an algorithm that will systematically pull out ALL of the possible sub-groups and yield their multiplication tables? If so what is the complexity of such an algorithm? *** REPLACE THIS LINE WITH YOUR MESSAGE ***
sullivan@harvard.ARPA (John M. Sullivan) (04/05/85)
I would be interested in hearing of algorithms known for dealing with finite groups *without* listing out the multiplication tables. For example I'd like to input the description of the symmetry group of a cube as a wreath product, or whatever it is, and ask the computer to draw an inclusion diagram for the subgroups, just giving me names like S_3 or c_2 x c_2. -- John M. Sullivan sullivan@harvard