|Bill Allombert on Wed, 2 Apr 2003 19:45:48 +0200|
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
|Re: group identification patch|
On Wed, Apr 02, 2003 at 03:05:49PM +0200, Bill Allombert wrote: > Hello PARI-dev, > > Here a (large) patch that add a feature similar to GAP IdGroup > function for weakly super-solvable group. > > Conjugacy class and Abelianized were considered but did not lead > to improvement. The algorithm is a bit different from GAP and need > twice less data and code size. ... for group of order <= 95. Orders 96 and >=112 are not implemented. GAP handle all groups of order <=2000 but 1024 (but need still more data). Order 96 can be implemented as roughly the same cost as order 64. Unfortunately the behavior of galoisinit on degree 96 polynomials is not very good so it might not be very useful. Cheers, Bill.