Hi Alexander,
yes -- thanks! (As several people from the GAP forum pointed out to
me in private email, ChiefSeries(g); will do.)
ken
c. GAP forum
---
On May 17, 2006, at 10:48 AM, Alexander Hulpke wrote:
Dear Ken,
On May 17, 2006, at 5:04 AM, Ken W Smith wrote:
Hi,
Is there a GAP command (or series of commands) which, given a finite
group G, would return a chain 1=G0 < G1 < G2 < ... < Gn=G of
normal subgroups of G, where the length, n, of the chain, is as large
as possible? (I've written a rather naive procedure to do that,
using NormalSubgroups(G), but it gets computationally intensive if
the group has hundreds of normal subgroups.... and I suspect there is
a much better procedure out there...)
Shouldn't any chief series be good by Jordan-Hoelder?
Alexander
Thanks in advance for any help you can provide.
ken
---
Ken W. Smith, Professor of Mathematics, Central Michigan University
989-854-0185 (Cell)
http://www.cst.cmich.edu/users/smith1kw
Address until June 4, 2006:
22 Chase Gayton Terrace, Apt 1518
Richmond, VA 23238-6526
Address after June 4, 2006:
616 S. Pine St.
Mt. Pleasant, MI 48858
_______________________________________________
Forum mailing list
Forum@mail.gap-system.org
http://mail.gap-system.org/mailman/listinfo/forum
---
Ken W. Smith, Professor of Mathematics, Central Michigan University
989-854-0185 (Cell)
http://www.cst.cmich.edu/users/smith1kw
Address until June 4, 2006:
22 Chase Gayton Terrace, Apt 1518
Richmond, VA 23238-6526
Address after June 4, 2006:
616 S. Pine St.
Mt. Pleasant, MI 48858
_______________________________________________
Forum mailing list
Forum@mail.gap-system.org
http://mail.gap-system.org/mailman/listinfo/forum
