# Gap code for working with abstract group 1944.3557. # Some of these functions may take a long time to execute (this depends on the group). # Construction of abstract group: G := SmallGroup(1944, 3557); # 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(99728284078434939821445511717423707898136789516692457247,1944); a := GPC.1; b := GPC.2; c := GPC.5; d := GPC.6; e := GPC.7; f := GPC.8; # Define the group as a permutation group: Group( (2,5,7,17)(3,9,11,21)(6,12,19,16)(8,22,23,26)(10,18,25,20)(13,27,14,24)(28,29)(30,32)(31,33), (2,6,7,19)(3,10,11,25)(5,16,17,12)(8,13,23,14)(9,20,21,18)(22,24,26,27)(28,29)(30,33)(31,32), (2,7)(3,11)(5,17)(6,19)(8,23)(9,21)(10,25)(12,16)(13,14)(18,20)(22,26)(24,27), (1,2,7)(3,12,26)(4,9,21)(5,18,23)(6,14,10)(8,20,17)(11,22,16)(13,19,25)(15,24,27), (1,3,13)(2,8,18)(4,14,5)(6,16,7)(9,12,22)(10,19,24)(11,15,17)(20,25,21)(23,27,26), (28,30,31)(29,32,33), (28,31,30)(29,32,33), (1,4,15)(2,9,24)(3,14,17)(5,11,13)(6,20,26)(7,21,27)(8,12,10)(16,25,23)(18,22,19) ); # Define the group from the transitive group database: TransitiveGroup(36, 2997); # 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