LMFDB - Abstract group 8064.ca: $C_2\times S

Show commands: Gap / Magma / Oscar / SageMath

comment:Construction of abstract group

magma:G := PermutationGroup< 13 | (1,2)(5,7)(8,9,10,11,12,13), (1,3,5)(2,4,6)(8,10,11,13) >;

gap:G := Group( (1,2)(5,7)(8,9,10,11,12,13), (1,3,5)(2,4,6)(8,10,11,13) );

sage:G = PermutationGroup(['(1,2)(5,7)(8,9,10,11,12,13)', '(1,3,5)(2,4,6)(8,10,11,13)'])

sage_gap:G = gap.new('Group( (1,2)(5,7)(8,9,10,11,12,13), (1,3,5)(2,4,6)(8,10,11,13) )')

oscar:G = @permutation_group(13, (1,2)(5,7)(8,9,10,11,12,13), (1,3,5)(2,4,6)(8,10,11,13))

Group information

Description:	$C_2\times S_4\times \GL(3,2)$
Order:	$8064$$\medspace = 2^{7} \cdot 3^{2} \cdot 7 $	comment:Order of the group magma:Order(G); gap:Order(G); sage:G.order() sage_gap:G.Order() oscar:order(G)
Exponent:	$84$$\medspace = 2^{2} \cdot 3 \cdot 7 $	comment:Exponent of the group magma:Exponent(G); gap:Exponent(G); sage:G.exponent() sage_gap:G.Exponent() oscar:exponent(G)
Automorphism group:	$C_2\times S_4\times \PGL(2,7)$, of order $16128$$\medspace = 2^{8} \cdot 3^{2} \cdot 7 $	comment:Automorphism group gap:AutomorphismGroup(G); magma:AutomorphismGroup(G); sage:libgap(G).AutomorphismGroup() sage_gap:G.AutomorphismGroup() oscar:automorphism_group(G)
Composition factors:	$C_2$ x 4, $C_3$, $\PSL(2,7)$	comment:Composition factors of the group magma:CompositionFactors(G); gap:CompositionSeries(G); sage:G.composition_series() sage_gap:G.CompositionSeries() oscar:composition_series(G)
Derived length:	$3$	comment:Derived length of the group magma:DerivedLength(G); gap:DerivedLength(G); sage:libgap(G).DerivedLength() sage_gap:G.DerivedLength() oscar:derived_length(G)

This group is nonabelian and nonsolvable.

comment:Determine if the group G is abelian

magma:IsAbelian(G);

gap:IsAbelian(G);

sage:G.is_abelian()

sage_gap:G.IsAbelian()

oscar:is_abelian(G)

comment:Determine if the group G is cyclic

magma:IsCyclic(G);

gap:IsCyclic(G);

sage:G.is_cyclic()

sage_gap:G.IsCyclic()

oscar:is_cyclic(G)

comment:Determine if the group G is nilpotent

magma:IsNilpotent(G);

gap:IsNilpotentGroup(G);

sage:G.is_nilpotent()

sage_gap:G.IsNilpotentGroup()

oscar:is_nilpotent(G)

comment:Determine if the group G is solvable

magma:IsSolvable(G);

gap:IsSolvableGroup(G);

sage:G.is_solvable()

sage_gap:G.IsSolvableGroup()

oscar:is_solvable(G)

comment:Determine if the group G is supersolvable

gap:IsSupersolvableGroup(G);

sage:G.is_supersolvable()

sage_gap:G.IsSupersolvableGroup()

oscar:is_supersolvable(G)

comment:Determine if the group G is simple

magma:IsSimple(G);

gap:IsSimpleGroup(G);

sage:G.is_simple()

sage_gap:G.IsSimpleGroup()

oscar:is_simple(G)

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))

sage_gap:# Sage code (using the GAP interface) to output the first two rows of the group statistics table element_orders = [g.Order() for g in G.Elements()] orders = sorted(list(set(element_orders))) print("Orders:", orders) print("Elements:", [element_orders.count(n) for n in orders], G.Order()) cc_orders = [cc.Representative().Order() for cc in G.ConjugacyClasses()] print("Conjugacy classes:", [cc_orders.count(n) for n in orders], len(cc_orders))

oscar:# Oscar code to output the first two rows of the group statistics table element_orders = [order(g) for g in elements(G)] orders = sort(unique(element_orders)) println("Orders: ", orders) element_counts = [count(==(n), element_orders) for n in orders] println("Elements: ", element_counts, " ", order(G)) ccs = conjugacy_classes(G) cc_orders = [order(representative(cc)) for cc in ccs] cc_counts = [count(==(n), cc_orders) for n in orders] println("Conjugacy classes: ", cc_counts, " ", length(ccs))

Order	1	2	3	4	6	7	12	14	21	28	42
Elements	1	439	512	1608	1856	48	1344	912	384	576	384	8064
Conjugacy classes	1	11	3	12	9	2	4	10	2	4	2	60
Divisions	1	11	3	12	9	1	4	5	1	2	1	50
Autjugacy classes	1	9	3	8	8	1	3	4	1	1	1	40

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:# 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 G.CharacterDegrees()

oscar:# Outputs an MSet containing the absolutely irreducible degrees of G and their multiplicities. character_degrees(G)

Dimension	1	2	3	6	7	8	9	12	14	16	18	21	24
Irr. complex chars.	4	2	12	8	4	4	8	2	2	2	4	4	4	60
Irr. rational chars.	4	2	4	8	4	4	0	4	2	2	8	4	4	50

Minimal presentations

Permutation degree:	$13$
Transitive degree:	$42$
Rank:	$2$
Inequivalent generating pairs:	$513$

Minimal degrees of faithful linear representations

	Over $\mathbb{C}$	Over $\mathbb{R}$	Over $\mathbb{Q}$
Irreducible	9	18	18
Arbitrary	6	9	9

Constructions

Show commands: Gap / Magma / Oscar / SageMath

Permutation group:	Degree $13$ $\langle(1,2)(5,7)(8,9,10,11,12,13), (1,3,5)(2,4,6)(8,10,11,13)\rangle$ (1,2)(5,7)(8,9,10,11,12,13), (1,3,5)(2,4,6)(8,10,11,13)
comment:Define the group as a permutation group magma:G := PermutationGroup< 13 \| (1,2)(5,7)(8,9,10,11,12,13), (1,3,5)(2,4,6)(8,10,11,13) >; gap:G := Group( (1,2)(5,7)(8,9,10,11,12,13), (1,3,5)(2,4,6)(8,10,11,13) ); sage:G = PermutationGroup(['(1,2)(5,7)(8,9,10,11,12,13)', '(1,3,5)(2,4,6)(8,10,11,13)']) sage_gap:G = gap.new('Group( (1,2)(5,7)(8,9,10,11,12,13), (1,3,5)(2,4,6)(8,10,11,13) )') oscar:G = @permutation_group(13, (1,2)(5,7)(8,9,10,11,12,13), (1,3,5)(2,4,6)(8,10,11,13))
Transitive group:	42T520	42T521			more information
magma:G := TransitiveGroup(42, 520); gap:G := TransitiveGroup(42, 520); sage:G = TransitiveGroup(42, 520) sage_gap:G = libgap.TransitiveGroup(42, 520) oscar:G = transitive_group(42, 520) magma:G := TransitiveGroup(42, 521); gap:G := TransitiveGroup(42, 521); sage:G = TransitiveGroup(42, 521) sage_gap:G = libgap.TransitiveGroup(42, 521) oscar:G = transitive_group(42, 521)
Direct product:	$C_2$ $\, \times\, $ $S_4$ $\, \times\, $ $\PSL(2,7)$
Semidirect product:	$(C_2^3\times \GL(3,2))$ $\,\rtimes\,$ $S_3$	$C_2^3$ $\,\rtimes\,$ $(S_3\times \GL(3,2))$	$(A_4\times \GL(3,2))$ $\,\rtimes\,$ $C_2^2$	$A_4$ $\,\rtimes\,$ $(C_2^2\times \GL(3,2))$	all 8
Trans. wreath product:	not isomorphic to a non-trivial transitive wreath product

Elements of the group are displayed as permutations of degree 13.

Homology

Abelianization:	$C_{2}^{2} $	comment:The abelianization of the group magma:quo< G \| CommutatorSubgroup(G) >; gap:FactorGroup(G, DerivedSubgroup(G)); sage:G.quotient(G.commutator()) sage_gap:G.FactorGroup(G.DerivedSubgroup()) oscar:quo(G, derived_subgroup(G)[1])
Schur multiplier:	$C_{2}^{3}$	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()

oscar:subgroups(G)

There are 89606 subgroups in 1409 conjugacy classes, 18 normal (14 characteristic).

Characteristic subgroups are shown in this color. Normal (but not characteristic) subgroups are shown in this color.

Special subgroups

Center:	$Z \simeq$ $C_2$	$G/Z \simeq$ $S_4\times \GL(3,2)$	comment:Center of the group magma:Center(G); gap:Center(G); sage:G.center() sage_gap:G.Center() oscar:center(G)
Commutator:	$G' \simeq$ $A_4\times \GL(3,2)$	$G/G' \simeq$ $C_2^2$	comment:Commutator subgroup of the group G magma:CommutatorSubgroup(G); gap:DerivedSubgroup(G); sage:G.commutator() sage_gap:G.DerivedSubgroup() oscar:derived_subgroup(G)
Frattini:	$\Phi \simeq$ $C_1$	$G/\Phi \simeq$ $C_2\times S_4\times \GL(3,2)$	comment:Frattini subgroup of the group G magma:FrattiniSubgroup(G); gap:FrattiniSubgroup(G); sage:G.frattini_subgroup() sage_gap:G.FrattiniSubgroup() oscar:frattini_subgroup(G)
Fitting:	$\operatorname{Fit} \simeq$ $C_2^3$	$G/\operatorname{Fit} \simeq$ $S_3\times \GL(3,2)$	comment:Fitting subgroup of the group G magma:FittingSubgroup(G); gap:FittingSubgroup(G); sage:G.fitting_subgroup() sage_gap:G.FittingSubgroup() oscar:fitting_subgroup(G)
Radical:	$R \simeq$ $C_2\times S_4$	$G/R \simeq$ $\PSL(2,7)$	comment:Radical of the group G magma:Radical(G); gap:SolvableRadical(G); sage_gap:G.SolvableRadical() oscar:solvable_radical(G)
Socle:	$\operatorname{soc} \simeq$ $C_2^3\times \GL(3,2)$	$G/\operatorname{soc} \simeq$ $S_3$	comment:Socle of the group G magma:Socle(G); gap:Socle(G); sage:G.socle() sage_gap:G.Socle() oscar:socle(G)
2-Sylow subgroup:	$P_{ 2 } \simeq$ $C_2\times D_4^2$
3-Sylow subgroup:	$P_{ 3 } \simeq$ $C_3^2$
7-Sylow subgroup:	$P_{ 7 } \simeq$ $C_7$

Subgroup diagram and profile

Series

Derived series

$C_2\times S_4\times \GL(3,2)$

$\rhd$

$A_4\times \GL(3,2)$

$\rhd$

$C_2^2\times \GL(3,2)$

$\rhd$

$\PSL(2,7)$

comment:Derived series of the group G

magma:DerivedSeries(G);

gap:DerivedSeriesOfGroup(G);

sage:G.derived_series()

sage_gap:G.DerivedSeriesOfGroup()

oscar:derived_series(G)

Chief series

$C_2\times S_4\times \GL(3,2)$

$\rhd$

$C_2\times S_4$

$\rhd$

$C_2\times A_4$

$\rhd$

$A_4$

$\rhd$

$C_2^2$

$\rhd$

$C_1$

comment:Chief series of the group G

magma:ChiefSeries(G);

gap:ChiefSeries(G);

sage:libgap(G).ChiefSeries()

sage_gap:G.ChiefSeries()

oscar:chief_series(G)

Lower central series

$C_2\times S_4\times \GL(3,2)$

$\rhd$

$A_4\times \GL(3,2)$

comment:The lower central series of the group G

magma:LowerCentralSeries(G);

gap:LowerCentralSeriesOfGroup(G);

sage:G.lower_central_series()

sage_gap:G.LowerCentralSeriesOfGroup()

oscar:lower_central_series(G)

Upper central series

$C_1$

$\lhd$

$C_2$

comment:The upper central series of the group G

magma:UpperCentralSeries(G);

gap:UpperCentralSeriesOfGroup(G);

sage:G.upper_central_series()

sage_gap:G.UpperCentralSeriesOfGroup()

oscar:upper_central_series(G)

Supergroups

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

This group is a maximal quotient of 9 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

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

Complex character table

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

Rational character table

See the $50 \times 50$ rational character table.

Overview	Random
Universe	Knowledge

Classical	Maass
Hilbert	Bianchi

Elliptic curves over $\Q$ over number fields
Genus 2 curves
Higher genus families
Abelian varieties over $\F_{q}$
Belyi maps

Label	8064.ca
Order	\( 2^{7} \cdot 3^{2} \cdot 7 \)
Exponent	\( 2^{2} \cdot 3 \cdot 7 \)

Nilpotent	no
Solvable	no
$\card{G^{\mathrm{ab}}}$	\( 2^{2} \)
$\card{Z(G)}$	\( 2 \)
$\card{\Aut(G)}$	\( 2^{8} \cdot 3^{2} \cdot 7 \)
$\card{\mathrm{Out}(G)}$	\( 2^{2} \)
Perm deg.	$13$
Trans deg.	$42$
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

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.