# Gap code for working with abstract group 2592.ov.
# Some of these functions may take a long time to execute (this depends on the group).


# Construction of abstract group: 
G := Group( (3,6)(4,5)(7,11,9,14)(10,12,15,13), (7,12)(8,11)(9,10)(13,15), (7,8,9)(10,11,12)(13,14,15), (7,15,12,13)(8,10,11,9), (7,8,12,11)(9,13,10,15), (7,12,14)(8,10,15)(9,11,13), (1,2)(3,4,6,5)(7,13,9,12)(10,11,15,14), (2,6,3)(7,15,11)(8,13,12)(9,14,10), (1,5,4)(8,9)(10,13)(11,15)(12,14) );

# 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(1328119806124440603277271337533222477719567761067511596996479622963788828106892892236505465348513471928236583,2592); a := GPC.1; b := GPC.3; c := GPC.5; d := GPC.8; e := GPC.9;

# Define the group as a permutation group: 
Group( (3,6)(4,5)(7,11,9,14)(10,12,15,13), (7,12)(8,11)(9,10)(13,15), (7,8,9)(10,11,12)(13,14,15), (7,15,12,13)(8,10,11,9), (7,8,12,11)(9,13,10,15), (7,12,14)(8,10,15)(9,11,13), (1,2)(3,4,6,5)(7,13,9,12)(10,11,15,14), (2,6,3)(7,15,11)(8,13,12)(9,14,10), (1,5,4)(8,9)(10,13)(11,15)(12,14) );

# 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