home *** CD-ROM | disk | FTP | other *** search
- Organization: Mathematics, Carnegie Mellon, Pittsburgh, PA
- Path: sparky!uunet!elroy.jpl.nasa.gov!usc!zaphod.mps.ohio-state.edu!cis.ohio-state.edu!news.sei.cmu.edu!fs7.ece.cmu.edu!crabapple.srv.cs.cmu.edu!andrew.cmu.edu!ma1q+
- Newsgroups: sci.math.symbolic
- Message-ID: <QedFL_O00WBN85g19x@andrew.cmu.edu>
- Date: Wed, 2 Sep 1992 15:28:10 -0400
- From: Michael Albert <ma1q+@andrew.cmu.edu>
- Subject: Todd-Coxeter algorithm
- In-Reply-To: <1992Sep2.164815.28188@cerberus.ulaval.ca>
- Lines: 16
-
- I was wondering if there is a public domain implementation of the Todd-
- Coxeter coset enumeration algorithm anywhere?
-
- I know the "correct" answer to this is "get Cayley", but the $$$ are not
- currently available.
-
- The "group" package in Maple dies when there are more than 1000 or so
- cosets on my machine (a NeXTStation).
-
- I can imagine doing some C coding myself but I thought I'd try the
- lazy way out first! (By the way I tried an "archie" request, but it
- doesn't seem to have been very successful).
-
- Thanks in advance
-
- Michael Albert
-