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


# Construction of abstract group: 
G := SmallGroup(205, 1);

# 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(60959,205); a := GPC.1; b := GPC.2;

# Define the group as a permutation group: 
Group( (2,11,19,17,38)(3,21,37,33,34)(4,31,14,8,30)(5,41,32,24,26)(6,10,9,40,22)(7,20,27,15,18)(12,29,35,13,39)(16,28,25,36,23), (1,41,40,39,38,37,36,35,34,33,32,31,30,29,28,27,26,25,24,23,22,21,20,19,18,17,16,15,14,13,12,11,10,9,8,7,6,5,4,3,2) );

# Define the group as a matrix group with coefficients in GLFp: 
Group([[[ Z(41)^0, Z(41)^0 ], [ 0*Z(41), Z(41)^0 ]], [[ Z(41)^32, 0*Z(41) ], [ 0*Z(41), Z(41)^16 ]]]);

# Define the group from the transitive group database: 
TransitiveGroup(41, 4);

# 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