LMFDB - Abstract group 3660.a: $F

comment:Define the group as a permutation group

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

gap:G := Group( (1,8,55,27,16,38,56,21,29,17,41,50,36,59,18,39,58,15,45,43,46,44,49,34,4,3,9,57,22,32,7,61,14,42,53,31,13,48,40,52,28,19,33,10,51,30,11,54,24,26,23,25,20,35,5,6,60,12,47,37), (1,51,40,29,18,7,57,46,35,24,13,3,53,42,31,20,9,59,48,37,26,15,5,55,44,33,22,11,61,50,39,28,17,2,52,41,30,19,8,58,47,36,25,14,4,54,43,32,21,10,60,49,38,27,16,6,56,45,34,23,12) );

sage:G = PermutationGroup(['(1,8,55,27,16,38,56,21,29,17,41,50,36,59,18,39,58,15,45,43,46,44,49,34,4,3,9,57,22,32,7,61,14,42,53,31,13,48,40,52,28,19,33,10,51,30,11,54,24,26,23,25,20,35,5,6,60,12,47,37)', '(1,51,40,29,18,7,57,46,35,24,13,3,53,42,31,20,9,59,48,37,26,15,5,55,44,33,22,11,61,50,39,28,17,2,52,41,30,19,8,58,47,36,25,14,4,54,43,32,21,10,60,49,38,27,16,6,56,45,34,23,12)'])

sage_gap:# This uses Sage's interface to GAP, as Sage (currently) has no native support for PC groups G = gap.new('PcGroupCode(1746039816813374045948699970883203839,3660)'); a = G.1; b = G.5;

Group information

Description:	$F_{61}$
Order:	$3660$$\medspace = 2^{2} \cdot 3 \cdot 5 \cdot 61 $	comment:Order of the group magma:Order(G); gap:Order(G); sage:G.order() sage_gap:G.Order()
Exponent:	$3660$$\medspace = 2^{2} \cdot 3 \cdot 5 \cdot 61 $	comment:Exponent of the group magma:Exponent(G); gap:Exponent(G); sage:G.exponent() sage_gap:G.Exponent()
Automorphism group:	$F_{61}$, of order $3660$$\medspace = 2^{2} \cdot 3 \cdot 5 \cdot 61 $	comment:Automorphism group gap:AutomorphismGroup(G); magma:AutomorphismGroup(G); sage_gap:G.AutomorphismGroup()
Composition factors:	$C_2$ x 2, $C_3$, $C_5$, $C_{61}$	comment:Composition factors of the group magma:CompositionFactors(G); gap:CompositionSeries(G); sage:G.composition_series() sage_gap:G.CompositionSeries()
Derived length:	$2$	comment:Derived length of the group magma:DerivedLength(G); gap:DerivedLength(G); sage_gap:G.DerivedLength()

This group is nonabelian and a Z-group (hence solvable, supersolvable, monomial, metacyclic, metabelian, and an A-group).

comment:Determine if the group G is abelian

magma:IsAbelian(G);

gap:IsAbelian(G);

sage:G.is_abelian()

sage_gap:G.IsAbelian()

comment:Determine if the group G is cyclic

magma:IsCyclic(G);

gap:IsCyclic(G);

sage:G.is_cyclic()

sage_gap:G.IsCyclic()

comment:Determine if the group G is nilpotent

magma:IsNilpotent(G);

gap:IsNilpotentGroup(G);

sage:G.is_nilpotent()

sage_gap:G.IsNilpotentGroup()

comment:Determine if the group G is solvable

magma:IsSolvable(G);

gap:IsSolvableGroup(G);

sage:G.is_solvable()

sage_gap:G.IsSolvableGroup()

comment:Determine if the group G is supersolvable

gap:IsSupersolvableGroup(G);

sage:G.is_supersolvable()

sage_gap:G.IsSupersolvableGroup()

comment:Determine if the group G is simple

magma:IsSimple(G);

gap:IsSimpleGroup(G);

sage_gap:G.IsSimpleGroup()

Group statistics

comment:Compute statistics for the group G

magma:// 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;

gap:# 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");

sage:# 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))

Order	1	2	3	4	5	6	10	12	15	20	30	60	61
Elements	1	61	122	122	244	122	244	244	488	488	488	976	60	3660
Conjugacy classes	1	1	2	2	4	2	4	4	8	8	8	16	1	61
Divisions	1	1	1	1	1	1	1	1	1	1	1	1	1	13
Autjugacy classes	1	1	2	2	4	2	4	4	8	8	8	16	1	61

comment:Compute statistics about the characters of G

magma:// 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);

gap:# 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);

sage:# 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)]

sage_gap:G.CharacterDegrees()

Dimension	1	2	4	8	16	60
Irr. complex chars.	60	0	0	0	0	1	61
Irr. rational chars.	2	3	3	3	1	1	13

Minimal presentations

Permutation degree:	$61$
Transitive degree:	$61$
Rank:	$2$
Inequivalent generating pairs:	$2304$

Minimal degrees of faithful linear representations

	Over $\mathbb{C}$	Over $\mathbb{R}$	Over $\mathbb{Q}$
Irreducible	60	60	60
Arbitrary	60	60	60

Constructions

Show commands: Gap / Magma / SageMath

Groups of Lie type:	$\AGL(1,61)$, $\AGammaL(1,61)$
Presentation:	$\langle a, b \mid a^{60}=b^{61}=1, b^{a}=b^{10} \rangle$ < a, b \| a^60,b^61, b^10a^-1b^-1*a >
comment:Define the group with the given generators and relations magma:G := PCGroup([5, -2, -2, -3, -5, -61, 10, 26, 57, 15004, 29259, 21389, 7269]); a,b := Explode([G.1, G.5]); AssignNames(~G, ["a", "a2", "a4", "a12", "b"]); gap:G := PcGroupCode(1746039816813374045948699970883203839,3660); a := G.1; b := G.5; sage:# This uses Sage's interface to GAP, as Sage (currently) has no native support for PC groups G = gap.new('PcGroupCode(1746039816813374045948699970883203839,3660)'); a = G.1; b = G.5; sage_gap:# This uses Sage's interface to GAP, as Sage (currently) has no native support for PC groups G = gap.new('PcGroupCode(1746039816813374045948699970883203839,3660)'); a = G.1; b = G.5;
Permutation group:	Degree $61$ $\langle(1,8,55,27,16,38,56,21,29,17,41,50,36,59,18,39,58,15,45,43,46,44,49,34,4,3,9,57,22,32,7,61,14,42,53,31,13,48,40,52,28,19,33,10,51,30,11,54,24,26,23,25,20,35,5,6,60,12,47,37) \!\cdots\! \rangle$ (1,8,55,27,16,38,56,21,29,17,41,50,36,59,18,39,58,15,45,43,46,44,49,34,4,3,9,57,22,32,7,61,14,42,53,31,13,48,40,52,28,19,33,10,51,30,11,54,24,26,23,25,20,35,5,6,60,12,47,37), (1,51,40,29,18,7,57,46,35,24,13,3,53,42,31,20,9,59,48,37,26,15,5,55,44,33,22,11,61,50,39,28,17,2,52,41,30,19,8,58,47,36,25,14,4,54,43,32,21,10,60,49,38,27,16,6,56,45,34,23,12)
comment:Define the group as a permutation group magma:G := PermutationGroup< 61 \| (1,8,55,27,16,38,56,21,29,17,41,50,36,59,18,39,58,15,45,43,46,44,49,34,4,3,9,57,22,32,7,61,14,42,53,31,13,48,40,52,28,19,33,10,51,30,11,54,24,26,23,25,20,35,5,6,60,12,47,37), (1,51,40,29,18,7,57,46,35,24,13,3,53,42,31,20,9,59,48,37,26,15,5,55,44,33,22,11,61,50,39,28,17,2,52,41,30,19,8,58,47,36,25,14,4,54,43,32,21,10,60,49,38,27,16,6,56,45,34,23,12) >; gap:G := Group( (1,8,55,27,16,38,56,21,29,17,41,50,36,59,18,39,58,15,45,43,46,44,49,34,4,3,9,57,22,32,7,61,14,42,53,31,13,48,40,52,28,19,33,10,51,30,11,54,24,26,23,25,20,35,5,6,60,12,47,37), (1,51,40,29,18,7,57,46,35,24,13,3,53,42,31,20,9,59,48,37,26,15,5,55,44,33,22,11,61,50,39,28,17,2,52,41,30,19,8,58,47,36,25,14,4,54,43,32,21,10,60,49,38,27,16,6,56,45,34,23,12) ); sage:G = PermutationGroup(['(1,8,55,27,16,38,56,21,29,17,41,50,36,59,18,39,58,15,45,43,46,44,49,34,4,3,9,57,22,32,7,61,14,42,53,31,13,48,40,52,28,19,33,10,51,30,11,54,24,26,23,25,20,35,5,6,60,12,47,37)', '(1,51,40,29,18,7,57,46,35,24,13,3,53,42,31,20,9,59,48,37,26,15,5,55,44,33,22,11,61,50,39,28,17,2,52,41,30,19,8,58,47,36,25,14,4,54,43,32,21,10,60,49,38,27,16,6,56,45,34,23,12)'])
Matrix group:	$\left\langle \left(\begin{array}{rr} 37 & 0 \\ 0 & 5 \end{array}\right), \left(\begin{array}{rr} 1 & 1 \\ 0 & 1 \end{array}\right) \right\rangle \subseteq \GL_{2}(\F_{61})$
comment:Define the group as a matrix group with coefficients in GLFp magma:G := MatrixGroup< 2, GF(61) \| [[37, 0, 0, 5], [1, 1, 0, 1]] >; gap:G := Group([[[ Z(61)^39, 0Z(61) ], [ 0Z(61), Z(61)^22 ]], [[ Z(61)^0, Z(61)^0 ], [ 0*Z(61), Z(61)^0 ]]]); sage:MS = MatrixSpace(GF(61), 2, 2) G = MatrixGroup([MS([[37, 0], [0, 5]]), MS([[1, 1], [0, 1]])])
Direct product:	not isomorphic to a non-trivial direct product
Semidirect product:	$C_{61}$ $\,\rtimes\,$ $C_{60}$	$(C_{61}:C_{20})$ $\,\rtimes\,$ $C_3$	$(C_{61}:C_{15})$ $\,\rtimes\,$ $C_4$	$(C_{61}:C_{12})$ $\,\rtimes\,$ $C_5$	all 7
Trans. wreath product:	not isomorphic to a non-trivial transitive wreath product
Non-split product:	$D_{61}$ . $C_{30}$	$(C_{61}:C_{30})$ . $C_2$	$(C_{61}:C_{10})$ . $C_6$	$(C_{61}:C_6)$ . $C_{10}$	more information
Aut. group:	$\Aut(D_{61})$	$\Aut(C_{61}:C_3)$	$\Aut(C_{61}:C_4)$	$\Aut(C_{61}:C_5)$	all 14

Elements of the group are displayed as words in the presentation generators from the presentation above.

Homology

Abelianization:	$C_{60} \simeq C_{4} \times C_{3} \times C_{5}$	comment:The abelianization of the group magma:quo< G \| CommutatorSubgroup(G) >; gap:FactorGroup(G, DerivedSubgroup(G)); sage:G.quotient(G.commutator())
Schur multiplier:	$C_1$	comment:The Schur multiplier of the group gap:AbelianInvariantsMultiplier(G); sage:G.homology(2) sage_gap:G.AbelianInvariantsMultiplier()
Commutator length:	$1$	comment:The commutator length of the group gap:CommutatorLength(G); sage_gap:G.CommutatorLength()

Subgroups

comment:List of subgroups of the group

magma:Subgroups(G);

gap:AllSubgroups(G);

sage:G.subgroups()

sage_gap:G.AllSubgroups()

There are 684 subgroups in 24 conjugacy classes, 13 normal, and all normal subgroups are characteristic.

Characteristic subgroups are shown in this color.

Special subgroups

Center:	$Z \simeq$ $C_1$	$G/Z \simeq$ $F_{61}$	comment:Center of the group magma:Center(G); gap:Center(G); sage:G.center() sage_gap:G.Center()
Commutator:	$G' \simeq$ $C_{61}$	$G/G' \simeq$ $C_{60}$	comment:Commutator subgroup of the group G magma:CommutatorSubgroup(G); gap:DerivedSubgroup(G); sage:G.commutator() sage_gap:G.DerivedSubgroup()
Frattini:	$\Phi \simeq$ $C_1$	$G/\Phi \simeq$ $F_{61}$	comment:Frattini subgroup of the group G magma:FrattiniSubgroup(G); gap:FrattiniSubgroup(G); sage:G.frattini_subgroup() sage_gap:G.FrattiniSubgroup()
Fitting:	$\operatorname{Fit} \simeq$ $C_{61}$	$G/\operatorname{Fit} \simeq$ $C_{60}$	comment:Fitting subgroup of the group G magma:FittingSubgroup(G); gap:FittingSubgroup(G); sage:G.fitting_subgroup() sage_gap:G.FittingSubgroup()
Radical:	$R \simeq$ $F_{61}$	$G/R \simeq$ $C_1$	comment:Radical of the group G magma:Radical(G); gap:SolvableRadical(G); sage_gap:G.SolvableRadical()
Socle:	$\operatorname{soc} \simeq$ $C_{61}$	$G/\operatorname{soc} \simeq$ $C_{60}$	comment:Socle of the group G magma:Socle(G); gap:Socle(G); sage:G.socle() sage_gap:G.Socle()
2-Sylow subgroup:	$P_{ 2 } \simeq$ $C_4$
3-Sylow subgroup:	$P_{ 3 } \simeq$ $C_3$
5-Sylow subgroup:	$P_{ 5 } \simeq$ $C_5$
61-Sylow subgroup:	$P_{ 61 } \simeq$ $C_{61}$

Subgroup diagram and profile

For the default diagram, subgroups are sorted vertically by the number of prime divisors (counted with multiplicity) in their orders.
To see subgroups sorted vertically by order instead, check this box.

Subgroup information

Click on a subgroup in the diagram to see information about it.

See a full page version of the diagram

Series

Derived series

$F_{61}$

$\rhd$

$C_{61}$

$\rhd$

$C_1$

comment:Derived series of the group GF

magma:DerivedSeries(G);

gap:DerivedSeriesOfGroup(G);

sage:G.derived_series()

sage_gap:G.DerivedSeriesOfGroup()

Chief series

$F_{61}$

$\rhd$

$C_{61}:C_{30}$

$\rhd$

$C_{61}:C_{15}$

$\rhd$

$C_{61}:C_5$

$\rhd$

$C_{61}$

$\rhd$

$C_1$

comment:Chief series of the group G

magma:ChiefSeries(G);

gap:ChiefSeries(G);

sage_gap:G.ChiefSeries()

Lower central series

$F_{61}$

$\rhd$

$C_{61}$

comment:The lower central series of the group G

magma:LowerCentralSeries(G);

gap:LowerCentralSeriesOfGroup(G);

sage:G.lower_central_series()

sage_gap:G.LowerCentralSeriesOfGroup()

Upper central series

$C_1$

comment:The upper central series of the group G

magma:UpperCentralSeries(G);

gap:UpperCentralSeriesOfGroup(G);

sage:G.upper_central_series()

sage_gap:G.UpperCentralSeriesOfGroup()

Supergroups

This group is a maximal subgroup of 4 larger groups in the database.

This group is a maximal quotient of 3 larger groups in the database.

Character theory

comment:Character table

magma:CharacterTable(G); // Output not guaranteed to exactly match the LMFDB table

gap:CharacterTable(G); # Output not guaranteed to exactly match the LMFDB table

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

sage_gap:G.CharacterTable() # Output not guaranteed to exactly match the LMFDB table

Complex character table

See the $61 \times 61$ character table. Alternatively, you may search for characters of this group with desired properties.

Rational character table

		1A	2A	3A	4A	5A	6A	10A	12A	15A	20A	30A	60A	61A
	Size	1	61	122	122	244	122	244	244	488	488	488	976	60
	2 P	1A	1A	3A	2A	5A	3A	5A	6A	15A	10A	15A	30A	61A
	3 P	1A	2A	1A	4A	5A	2A	10A	4A	5A	20A	10A	20A	61A
	5 P	1A	2A	3A	4A	1A	6A	2A	12A	3A	4A	6A	12A	61A
	61 P	1A	2A	3A	4A	5A	6A	10A	12A	15A	20A	30A	60A	1A
3660.a.1a		$1$	$1$	$1$	$1$	$1$	$1$	$1$	$1$	$1$	$1$	$1$	$1$	$1$
3660.a.1b		$1$	$1$	$1$	$- 1$	$1$	$1$	$1$	$- 1$	$1$	$- 1$	$1$	$- 1$	$1$
3660.a.1c		$2$	$2$	$- 1$	$2$	$2$	$- 1$	$2$	$- 1$	$- 1$	$2$	$- 1$	$- 1$	$2$
3660.a.1d		$2$	$- 2$	$2$	$0$	$2$	$- 2$	$- 2$	$0$	$2$	$0$	$- 2$	$0$	$2$
3660.a.1e		$2$	$2$	$- 1$	$- 2$	$2$	$- 1$	$2$	$1$	$- 1$	$- 2$	$- 1$	$1$	$2$
3660.a.1f		$4$	$4$	$4$	$4$	$- 1$	$4$	$- 1$	$4$	$- 1$	$- 1$	$- 1$	$- 1$	$4$
3660.a.1g		$4$	$4$	$4$	$- 4$	$- 1$	$4$	$- 1$	$- 4$	$- 1$	$1$	$- 1$	$1$	$4$
3660.a.1h		$4$	$- 4$	$- 2$	$0$	$4$	$2$	$- 4$	$0$	$- 2$	$0$	$2$	$0$	$4$
3660.a.1i		$8$	$8$	$- 4$	$8$	$- 2$	$- 4$	$- 2$	$- 4$	$1$	$- 2$	$1$	$1$	$8$
3660.a.1j		$8$	$- 8$	$8$	$0$	$- 2$	$- 8$	$2$	$0$	$- 2$	$0$	$2$	$0$	$8$
3660.a.1k		$8$	$8$	$- 4$	$- 8$	$- 2$	$- 4$	$- 2$	$4$	$1$	$2$	$1$	$- 1$	$8$
3660.a.1l		$16$	$- 16$	$- 8$	$0$	$- 4$	$8$	$4$	$0$	$2$	$0$	$- 2$	$0$	$16$
3660.a.60a		$60$	$0$	$0$	$0$	$0$	$0$	$0$	$0$	$0$	$0$	$0$	$0$	$- 1$

Overview	Random
Universe	Knowledge

Classical	Maass
Hilbert	Bianchi

Elliptic curves over $\Q$
Elliptic curves over $\Q(\alpha)$
Genus 2 curves over $\Q$
Higher genus families
Abelian varieties over $\F_{q}$
Belyi maps

Label	3660.a
Order	\( 2^{2} \cdot 3 \cdot 5 \cdot 61 \)
Exponent	\( 2^{2} \cdot 3 \cdot 5 \cdot 61 \)

Nilpotent	no
Solvable	yes
$\card{G^{\mathrm{ab}}}$	\( 2^{2} \cdot 3 \cdot 5 \)
$\card{Z(G)}$	\( 1 \)
$\card{\Aut(G)}$	\( 2^{2} \cdot 3 \cdot 5 \cdot 61 \)
$\card{\mathrm{Out}(G)}$	\( 1 \)
Perm deg.	$61$
Trans deg.	$61$
Rank	$2$

Introduction

L-functions

Modular forms

Varieties

Fields

Representations

Groups

Database

Properties

Related objects

Downloads

Learn more

Group information

Group statistics

Minimal presentations

Minimal degrees of faithful linear representations

Constructions

Homology

Subgroups

Special subgroups

Subgroup diagram and profile

Classes of subgroups up to conjugation

Classes of subgroups up to automorphism

Normal subgroups

Normal subgroups up to automorphism

Subgroup information

Classes of subgroups up to conjugation

Classes of subgroups up to automorphism

Normal subgroups (quotient in parentheses)

Normal subgroups up to automorphism (quotient in parentheses)

Series

Supergroups

Character theory

Complex character table

Rational character table

This project is supported by grants from the US National Science Foundation, the UK Engineering and Physical Sciences Research Council, and the Simons Foundation.