/* Group 128.850 downloaded from the LMFDB on 25 September 2025. */
 
/* Various presentations of this group are stored in this file: 
	 GPC is polycyclic presentation GPerm is permutation group 
	 GLZ, GLFp, GLZA, GLZq, GLFq if they exist are matrix groups 
 
 Many characteristics of the group are stored as booleans in a record: 
	 Agroup, Zgroup, abelian, almost_simple,cyclic, metabelian, 
	 metacyclic, monomial, nilpotent, perfect, quasisimple, rational, 
	 solvable, supersolvable 
 
 The character table is stored as chartbl_n_i where n is the order of 
 the group and i is which group of that order it is. Conjugacy classes 
 are stored in the variable 'C' with elements from the group 'G'. 
*/
 
/* Constructions */
GPC := PCGroup([7, 2, 2, 2, 2, 2, 2, 2, 14, 2019, 346, 2357, 2028, 278, 124, 3926]); a,b,c,d,e := Explode([GPC.1, GPC.3, GPC.4, GPC.5, GPC.6]); AssignNames(~GPC, ["a", "a2", "b", "c", "d", "e", "e2"]);
GPerm := PermutationGroup< 10 | (1,2,3,6)(4,5,7,8), (2,5), (9,10), (2,5)(3,7), (1,3)(2,6)(4,7)(5,8), (2,5)(6,8), (1,4)(2,5)(3,7)(6,8) >;
GLZ := MatrixGroup< 5, Integers() | [[1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, -1], [0, 0, -1, 1, 0, 0, 0, 0, 1, 0, 0, -1, -1, 1, 0, 1, -1, -1, 1, 0, 0, 0, 0, 0, 1], [1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1]] >;
GLFp := MatrixGroup< 5, GF(2) | [[1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1], [0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0], [1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0], [1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0], [1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1], [1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0], [1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1]] >;

 
/* Booleans */
RF := recformat< Agroup, Zgroup, abelian, almost_simple, cyclic, metabelian, metacyclic, monomial, nilpotent, perfect, quasisimple, rational, solvable, supersolvable  : BoolElt >; 
booleans_128_850 := rec< RF |  
Agroup := false,
Zgroup := false,
abelian := false,
almost_simple := false,
cyclic := false,
metabelian := true,
metacyclic := false,
monomial := true,
nilpotent := true,
perfect := false,
quasisimple := false,
rational := false,
solvable := true,
supersolvable := true>; 

 
/* Character Table */
G:= GPerm;
C := SequenceToConjugacyClasses([car<Integers(), Integers(), G> |< 1, 1, Id(G)>,< 2, 1, G!(9,10)>,< 2, 1, G!(1,4)(2,5)(3,7)(6,8)(9,10)>,< 2, 1, G!(1,4)(2,5)(3,7)(6,8)>,< 2, 2, G!(2,5)(6,8)(9,10)>,< 2, 2, G!(2,5)(6,8)>,< 2, 4, G!(6,8)>,< 2, 4, G!(6,8)(9,10)>,< 2, 4, G!(3,7)(6,8)>,< 2, 4, G!(3,7)(6,8)(9,10)>,< 2, 4, G!(2,5)(3,7)(6,8)>,< 2, 4, G!(2,5)(3,7)(6,8)(9,10)>,< 2, 4, G!(1,3)(2,6)(4,7)(5,8)(9,10)>,< 2, 4, G!(1,3)(2,6)(4,7)(5,8)>,< 4, 4, G!(1,3,4,7)(2,6,5,8)(9,10)>,< 4, 4, G!(1,3,4,7)(2,6,5,8)>,< 4, 8, G!(1,3)(2,6,5,8)(4,7)>,< 4, 8, G!(1,3)(2,6,5,8)(4,7)(9,10)>,< 4, 8, G!(1,2,3,6)(4,5,7,8)>,< 4, 8, G!(1,6,3,2)(4,8,7,5)>,< 4, 8, G!(1,2,3,6)(4,5,7,8)(9,10)>,< 4, 8, G!(1,6,3,2)(4,8,7,5)(9,10)>,< 8, 8, G!(1,2,3,6,4,5,7,8)>,< 8, 8, G!(1,6,7,5,4,8,3,2)>,< 8, 8, G!(1,2,3,6,4,5,7,8)(9,10)>,< 8, 8, G!(1,6,7,5,4,8,3,2)(9,10)>]); 
CR := CharacterRing(G);
x := CR!\[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]; 
x`IsCharacter := true;
x`Schur := 1;
x`IsIrreducible := true; 
x := CR!\[1, -1, -1, 1, -1, 1, -1, 1, 1, -1, 1, -1, 1, -1, -1, 1, -1, -1, 1, -1, 1, 1, 1, 1, -1, -1]; 
x`IsCharacter := true;
x`Schur := 1;
x`IsIrreducible := true; 
x := CR!\[1, -1, -1, 1, -1, 1, -1, 1, 1, -1, 1, -1, 1, -1, -1, 1, 1, 1, 1, -1, -1, -1, -1, -1, 1, 1]; 
x`IsCharacter := true;
x`Schur := 1;
x`IsIrreducible := true; 
x := CR!\[1, -1, -1, 1, -1, 1, 1, -1, 1, -1, 1, -1, -1, 1, -1, 1, -1, -1, -1, 1, 1, 1, -1, -1, 1, 1]; 
x`IsCharacter := true;
x`Schur := 1;
x`IsIrreducible := true; 
x := CR!\[1, -1, -1, 1, -1, 1, 1, -1, 1, -1, 1, -1, -1, 1, -1, 1, 1, 1, -1, 1, -1, -1, 1, 1, -1, -1]; 
x`IsCharacter := true;
x`Schur := 1;
x`IsIrreducible := true; 
x := CR!\[1, 1, 1, 1, 1, 1, -1, -1, 1, 1, 1, 1, -1, -1, 1, 1, -1, -1, -1, -1, -1, -1, 1, 1, 1, 1]; 
x`IsCharacter := true;
x`Schur := 1;
x`IsIrreducible := true; 
x := CR!\[1, 1, 1, 1, 1, 1, -1, -1, 1, 1, 1, 1, -1, -1, 1, 1, 1, 1, -1, -1, 1, 1, -1, -1, -1, -1]; 
x`IsCharacter := true;
x`Schur := 1;
x`IsIrreducible := true; 
x := CR!\[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, -1, -1, 1, 1, -1, -1, -1, -1, -1, -1]; 
x`IsCharacter := true;
x`Schur := 1;
x`IsIrreducible := true; 
K := CyclotomicField(4: Sparse := true);
S := [ K |1,-1,-1,1,-1,1,-1,1,1,-1,-1,1,1,-1,1,-1,-1*K.1,K.1,-1,1,K.1,-1*K.1,K.1,-1*K.1,-1*K.1,K.1]; 
x := CR!S; 
x`IsCharacter := true;
x`Schur := 0;
x`IsIrreducible := true; 
K := CyclotomicField(4: Sparse := true);
S := [ K |1,-1,-1,1,-1,1,-1,1,1,-1,-1,1,1,-1,1,-1,K.1,-1*K.1,-1,1,-1*K.1,K.1,-1*K.1,K.1,K.1,-1*K.1]; 
x := CR!S; 
x`IsCharacter := true;
x`Schur := 0;
x`IsIrreducible := true; 
K := CyclotomicField(4: Sparse := true);
S := [ K |1,-1,-1,1,-1,1,1,-1,1,-1,-1,1,-1,1,1,-1,-1*K.1,K.1,1,-1,K.1,-1*K.1,-1*K.1,K.1,K.1,-1*K.1]; 
x := CR!S; 
x`IsCharacter := true;
x`Schur := 0;
x`IsIrreducible := true; 
K := CyclotomicField(4: Sparse := true);
S := [ K |1,-1,-1,1,-1,1,1,-1,1,-1,-1,1,-1,1,1,-1,K.1,-1*K.1,1,-1,-1*K.1,K.1,K.1,-1*K.1,-1*K.1,K.1]; 
x := CR!S; 
x`IsCharacter := true;
x`Schur := 0;
x`IsIrreducible := true; 
K := CyclotomicField(4: Sparse := true);
S := [ K |1,1,1,1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1*K.1,K.1,1,1,-1*K.1,K.1,K.1,-1*K.1,K.1,-1*K.1]; 
x := CR!S; 
x`IsCharacter := true;
x`Schur := 0;
x`IsIrreducible := true; 
K := CyclotomicField(4: Sparse := true);
S := [ K |1,1,1,1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,K.1,-1*K.1,1,1,K.1,-1*K.1,-1*K.1,K.1,-1*K.1,K.1]; 
x := CR!S; 
x`IsCharacter := true;
x`Schur := 0;
x`IsIrreducible := true; 
K := CyclotomicField(4: Sparse := true);
S := [ K |1,1,1,1,1,1,1,1,1,1,-1,-1,1,1,-1,-1,-1*K.1,K.1,-1,-1,-1*K.1,K.1,-1*K.1,K.1,-1*K.1,K.1]; 
x := CR!S; 
x`IsCharacter := true;
x`Schur := 0;
x`IsIrreducible := true; 
K := CyclotomicField(4: Sparse := true);
S := [ K |1,1,1,1,1,1,1,1,1,1,-1,-1,1,1,-1,-1,K.1,-1*K.1,-1,-1,K.1,-1*K.1,K.1,-1*K.1,K.1,-1*K.1]; 
x := CR!S; 
x`IsCharacter := true;
x`Schur := 0;
x`IsIrreducible := true; 
x := CR!\[2, -2, -2, 2, -2, 2, 0, 0, -2, 2, -2, 2, 0, 0, -2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]; 
x`IsCharacter := true;
x`Schur := 1;
x`IsIrreducible := true; 
x := CR!\[2, -2, -2, 2, -2, 2, 0, 0, -2, 2, 2, -2, 0, 0, 2, -2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]; 
x`IsCharacter := true;
x`Schur := 1;
x`IsIrreducible := true; 
x := CR!\[2, 2, 2, 2, 2, 2, 0, 0, -2, -2, -2, -2, 0, 0, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]; 
x`IsCharacter := true;
x`Schur := 1;
x`IsIrreducible := true; 
x := CR!\[2, 2, 2, 2, 2, 2, 0, 0, -2, -2, 2, 2, 0, 0, -2, -2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]; 
x`IsCharacter := true;
x`Schur := 1;
x`IsIrreducible := true; 
x := CR!\[4, -4, -4, 4, 4, -4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]; 
x`IsCharacter := true;
x`Schur := 1;
x`IsIrreducible := true; 
x := CR!\[4, 4, 4, 4, -4, -4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]; 
x`IsCharacter := true;
x`Schur := 1;
x`IsIrreducible := true; 
x := CR!\[4, -4, 4, -4, 0, 0, -2, 2, 0, 0, 0, 0, -2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]; 
x`IsCharacter := true;
x`Schur := 1;
x`IsIrreducible := true; 
x := CR!\[4, -4, 4, -4, 0, 0, 2, -2, 0, 0, 0, 0, 2, -2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]; 
x`IsCharacter := true;
x`Schur := 1;
x`IsIrreducible := true; 
x := CR!\[4, 4, -4, -4, 0, 0, -2, -2, 0, 0, 0, 0, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]; 
x`IsCharacter := true;
x`Schur := 1;
x`IsIrreducible := true; 
x := CR!\[4, 4, -4, -4, 0, 0, 2, 2, 0, 0, 0, 0, -2, -2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]; 
x`IsCharacter := true;
x`Schur := 1;
x`IsIrreducible := true; 
_ := CharacterTable(G : Check := 0); 
chartbl_128_850:= KnownIrreducibles(CR);