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


# Define group as a cyclic group: 
G = CyclicPermutationGroup(1002)

# 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(171128987987,1002)'); a = GPC.1;

# Define the group as a permutation group: 
PermutationGroup(['(1,2)', '(3,5,4)', '(6,172,171,170,169,168,167,166,165,164,163,162,161,160,159,158,157,156,155,154,153,152,151,150,149,148,147,146,145,144,143,142,141,140,139,138,137,136,135,134,133,132,131,130,129,128,127,126,125,124,123,122,121,120,119,118,117,116,115,114,113,112,111,110,109,108,107,106,105,104,103,102,101,100,99,98,97,96,95,94,93,92,91,90,89,88,87,86,85,84,83,82,81,80,79,78,77,76,75,74,73,72,71,70,69,68,67,66,65,64,63,62,61,60,59,58,57,56,55,54,53,52,51,50,49,48,47,46,45,44,43,42,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)'])

# 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