Properties

Label 2519424.jy
Order \( 2^{7} \cdot 3^{9} \)
Exponent \( 2^{3} \cdot 3^{2} \)
Nilpotent no
Solvable yes
$\card{G^{\mathrm{ab}}}$ \( 2^{3} \cdot 3 \)
$\card{Z(G)}$ \( 1 \)
$\card{\Aut(G)}$ \( 2^{8} \cdot 3^{9} \)
$\card{\mathrm{Out}(G)}$ \( 2 \)
Perm deg. $36$
Trans deg. $36$
Rank $3$

Related objects

Downloads

Learn more

Show commands: Gap / Magma / Oscar / SageMath

Copy content comment:Construction of abstract group
 
Copy content magma:G := PermutationGroup< 36 | (1,3)(4,11,17,23,29,36,6,10,16,22,28,35,5,12,18,24,30,34)(7,20,33,9,19,32,8,21,31)(13,25)(14,27)(15,26), (1,30,20,36,3,29,21,34)(2,28,19,35)(4,7,23,13,17,31,11,25)(5,9,22,15,16,32,12,26)(6,8,24,14,18,33,10,27), (1,34,9,30,15,23,19,16,26,11,31,5,2,35,8,28,13,24,21,17,27,12,33,6,3,36,7,29,14,22,20,18,25,10,32,4) >;
 
Copy content gap:G := Group( (1,3)(4,11,17,23,29,36,6,10,16,22,28,35,5,12,18,24,30,34)(7,20,33,9,19,32,8,21,31)(13,25)(14,27)(15,26), (1,30,20,36,3,29,21,34)(2,28,19,35)(4,7,23,13,17,31,11,25)(5,9,22,15,16,32,12,26)(6,8,24,14,18,33,10,27), (1,34,9,30,15,23,19,16,26,11,31,5,2,35,8,28,13,24,21,17,27,12,33,6,3,36,7,29,14,22,20,18,25,10,32,4) );
 
Copy content sage:G = PermutationGroup(['(1,3)(4,11,17,23,29,36,6,10,16,22,28,35,5,12,18,24,30,34)(7,20,33,9,19,32,8,21,31)(13,25)(14,27)(15,26)', '(1,30,20,36,3,29,21,34)(2,28,19,35)(4,7,23,13,17,31,11,25)(5,9,22,15,16,32,12,26)(6,8,24,14,18,33,10,27)', '(1,34,9,30,15,23,19,16,26,11,31,5,2,35,8,28,13,24,21,17,27,12,33,6,3,36,7,29,14,22,20,18,25,10,32,4)'])
 
Copy content sage_gap:G = gap.new('Group( (1,3)(4,11,17,23,29,36,6,10,16,22,28,35,5,12,18,24,30,34)(7,20,33,9,19,32,8,21,31)(13,25)(14,27)(15,26), (1,30,20,36,3,29,21,34)(2,28,19,35)(4,7,23,13,17,31,11,25)(5,9,22,15,16,32,12,26)(6,8,24,14,18,33,10,27), (1,34,9,30,15,23,19,16,26,11,31,5,2,35,8,28,13,24,21,17,27,12,33,6,3,36,7,29,14,22,20,18,25,10,32,4) )')
 
Copy content oscar:G = @permutation_group(36, (1,3)(4,11,17,23,29,36,6,10,16,22,28,35,5,12,18,24,30,34)(7,20,33,9,19,32,8,21,31)(13,25)(14,27)(15,26), (1,30,20,36,3,29,21,34)(2,28,19,35)(4,7,23,13,17,31,11,25)(5,9,22,15,16,32,12,26)(6,8,24,14,18,33,10,27), (1,34,9,30,15,23,19,16,26,11,31,5,2,35,8,28,13,24,21,17,27,12,33,6,3,36,7,29,14,22,20,18,25,10,32,4))
 

Group information

Description:$D_9\wr C_4.C_6$
Order: \(2519424\)\(\medspace = 2^{7} \cdot 3^{9} \)
Copy content comment:Order of the group
 
Copy content magma:Order(G);
 
Copy content gap:Order(G);
 
Copy content sage:G.order()
 
Copy content sage_gap:G.Order()
 
Copy content oscar:order(G)
 
Exponent: \(72\)\(\medspace = 2^{3} \cdot 3^{2} \)
Copy content comment:Exponent of the group
 
Copy content magma:Exponent(G);
 
Copy content gap:Exponent(G);
 
Copy content sage:G.exponent()
 
Copy content sage_gap:G.Exponent()
 
Copy content oscar:exponent(G)
 
Automorphism group:$C_9^4.C_4:D_4.C_6.C_2^2$, of order \(5038848\)\(\medspace = 2^{8} \cdot 3^{9} \)
Copy content comment:Automorphism group
 
Copy content gap:AutomorphismGroup(G);
 
Copy content magma:AutomorphismGroup(G);
 
Copy content sage:libgap(G).AutomorphismGroup()
 
Copy content sage_gap:G.AutomorphismGroup()
 
Copy content oscar:automorphism_group(G)
 
Composition factors:$C_2$ x 7, $C_3$ x 9
Copy content comment:Composition factors of the group
 
Copy content magma:CompositionFactors(G);
 
Copy content gap:CompositionSeries(G);
 
Copy content sage:G.composition_series()
 
Copy content sage_gap:G.CompositionSeries()
 
Copy content oscar:composition_series(G)
 
Derived length:$4$
Copy content comment:Derived length of the group
 
Copy content magma:DerivedLength(G);
 
Copy content gap:DerivedLength(G);
 
Copy content sage:libgap(G).DerivedLength()
 
Copy content sage_gap:G.DerivedLength()
 
Copy content oscar:derived_length(G)
 

This group is nonabelian and solvable. Whether it is monomial has not been computed.

Copy content comment:Determine if the group G is abelian
 
Copy content magma:IsAbelian(G);
 
Copy content gap:IsAbelian(G);
 
Copy content sage:G.is_abelian()
 
Copy content sage_gap:G.IsAbelian()
 
Copy content oscar:is_abelian(G)
 
Copy content comment:Determine if the group G is cyclic
 
Copy content magma:IsCyclic(G);
 
Copy content gap:IsCyclic(G);
 
Copy content sage:G.is_cyclic()
 
Copy content sage_gap:G.IsCyclic()
 
Copy content oscar:is_cyclic(G)
 
Copy content comment:Determine if the group G is nilpotent
 
Copy content magma:IsNilpotent(G);
 
Copy content gap:IsNilpotentGroup(G);
 
Copy content sage:G.is_nilpotent()
 
Copy content sage_gap:G.IsNilpotentGroup()
 
Copy content oscar:is_nilpotent(G)
 
Copy content comment:Determine if the group G is solvable
 
Copy content magma:IsSolvable(G);
 
Copy content gap:IsSolvableGroup(G);
 
Copy content sage:G.is_solvable()
 
Copy content sage_gap:G.IsSolvableGroup()
 
Copy content oscar:is_solvable(G)
 
Copy content comment:Determine if the group G is supersolvable
 
Copy content gap:IsSupersolvableGroup(G);
 
Copy content sage:G.is_supersolvable()
 
Copy content sage_gap:G.IsSupersolvableGroup()
 
Copy content oscar:is_supersolvable(G)
 
Copy content comment:Determine if the group G is simple
 
Copy content magma:IsSimple(G);
 
Copy content gap:IsSimpleGroup(G);
 
Copy content sage:G.is_simple()
 
Copy content sage_gap:G.IsSimpleGroup()
 
Copy content oscar:is_simple(G)
 

Group statistics

Copy content comment:Compute statistics for the group G
 
Copy content 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;
 
Copy content 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");
 
Copy content 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))
 
Copy content 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))
 
Copy content 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 8 9 12 18 24 36
Elements 1 14571 242 140292 120294 104976 19440 498312 711504 209952 699840 2519424
Conjugacy classes   1 10 7 8 43 1 48 22 117 2 20 279
Divisions 1 10 6 8 33 1 43 14 94 1 14 225
Autjugacy classes 1 7 5 6 26 1 26 15 60 2 10 159

Copy content comment:Compute statistics about the characters of G
 
Copy content 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);
 
Copy content 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);
 
Copy content 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)]
 
Copy content 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()
 
Copy content oscar:# Outputs an MSet containing the absolutely irreducible degrees of G and their multiplicities. character_degrees(G)
 

Dimension 1 2 4 8 16 24 32 48 64 96 192 384
Irr. complex chars.   24 18 18 48 36 16 18 20 0 40 36 5 279
Irr. rational chars. 8 14 12 22 28 16 18 20 6 40 36 5 225

Minimal presentations

Permutation degree:$36$
Transitive degree:$36$
Rank: $3$
Inequivalent generating triples: not computed

Minimal degrees of faithful linear representations

Over $\mathbb{C}$ Over $\mathbb{R}$ Over $\mathbb{Q}$
Irreducible 24 24 24
Arbitrary not computed not computed not computed

Constructions

Show commands: Gap / Magma / Oscar / SageMath


Presentation: ${\langle a, b, c, d, e, f, g \mid c^{4}=d^{36}=e^{9}=f^{9}=g^{9}=[d,f]=[e,f]= \!\cdots\! \rangle}$ Copy content Toggle raw display
Copy content comment:Define the group with the given generators and relations
 
Copy content magma:G := PCGroup([16, 2, 3, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 32, 15298577, 85978082, 40605858, 130, 105742083, 41865619, 9572403, 183603844, 17910740, 2573156, 699412, 228, 51724805, 79370517, 351013, 14349749, 68264454, 17165590, 99942, 16783030, 8157702, 705462, 326, 47652871, 90550295, 29103143, 23136311, 3753031, 2266711, 375, 18137096, 193560, 33841192, 1129016, 1497672, 9304, 568, 15114249, 44789801, 30777, 1259593, 7769, 2433034, 2128922, 1869866, 8262202, 14572874, 101466, 1032874, 25466, 698, 6008875, 27039803, 6884427, 83035, 3380075, 20859, 32348172, 22643740, 958508, 3807292, 1903692, 1078364, 828, 41803789, 774189, 1784893, 892493, 871005, 268738574, 235146270, 3840046, 44789822, 2833998, 11197534, 5667950, 2799486, 958, 49199, 35831871, 9068623, 8958047, 4534383, 2239615]); a,b,c,d,e,f,g := Explode([G.1, G.3, G.5, G.7, G.11, G.13, G.15]); AssignNames(~G, ["a", "a2", "b", "b2", "c", "c2", "d", "d2", "d4", "d12", "e", "e3", "f", "f3", "g", "g3"]);
 
Copy content gap:G := PcGroupCode(14616258849775555889612784225005241904406343033464558836889518884280220249924141201007463543020229859211716074287863491684399372800755412322317738298811354383239124953424249889998928479417904019905842139732823622155759161839796594744838736844979052625439943668920745473635096649358738417010538874104385160565220601581520439017052544925370208446623025834185530886614012291554213258666672532710472672553654724407806655412747345694010804243994231806718502636079185088893318191659411991338689235914602098997459560909691660897782956949483053777332484080895408210355958332270566458020282623,2519424); a := G.1; b := G.3; c := G.5; d := G.7; e := G.11; f := G.13; g := G.15;
 
Copy content sage:# This uses Sage's interface to GAP, as Sage (currently) has no native support for PC groups G = gap.new('PcGroupCode(14616258849775555889612784225005241904406343033464558836889518884280220249924141201007463543020229859211716074287863491684399372800755412322317738298811354383239124953424249889998928479417904019905842139732823622155759161839796594744838736844979052625439943668920745473635096649358738417010538874104385160565220601581520439017052544925370208446623025834185530886614012291554213258666672532710472672553654724407806655412747345694010804243994231806718502636079185088893318191659411991338689235914602098997459560909691660897782956949483053777332484080895408210355958332270566458020282623,2519424)'); a = G.1; b = G.3; c = G.5; d = G.7; e = G.11; f = G.13; g = G.15;
 
Copy content sage_gap:# This uses Sage's interface to GAP, as Sage (currently) has no native support for PC groups G = gap.new('PcGroupCode(14616258849775555889612784225005241904406343033464558836889518884280220249924141201007463543020229859211716074287863491684399372800755412322317738298811354383239124953424249889998928479417904019905842139732823622155759161839796594744838736844979052625439943668920745473635096649358738417010538874104385160565220601581520439017052544925370208446623025834185530886614012291554213258666672532710472672553654724407806655412747345694010804243994231806718502636079185088893318191659411991338689235914602098997459560909691660897782956949483053777332484080895408210355958332270566458020282623,2519424)'); a = G.1; b = G.3; c = G.5; d = G.7; e = G.11; f = G.13; g = G.15;
 
Permutation group:Degree $36$ $\langle(1,3)(4,11,17,23,29,36,6,10,16,22,28,35,5,12,18,24,30,34)(7,20,33,9,19,32,8,21,31) \!\cdots\! \rangle$ Copy content Toggle raw display
Copy content comment:Define the group as a permutation group
 
Copy content magma:G := PermutationGroup< 36 | (1,3)(4,11,17,23,29,36,6,10,16,22,28,35,5,12,18,24,30,34)(7,20,33,9,19,32,8,21,31)(13,25)(14,27)(15,26), (1,30,20,36,3,29,21,34)(2,28,19,35)(4,7,23,13,17,31,11,25)(5,9,22,15,16,32,12,26)(6,8,24,14,18,33,10,27), (1,34,9,30,15,23,19,16,26,11,31,5,2,35,8,28,13,24,21,17,27,12,33,6,3,36,7,29,14,22,20,18,25,10,32,4) >;
 
Copy content gap:G := Group( (1,3)(4,11,17,23,29,36,6,10,16,22,28,35,5,12,18,24,30,34)(7,20,33,9,19,32,8,21,31)(13,25)(14,27)(15,26), (1,30,20,36,3,29,21,34)(2,28,19,35)(4,7,23,13,17,31,11,25)(5,9,22,15,16,32,12,26)(6,8,24,14,18,33,10,27), (1,34,9,30,15,23,19,16,26,11,31,5,2,35,8,28,13,24,21,17,27,12,33,6,3,36,7,29,14,22,20,18,25,10,32,4) );
 
Copy content sage:G = PermutationGroup(['(1,3)(4,11,17,23,29,36,6,10,16,22,28,35,5,12,18,24,30,34)(7,20,33,9,19,32,8,21,31)(13,25)(14,27)(15,26)', '(1,30,20,36,3,29,21,34)(2,28,19,35)(4,7,23,13,17,31,11,25)(5,9,22,15,16,32,12,26)(6,8,24,14,18,33,10,27)', '(1,34,9,30,15,23,19,16,26,11,31,5,2,35,8,28,13,24,21,17,27,12,33,6,3,36,7,29,14,22,20,18,25,10,32,4)'])
 
Copy content sage_gap:G = gap.new('Group( (1,3)(4,11,17,23,29,36,6,10,16,22,28,35,5,12,18,24,30,34)(7,20,33,9,19,32,8,21,31)(13,25)(14,27)(15,26), (1,30,20,36,3,29,21,34)(2,28,19,35)(4,7,23,13,17,31,11,25)(5,9,22,15,16,32,12,26)(6,8,24,14,18,33,10,27), (1,34,9,30,15,23,19,16,26,11,31,5,2,35,8,28,13,24,21,17,27,12,33,6,3,36,7,29,14,22,20,18,25,10,32,4) )')
 
Copy content oscar:G = @permutation_group(36, (1,3)(4,11,17,23,29,36,6,10,16,22,28,35,5,12,18,24,30,34)(7,20,33,9,19,32,8,21,31)(13,25)(14,27)(15,26), (1,30,20,36,3,29,21,34)(2,28,19,35)(4,7,23,13,17,31,11,25)(5,9,22,15,16,32,12,26)(6,8,24,14,18,33,10,27), (1,34,9,30,15,23,19,16,26,11,31,5,2,35,8,28,13,24,21,17,27,12,33,6,3,36,7,29,14,22,20,18,25,10,32,4))
 
Transitive group: 36T46117 more information
Copy content magma:G := TransitiveGroup(36, 46117);
 
Copy content gap:G := TransitiveGroup(36, 46117);
 
Copy content sage:G = TransitiveGroup(36, 46117)
 
Copy content sage_gap:G = libgap.TransitiveGroup(36, 46117)
 
Copy content oscar:G = transitive_group(36, 46117)
 
Direct product: not isomorphic to a non-trivial direct product
Semidirect product: not computed
Trans. wreath product: not isomorphic to a non-trivial transitive wreath product
Possibly split product: $(D_9\wr D_4)$ . $C_3$ $(D_9\wr C_4)$ . $C_6$ $C_3^5$ . $(S_3\wr D_4)$ $(D_9\wr C_2^2)$ . $C_6$ all 40
Aut. group: $\Aut(C_9^4.C_2^2.D_4)$ $\Aut(D_9\wr C_4)$ $\Aut(C_9:D_9^3.C_{12})$ $\Aut(D_9\wr C_4.C_3)$

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

Homology

Abelianization: $C_{2}^{2} \times C_{6} \simeq C_{2}^{3} \times C_{3}$
Copy content comment:The abelianization of the group
 
Copy content magma:quo< G | CommutatorSubgroup(G) >;
 
Copy content gap:FactorGroup(G, DerivedSubgroup(G));
 
Copy content sage:G.quotient(G.commutator())
 
Copy content sage_gap:G.FactorGroup(G.DerivedSubgroup())
 
Copy content oscar:quo(G, derived_subgroup(G)[1])
 
Schur multiplier: not computed
Copy content comment:The Schur multiplier of the group
 
Copy content gap:AbelianInvariantsMultiplier(G);
 
Copy content sage:G.homology(2)
 
Copy content sage_gap:G.AbelianInvariantsMultiplier()
 
Commutator length: $1$
Copy content comment:The commutator length of the group
 
Copy content gap:CommutatorLength(G);
 
Copy content sage_gap:G.CommutatorLength()
 

Subgroups

Copy content comment:List of subgroups of the group
 
Copy content magma:Subgroups(G);
 
Copy content gap:AllSubgroups(G);
 
Copy content sage:G.subgroups()
 
Copy content sage_gap:G.AllSubgroups()
 
Copy content oscar:subgroups(G)
 

There are 59 normal subgroups (31 characteristic).

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

Special subgroups

Center: $Z \simeq$ $C_1$ $G/Z \simeq$ $D_9\wr C_4.C_6$
Copy content comment:Center of the group
 
Copy content magma:Center(G);
 
Copy content gap:Center(G);
 
Copy content sage:G.center()
 
Copy content sage_gap:G.Center()
 
Copy content oscar:center(G)
 
Commutator: $G' \simeq$ $C_9^4:(C_2\times D_4)$ $G/G' \simeq$ $C_2^2\times C_6$
Copy content comment:Commutator subgroup of the group G
 
Copy content magma:CommutatorSubgroup(G);
 
Copy content gap:DerivedSubgroup(G);
 
Copy content sage:G.commutator()
 
Copy content sage_gap:G.DerivedSubgroup()
 
Copy content oscar:derived_subgroup(G)
 
Frattini: $\Phi \simeq$ $C_3^4$ $G/\Phi \simeq$ $C_3\times S_3\wr D_4$
Copy content comment:Frattini subgroup of the group G
 
Copy content magma:FrattiniSubgroup(G);
 
Copy content gap:FrattiniSubgroup(G);
 
Copy content sage:G.frattini_subgroup()
 
Copy content sage_gap:G.FrattiniSubgroup()
 
Copy content oscar:frattini_subgroup(G)
 
Fitting: $\operatorname{Fit} \simeq$ $C_9^4.C_3$ $G/\operatorname{Fit} \simeq$ $C_2\wr D_4$
Copy content comment:Fitting subgroup of the group G
 
Copy content magma:FittingSubgroup(G);
 
Copy content gap:FittingSubgroup(G);
 
Copy content sage:G.fitting_subgroup()
 
Copy content sage_gap:G.FittingSubgroup()
 
Copy content oscar:fitting_subgroup(G)
 
Radical: $R \simeq$ $D_9\wr C_4.C_6$ $G/R \simeq$ $C_1$
Copy content comment:Radical of the group G
 
Copy content magma:Radical(G);
 
Copy content gap:SolvableRadical(G);
 
Copy content sage_gap:G.SolvableRadical()
 
Copy content oscar:solvable_radical(G)
 
Socle: $\operatorname{soc} \simeq$ $C_3^4$ $G/\operatorname{soc} \simeq$ $C_3\times S_3\wr D_4$
Copy content comment:Socle of the group G
 
Copy content magma:Socle(G);
 
Copy content gap:Socle(G);
 
Copy content sage:G.socle()
 
Copy content sage_gap:G.Socle()
 
Copy content oscar:socle(G)
 
2-Sylow subgroup: $P_{ 2 } \simeq$ $C_2\wr D_4$
3-Sylow subgroup: $P_{ 3 } \simeq$ $C_9^4.C_3$

Subgroup diagram and profile

Series

Derived series $D_9\wr C_4.C_6$ $\rhd$ $C_9^4:(C_2\times D_4)$ $\rhd$ $C_9^4.C_2$ $\rhd$ $C_9^4$ $\rhd$ $C_1$
Copy content comment:Derived series of the group G
 
Copy content magma:DerivedSeries(G);
 
Copy content gap:DerivedSeriesOfGroup(G);
 
Copy content sage:G.derived_series()
 
Copy content sage_gap:G.DerivedSeriesOfGroup()
 
Copy content oscar:derived_series(G)
 
Chief series $D_9\wr C_4.C_6$ $\rhd$ $D_9\wr C_4.C_3$ $\rhd$ $D_9^2\wr C_2.C_3$ $\rhd$ $C_9^4.(C_6\times D_4)$ $\rhd$ $C_9^4:(C_2\times D_4)$ $\rhd$ $C_9:D_9^3$ $\rhd$ $C_9^4.C_2^2$ $\rhd$ $C_9^4.C_2$ $\rhd$ $C_9^4$ $\rhd$ $C_3^4$ $\rhd$ $C_1$
Copy content comment:Chief series of the group G
 
Copy content magma:ChiefSeries(G);
 
Copy content gap:ChiefSeries(G);
 
Copy content sage:libgap(G).ChiefSeries()
 
Copy content sage_gap:G.ChiefSeries()
 
Copy content oscar:chief_series(G)
 
Lower central series $D_9\wr C_4.C_6$ $\rhd$ $C_9^4:(C_2\times D_4)$ $\rhd$ $C_9^4.C_2^2$ $\rhd$ $C_9^4.C_2$ $\rhd$ $C_9^4$
Copy content comment:The lower central series of the group G
 
Copy content magma:LowerCentralSeries(G);
 
Copy content gap:LowerCentralSeriesOfGroup(G);
 
Copy content sage:G.lower_central_series()
 
Copy content sage_gap:G.LowerCentralSeriesOfGroup()
 
Copy content oscar:lower_central_series(G)
 
Upper central series $C_1$
Copy content comment:The upper central series of the group G
 
Copy content magma:UpperCentralSeries(G);
 
Copy content gap:UpperCentralSeriesOfGroup(G);
 
Copy content sage:G.upper_central_series()
 
Copy content sage_gap:G.UpperCentralSeriesOfGroup()
 
Copy content oscar:upper_central_series(G)
 

Supergroups

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

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

Character theory

Copy content comment:Character table
 
Copy content magma:CharacterTable(G); // Output not guaranteed to exactly match the LMFDB table
 
Copy content gap:CharacterTable(G); # Output not guaranteed to exactly match the LMFDB table
 
Copy content sage:G.character_table() # Output not guaranteed to exactly match the LMFDB table
 
Copy content sage_gap:G.CharacterTable() # Output not guaranteed to exactly match the LMFDB table
 
Copy content oscar:character_table(G) # Output not guaranteed to exactly match the LMFDB table
 

Complex character table

See the $279 \times 279$ character table (warning: may be slow to load). Alternatively, you may search for characters of this group with desired properties.

Rational character table

See the $225 \times 225$ rational character table (warning: may be slow to load).