/* Group 64.255 downloaded from the LMFDB on 19 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([6, -2, 2, 2, 2, -2, -2, 158, 489, 159, 69, 376, 88]); a,b,c,d := Explode([GPC.1, GPC.2, GPC.3, GPC.4]); AssignNames(~GPC, ["a", "b", "c", "d", "d2", "d4"]);
GPerm := PermutationGroup< 18 | (1,2)(3,9)(4,7)(5,13)(6,11)(8,12)(10,16)(14,15)(17,18), (1,3,4,10)(2,6,7,15)(5,14,12,11)(8,16,13,9)(17,18), (2,7)(6,15)(8,13)(9,16)(17,18), (1,4)(2,7)(3,10)(5,12)(6,15)(8,13)(9,16)(11,14)(17,18), (1,5,4,12)(2,8,7,13)(3,11,10,14)(6,9,15,16), (1,4)(2,7)(3,10)(5,12)(6,15)(8,13)(9,16)(11,14) >;

 
/* Booleans */
RF := recformat< Agroup, Zgroup, abelian, almost_simple, cyclic, metabelian, metacyclic, monomial, nilpotent, perfect, quasisimple, rational, solvable, supersolvable  : BoolElt >; 
booleans_64_255 := 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 := true,
solvable := true,
supersolvable := true>; 

 
/* Character Table */
G:= GPC;
C := SequenceToConjugacyClasses([car<Integers(), Integers(), G> |< 1, 1, Id(G)>,< 2, 1, a>,< 2, 1, a*d^4>,< 2, 1, d^4>,< 2, 2, b>,< 2, 2, a*b>,< 2, 4, c*d>,< 2, 4, a*c*d>,< 4, 2, b*d^2>,< 4, 2, a*d^2>,< 4, 2, a*b*d^2>,< 4, 2, d^2>,< 4, 4, c>,< 4, 4, b*c>,< 4, 4, a*c>,< 4, 4, b*c*d>,< 4, 4, a*b*c>,< 4, 4, a*b*c*d>,< 8, 4, d>,< 8, 4, b*d>,< 8, 4, a*d>,< 8, 4, a*b*d>]); 
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]; 
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]; 
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]; 
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]; 
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]; 
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]; 
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]; 
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]; 
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]; 
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]; 
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]; 
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]; 
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]; 
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]; 
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]; 
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]; 
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, 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, 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, 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, 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, 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, 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; 
_ := CharacterTable(G : Check := 0); 
chartbl_64_255:= KnownIrreducibles(CR);