// Magma code for working with abstract group 26244.ki. // Some of these functions may take a long time to execute (this depends on the group). // Construction of abstract group: G := PermutationGroup< 36 | (1,30,25,16,13,6,3,29,27,17,14,5,2,28,26,18,15,4)(7,35,32,24,21,12,9,34,33,22,20,10,8,36,31,23,19,11), (1,34,13,11,26,22,2,35,15,10,27,24,3,36,14,12,25,23)(4,20,18,31,28,8,5,21,17,33,29,9,6,19,16,32,30,7) >; // Order of the group: Order(G); // Exponent of the group: Exponent(G); // Automorphism group: AutomorphismGroup(G); // Composition factors of the group: CompositionFactors(G); // Nilpotency class of the group: NilpotencyClass(G); // 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 nilpotent: IsNilpotent(G); // Determine if the group G is perfect: IsPerfect(G); // Determine if the group G is simple: IsSimple(G); // Determine if the group G is solvable: IsSolvable(G); // Compute statistics for the group G: // Magma code to output the first two rows of the group statistics table element_orders := [Order(g) : g in G]; orders := Set(element_orders); printf "Orders: %o\n", orders; printf "Elements: %o %o\n", [#[x : x in element_orders | x eq n] : n in orders], Order(G); cc_orders := [cc[1] : cc in ConjugacyClasses(G)]; printf "Conjugacy classes: %o %o\n", [#[x : x in cc_orders | x eq n] : n in orders], #cc_orders; // 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 [, , ...] 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 := PCGroup([10, -2, -3, -3, -2, -3, -3, -3, -3, 3, -3, 20, 71, 64083, 343813, 113, 63004, 462614, 194, 12965, 1723686, 79396, 10116, 4456, 1555207, 8677, 612368, 962298, 72938, 29208, 97239]); a,b,c,d,e,f := Explode([GPC.1, GPC.4, GPC.7, GPC.8, GPC.9, GPC.10]); AssignNames(~GPC, ["a", "a2", "a6", "b", "b2", "b6", "c", "d", "e", "f"]); // Define the group as a permutation group: PermutationGroup< 36 | (1,30,25,16,13,6,3,29,27,17,14,5,2,28,26,18,15,4)(7,35,32,24,21,12,9,34,33,22,20,10,8,36,31,23,19,11), (1,34,13,11,26,22,2,35,15,10,27,24,3,36,14,12,25,23)(4,20,18,31,28,8,5,21,17,33,29,9,6,19,16,32,30,7) >; // Define the group from the transitive group database: TransitiveGroup(36, 12926); // The primary decomposition of the group: PrimaryInvariants(G); // The abelianization of the group: quo< G | CommutatorSubgroup(G) >; // List of subgroups of the group: Subgroups(G); // Center of the group: Center(G); // Commutator subgroup of the group G: CommutatorSubgroup(G); // Frattini subgroup of the group G: FrattiniSubgroup(G); // Fitting subgroup of the group G: FittingSubgroup(G); // Radical of the group G: Radical(G); // Socle of the group G: Socle(G); // Derived series of the group G: DerivedSeries(G); // Chief series of the group G: ChiefSeries(G); // The lower central series of the group G: LowerCentralSeries(G); // The upper central series of the group G: UpperCentralSeries(G); // Character table: CharacterTable(G); // Output not guaranteed to exactly match the LMFDB table