/* Group 100.13 downloaded from the LMFDB on 07 June 2026. */
 
/* 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([4, -2, -2, -5, -5, 145, 21, 194, 647]); a,b,c := Explode([GPC.1, GPC.2, GPC.4]); AssignNames(~GPC, ["a", "b", "b2", "c"]);
GPerm := PermutationGroup< 10 | (1,6)(2,10)(3,9)(4,8)(5,7), (1,6)(2,7)(3,8)(4,9)(5,10), (1,2,3,4,5)(6,10,9,8,7), (1,5,4,3,2)(6,10,9,8,7) >;
GLFp := MatrixGroup< 3, GF(5) | [[2, 0, 4, 2, 1, 3, 1, 0, 0], [4, 1, 0, 4, 1, 1, 0, 1, 4], [3, 1, 1, 3, 1, 2, 4, 1, 0], [1, 0, 0, 0, 1, 0, 2, 0, 4]] >;

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

 
/* Character Table */
G:= GPC;
C := SequenceToConjugacyClasses([car<Integers(), Integers(), G> |< 1, 1, Id(G)>,< 2, 5, b^5>,< 2, 5, a>,< 2, 25, a*b^9*c>,< 5, 2, b^2>,< 5, 2, b^4>,< 5, 2, c^2>,< 5, 2, c^4>,< 5, 4, b^2*c>,< 5, 4, b^4*c^2>,< 5, 4, b^2*c^2>,< 5, 4, b^4*c>,< 10, 10, b>,< 10, 10, b^3>,< 10, 10, a*c>,< 10, 10, a*c^2>]); 
CR := CharacterRing(G);
x := CR!\[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]; 
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]; 
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]; 
x`IsCharacter := true;
x`Schur := 1;
x`IsIrreducible := true; 
K := CyclotomicField(5: Sparse := true);
S := [ K |2,0,2,0,2,2,K.1^2+K.1^-2,K.1+K.1^-1,K.1+K.1^-1,K.1+K.1^-1,K.1^2+K.1^-2,K.1^2+K.1^-2,K.1+K.1^-1,K.1^2+K.1^-2,0,0]; 
x := CR!S; 
x`IsCharacter := true;
x`Schur := 1;
x`IsIrreducible := true; 
K := CyclotomicField(5: Sparse := true);
S := [ K |2,0,2,0,2,2,K.1+K.1^-1,K.1^2+K.1^-2,K.1^2+K.1^-2,K.1^2+K.1^-2,K.1+K.1^-1,K.1+K.1^-1,K.1^2+K.1^-2,K.1+K.1^-1,0,0]; 
x := CR!S; 
x`IsCharacter := true;
x`Schur := 1;
x`IsIrreducible := true; 
K := CyclotomicField(5: Sparse := true);
S := [ K |2,2,0,0,K.1^2+K.1^-2,K.1+K.1^-1,2,2,K.1^2+K.1^-2,K.1+K.1^-1,K.1+K.1^-1,K.1^2+K.1^-2,0,0,K.1+K.1^-1,K.1^2+K.1^-2]; 
x := CR!S; 
x`IsCharacter := true;
x`Schur := 1;
x`IsIrreducible := true; 
K := CyclotomicField(5: Sparse := true);
S := [ K |2,2,0,0,K.1+K.1^-1,K.1^2+K.1^-2,2,2,K.1+K.1^-1,K.1^2+K.1^-2,K.1^2+K.1^-2,K.1+K.1^-1,0,0,K.1^2+K.1^-2,K.1+K.1^-1]; 
x := CR!S; 
x`IsCharacter := true;
x`Schur := 1;
x`IsIrreducible := true; 
K := CyclotomicField(5: Sparse := true);
S := [ K |2,-2,0,0,K.1^2+K.1^-2,K.1+K.1^-1,2,2,K.1^2+K.1^-2,K.1+K.1^-1,K.1+K.1^-1,K.1^2+K.1^-2,0,0,-1*K.1-K.1^-1,-1*K.1^2-K.1^-2]; 
x := CR!S; 
x`IsCharacter := true;
x`Schur := 1;
x`IsIrreducible := true; 
K := CyclotomicField(5: Sparse := true);
S := [ K |2,-2,0,0,K.1+K.1^-1,K.1^2+K.1^-2,2,2,K.1+K.1^-1,K.1^2+K.1^-2,K.1^2+K.1^-2,K.1+K.1^-1,0,0,-1*K.1^2-K.1^-2,-1*K.1-K.1^-1]; 
x := CR!S; 
x`IsCharacter := true;
x`Schur := 1;
x`IsIrreducible := true; 
K := CyclotomicField(5: Sparse := true);
S := [ K |2,0,-2,0,2,2,K.1^2+K.1^-2,K.1+K.1^-1,K.1+K.1^-1,K.1+K.1^-1,K.1^2+K.1^-2,K.1^2+K.1^-2,-1*K.1-K.1^-1,-1*K.1^2-K.1^-2,0,0]; 
x := CR!S; 
x`IsCharacter := true;
x`Schur := 1;
x`IsIrreducible := true; 
K := CyclotomicField(5: Sparse := true);
S := [ K |2,0,-2,0,2,2,K.1+K.1^-1,K.1^2+K.1^-2,K.1^2+K.1^-2,K.1^2+K.1^-2,K.1+K.1^-1,K.1+K.1^-1,-1*K.1^2-K.1^-2,-1*K.1-K.1^-1,0,0]; 
x := CR!S; 
x`IsCharacter := true;
x`Schur := 1;
x`IsIrreducible := true; 
K := CyclotomicField(5: Sparse := true);
S := [ K |4,0,0,0,2*K.1^2+2*K.1^-2,2*K.1+2*K.1^-1,2*K.1^2+2*K.1^-2,2*K.1+2*K.1^-1,-1,2+K.1^2+K.1^-2,-1,1-K.1^2-K.1^-2,0,0,0,0]; 
x := CR!S; 
x`IsCharacter := true;
x`Schur := 1;
x`IsIrreducible := true; 
K := CyclotomicField(5: Sparse := true);
S := [ K |4,0,0,0,2*K.1+2*K.1^-1,2*K.1^2+2*K.1^-2,2*K.1+2*K.1^-1,2*K.1^2+2*K.1^-2,-1,1-K.1^2-K.1^-2,-1,2+K.1^2+K.1^-2,0,0,0,0]; 
x := CR!S; 
x`IsCharacter := true;
x`Schur := 1;
x`IsIrreducible := true; 
K := CyclotomicField(5: Sparse := true);
S := [ K |4,0,0,0,2*K.1^2+2*K.1^-2,2*K.1+2*K.1^-1,2*K.1+2*K.1^-1,2*K.1^2+2*K.1^-2,1-K.1^2-K.1^-2,-1,2+K.1^2+K.1^-2,-1,0,0,0,0]; 
x := CR!S; 
x`IsCharacter := true;
x`Schur := 1;
x`IsIrreducible := true; 
K := CyclotomicField(5: Sparse := true);
S := [ K |4,0,0,0,2*K.1+2*K.1^-1,2*K.1^2+2*K.1^-2,2*K.1^2+2*K.1^-2,2*K.1+2*K.1^-1,2+K.1^2+K.1^-2,-1,1-K.1^2-K.1^-2,-1,0,0,0,0]; 
x := CR!S; 
x`IsCharacter := true;
x`Schur := 1;
x`IsIrreducible := true; 
_ := CharacterTable(G : Check := 0); 
chartbl_100_13:= KnownIrreducibles(CR);