ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Problem 1. Let G be a finite almost quasisimple group, g \in G r Z(G). (A) Find an explicit, and as small as possible, 0 < \gamma = \gamma(g) < 1, such that |χ(g)| \leq \gamma, \forall χ \in Irr(G) with χ(1) > 1. χ(1) (B) Find an explicit, and as small as possible, 0 < \alpha = \alpha(g) < 1, such that |χ(g)| \leq χ(1)\alpha , \forall χ \in Irr(G). Results on Problem 1 will be useful for a number of applications, which usually involve using Frobenius character formula, and include (i) Ore conjecture [14] and Waring-type problems [11, 12] for finite simple groups (ii) Random generation of simple groups, and representation varieties Hom(Γ, G), where G = Sn , G(F ) for a simple algebraic group G, and Γ a Fuchsian group, see [17], (iii) Random walks on Cayley graphs and McKay graphs [18, 19], (iv) Thompson conjecture [1]: If G is a finite non-abelian simple group, then G = C 2 for some conjugacy class C of G. The most general result on Problem 1(A), which combines results of Gluck [Gl], Gluck and Magaard [5], and Guralnick and the author [9], says that one can take \gamma = 79/80, unless E(G) = An . Our main focus will be on finite classical groups G = Cl(V ), where V = Fnq . For any g \in Cl(V ), the support supp(g) is defined to be. supp(g) = inf codimKer(g − \lambda \cdot 1Ṽ ), \lambda\inFq In this talk, we discuss recent results, obtained in joint work of the speaker with various collaborators, on the following problem: where Ṽ = V ⊗ Fq . A result of Larsen, Shalev, and the author [11] states that, for any classical group G = Cl(V ), any irreducible character 1G 6= χ \in Irr(G), and any g \in G |χ(g)| 1 (1) \leq \sqrt{ } . χ(1) q supp(g)/481

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.