Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site harvard.ARPA
Path: utzoo!watmath!clyde!burl!ulysses!allegra!bellcore!decvax!genrad!panda!talcott!harvard!sullivan
From: sullivan@harvard.ARPA (John M. Sullivan)
Newsgroups: net.math
Subject: Re: Non-Abelian Finite Groups
Message-ID: <8@harvard.ARPA>
Date: Thu, 4-Apr-85 17:47:38 EST
Article-I.D.: harvard.8
Posted: Thu Apr  4 17:47:38 1985
Date-Received: Sun, 7-Apr-85 03:13:07 EST
References: <259@faron.UUCP>
Distribution: net
Organization: Harvard University
Lines: 10

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