# Gap code for working with abstract group 2592.cm. # Some of these functions may take a long time to execute (this depends on the group). # Construction of abstract group: G := Group( (1,7)(3,9)(5,11), (4,8,12), (2,10)(4,8), (1,4,7,10)(2,5,8,11)(3,6,9,12) ); # Order of the group: Order(G); # Exponent of the group: Exponent(G); # Automorphism group: AutomorphismGroup(G); # The outer automorphism group of G: FactorGroup(AutomorphismGroup(G), InnerAutomorphismGroup(G)); # Composition factors of the group: CompositionSeries(G); # Nilpotency class of the group: if IsNilpotentGroup(G) then NilpotencyClassOfGroup(G); fi; # Derived length of the group: DerivedLength(G); # Determine if the group G is abelian: IsAbelian(G); # Determine if the group G is cyclic: IsCyclic(G); # Determine if the group G is elementary abelian: IsElementaryAbelian(G); # Determine if the group G is a monomial group: IsMonomialGroup(G); # Determine if the group G is nilpotent: IsNilpotentGroup(G); # Determine if the group G is perfect: IsPerfectGroup(G); # Determine if the group G is a p-group: IsPGroup(G); # Determine if the group G is polycyclic: IsPolycyclicGroup(G); # Determine if the group G is simple: IsSimpleGroup(G); # Determine if the group G is solvable: IsSolvableGroup(G); # Determine if the group G is supersolvable: IsSupersolvableGroup(G); # Compute statistics for the group G: # Gap code to output the first two rows of the group statistics table element_orders := List(Elements(G), g -> Order(g)); orders := Set(element_orders); Print("Orders: ", orders, "\n"); element_counts := List(orders, n -> Length(Filtered(element_orders, x -> x = n))); Print("Elements: ", element_counts, " ", Size(G), "\n"); cc_orders := List(ConjugacyClasses(G), cc -> Order(Representative(cc))); cc_counts := List(orders, n -> Length(Filtered(cc_orders, x -> x = n))); Print("Conjugacy classes: ", cc_counts, " ", Length(ConjugacyClasses(G)), "\n"); # List of conjugacy classes of the group: ConjugacyClasses(G); # Output not guaranteed to exactly match the LMFDB table # Compute statistics about the characters of G: # Outputs [[d_1,c_1], [d_2,c_2], ...] where c_i is the number of irr. complex chars. of G with degree d_i CharacterDegrees(G); # Define the group with the given generators and relations: GPC := PcGroupCode(37432814164892359578174990475578987297335169041003976436514570902348843,2592); a := GPC.1; b := GPC.2; c := GPC.4; d := GPC.5; e := GPC.7; f := GPC.9; # Define the group as a permutation group: Group( (1,7)(3,9)(5,11), (4,8,12), (2,10)(4,8), (1,4,7,10)(2,5,8,11)(3,6,9,12) ); # Define the group from the transitive group database: TransitiveGroup(12, 248); TransitiveGroup(18, 388); TransitiveGroup(24, 5284); TransitiveGroup(24, 5285); TransitiveGroup(24, 5286); TransitiveGroup(24, 5287); TransitiveGroup(24, 5288); TransitiveGroup(24, 5309); TransitiveGroup(24, 5315); TransitiveGroup(36, 3912); TransitiveGroup(36, 3913); TransitiveGroup(36, 3914); TransitiveGroup(36, 3915); TransitiveGroup(36, 3916); TransitiveGroup(36, 3917); TransitiveGroup(36, 3918); TransitiveGroup(36, 3919); TransitiveGroup(36, 3920); TransitiveGroup(36, 3955); TransitiveGroup(36, 3962); TransitiveGroup(36, 3971); TransitiveGroup(36, 4022); # The primary decomposition of the group: AbelianInvariants(G); # The abelianization of the group: FactorGroup(G, DerivedSubgroup(G)); # The Schur multiplier of the group: AbelianInvariantsMultiplier(G); # The commutator length of the group: CommutatorLength(G); # List of subgroups of the group: AllSubgroups(G); # Center of the group: Center(G); # Commutator subgroup of the group G: DerivedSubgroup(G); # Frattini subgroup of the group G: FrattiniSubgroup(G); # Fitting subgroup of the group G: FittingSubgroup(G); # Radical of the group G: SolvableRadical(G); # Socle of the group G: Socle(G); # Derived series of the group G: DerivedSeriesOfGroup(G); # Chief series of the group G: ChiefSeries(G); # The lower central series of the group G: LowerCentralSeriesOfGroup(G); # The upper central series of the group G: UpperCentralSeriesOfGroup(G); # Character table: CharacterTable(G); # Output not guaranteed to exactly match the LMFDB table