// Magma code for working with abstract group 699840.c.
// Some of these functions may take a long time to execute (this depends on the group).


// Construction of abstract group: 
G := PermutationGroup< 54 | (1,4,30,27,11,3,13,10)(2,19,29,54,14,53,8,52)(5,50)(7,44)(9,43,24,46,36,41,25,42)(12,39,16,37,28,49,17,18)(15,51,32,40,31,34,33,38)(20,23,48,47,22,35,45,21), (1,54,37,24,35,33,10,41,51,36,45,17,3,53,39,8,47,12)(2,48,31,13,52,18,7,23,15,26,19,49,14,21,5,30,43,34)(4,44,50,25,6,28,27,42,38,29,22,16,11,46,40,9,20,32), (1,38,17,3,50,5)(2,20,52,29,21,41)(4,49,33,30,37,31)(6,44,36,23,42,8)(7,47,43,25,45,53)(9,22,54,14,48,19)(10,40,16)(11,18,15,13,51,12)(24,35,46)(26,39,32,27,34,28) >;

// 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 [<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 as a permutation group: 
PermutationGroup< 54 | (1,4,30,27,11,3,13,10)(2,19,29,54,14,53,8,52)(5,50)(7,44)(9,43,24,46,36,41,25,42)(12,39,16,37,28,49,17,18)(15,51,32,40,31,34,33,38)(20,23,48,47,22,35,45,21), (1,54,37,24,35,33,10,41,51,36,45,17,3,53,39,8,47,12)(2,48,31,13,52,18,7,23,15,26,19,49,14,21,5,30,43,34)(4,44,50,25,6,28,27,42,38,29,22,16,11,46,40,9,20,32), (1,38,17,3,50,5)(2,20,52,29,21,41)(4,49,33,30,37,31)(6,44,36,23,42,8)(7,47,43,25,45,53)(9,22,54,14,48,19)(10,40,16)(11,18,15,13,51,12)(24,35,46)(26,39,32,27,34,28) >;

// 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