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


# Construction of abstract group: 
G = PermutationGroup(['(2,4,5,7,6,8,9,3)(11,12)', '(2,5,6,9)(3,4,7,8)', '(2,6)(3,7)(4,8)(5,9)', '(1,2,6)(3,4,5)(7,9,8)', '(1,3,7)(2,4,9)(5,8,6)', '(10,11,12)'])

# Order of the group: 
G.order()

# Exponent of the group: 
G.exponent()

# Automorphism group: 
libgap(G).AutomorphismGroup()

# Composition factors of the group: 
G.composition_series()

# Nilpotency class of the group: 
libgap(G).NilpotencyClassOfGroup() if G.is_nilpotent() else -1

# Derived length of the group: 
libgap(G).DerivedLength()

# Determine if the group G is abelian: 
G.is_abelian()

# Determine if the group G is cyclic: 
G.is_cyclic()

# Determine if the group G is elementary abelian: 
G.is_elementary_abelian()

# Determine if the group G is nilpotent: 
G.is_nilpotent()

# Determine if the group G is perfect: 
G.is_perfect()

# Determine if the group G is a p-group: 
G.is_pgroup()

# Determine if the group G is polycyclic: 
G.is_polycyclic()

# Determine if the group G is simple: 
G.is_simple()

# Determine if the group G is solvable: 
G.is_solvable()

# Determine if the group G is supersolvable: 
G.is_supersolvable()

# Compute statistics for the group G: 
# Sage code to output the first two rows of the group statistics table
element_orders = [g.order() for g in G]
orders = sorted(list(set(element_orders)))
print("Orders:", orders)
print("Elements:", [element_orders.count(n) for n in orders], G.order())
cc_orders = [cc[0].order() for cc in G.conjugacy_classes()]
print("Conjugacy classes:", [cc_orders.count(n) for n in orders], len(cc_orders))

# List of conjugacy classes of the group: 
G.conjugacy_classes()  # 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
character_degrees = [c[0] for c in G.character_table()]
[[n, character_degrees.count(n)] for n in set(character_degrees)]

# Define the group with the given generators and relations: 
# This uses Sage's interface to GAP, as Sage (currently) has no native support for PC groups
GPC = gap.new('PcGroupCode(322424453990255152495124679,216)'); a = GPC.1; b = GPC.4; c = GPC.5; d = GPC.6;

# Define the group as a permutation group: 
PermutationGroup(['(2,4,5,7,6,8,9,3)(11,12)', '(2,5,6,9)(3,4,7,8)', '(2,6)(3,7)(4,8)(5,9)', '(1,2,6)(3,4,5)(7,9,8)', '(1,3,7)(2,4,9)(5,8,6)', '(10,11,12)'])

# Define the group as a matrix group with coefficients in GLFp: 
MS = MatrixSpace(GF(3), 4, 4)
MatrixGroup([MS([[2, 0, 0, 1], [0, 1, 0, 0], [1, 0, 1, 1], [2, 0, 0, 0]]), MS([[1, 1, 2, 2], [0, 2, 0, 0], [0, 1, 1, 0], [0, 2, 1, 2]]), MS([[2, 1, 1, 2], [2, 1, 0, 2], [1, 1, 2, 2], [2, 2, 2, 2]]), MS([[0, 2, 2, 1], [2, 0, 1, 0], [2, 0, 1, 2], [2, 1, 1, 1]]), MS([[0, 1, 2, 1], [2, 1, 2, 1], [2, 0, 1, 2], [1, 2, 1, 0]]), MS([[1, 0, 2, 2], [2, 1, 0, 2], [1, 0, 0, 0], [0, 0, 1, 2]])])

# Define the group from the transitive group database: 
TransitiveGroup(24, 568)
TransitiveGroup(27, 80)
TransitiveGroup(36, 288)

# The abelianization of the group: 
G.quotient(G.commutator())

# The Schur multiplier of the group: 
G.homology(2)

# List of subgroups of the group: 
G.subgroups()

# Center of the group: 
G.center()

# Commutator subgroup of the group G: 
G.commutator()

# Frattini subgroup of the group G: 
G.frattini_subgroup()

# Fitting subgroup of the group G: 
G.fitting_subgroup()

# Socle of the group G: 
G.socle()

# Derived series of the group G: 
G.derived_series()

# Chief series of the group G: 
libgap(G).ChiefSeries()

# The lower central series of the group G: 
G.lower_central_series()

# The upper central series of the group G: 
G.upper_central_series()

# Character table: 
G.character_table()  # Output not guaranteed to exactly match the LMFDB table