A finite group G is called almost quasisisimple if S ⊳ G/Z(G) \leq Aut(S) for some finite non-abelian simple group G.
Statement
A finite group G is called almost quasisisimple if S ⊳ G/Z(G) \leq Aut(S) for some finite non-abelian simple group G. An important problem in complex representa- tion theory of finite almost quasisimple groups is the following Problem 1. Let G be a finite almost quasisimple group, g \in G \ Z(G). Find an explicit, and as small as possible, 0 \leq \alpha = \alpha(g) < 1, such that |χ(g)| \leq χ(1)\alpha , \forall χ \in Irr(G). Results on Problem 1 have proved to be useful in a number of applications, which usually involve using Frobenius character formula. Recently, building on [2, 4, 5, 8], we have proved the following uniform exponential character bound, which works for all elements in all finite quasisimple groups of Lie type: Theorem 2. [6] There exists an explicit constant c > 0 such that for all finite quasisimple groups G of Lie type, all χ \in Irr(G), and all g \in G, we have log |gG | |χ(g)| \leq χ(1)1−c log |G| . Our main focus will be on finite classical groups G = Cl(V ) = Cln (q), 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 Character Estimates for Finite Classical Groups and Thompson’s Conjecture Pham Huu Tiep (joint work with Michael Larsen) where Ṽ = V ⊗ Fq . Note that the ratios supp(g)/n and (log |g G |)/(log |G|) are of the same magnitude for all g \in G = Cln (q). Recall that the notion of level of an irreducible character χ of a finite classical group G = Cln (q) was introduced in [4, 5]. Our next result gives a sharp estimate for the character ratio χ(g)/χ(1) when both the level of χ and the support of g are not large compared to n: Theorem 3. [7] Let n, m, j \in Z\geq1 , q any prime power, and let \varepsilon = \pm. Suppose that n \geq 8j 2 + 4j + 4mj + 3 and χ is an irreducible complex character of G, where either G = GLn (q), GUn (q), or 2 6 |q and G = SO\varepsilonn (q) of level j. Then there exists some root of unity \beta \in C such that when g \in G has support m, we have q mj χ(g) − \beta < q −n/4 . χ(1) As an application of Theorems 2 and 3, we prove the asymptotic version of Thompson’s Conjecture, which asserts that every finite non-abelian simple group G contains a conjugacy class C \subset G such that C 2 = G. According to a private communication by Khukhro, the conjecture first appeared in Kourovka’s Notebook
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.