ProbXiv
Explorersign in
Problem archiveProblem record

Statement

What can be said about the limiting behavior of Prob(χ\lambda (µ) = 0)? Example 2. If G = S4 , then 28 4 Prob(χ(g) = 0) = \approx 0.194 and Prob(χ(K) = 0) = = 0.16. 120 25 §1. It turns out that many characters have many zeros. The first result in this direction is for symmetric groups [3, Theorem 1]. Theorem 3. If χ \in Irr(Sn ) and g \in Sn are chosen uniformly at random, then χ(g) = 0 with probability \to 1 as n \to \infty. One of the two proofs given in [3] proceeds by showing that a vanishingly small proportion of classes covers almost all of Sn . The key ingredient here is the following inequality [3, Proposition 3]. Lemma 4. For any finite group G and any collection K \subseteq Cl(G), |{g \in G : g G \in K}| |K| Prob(χ(g) = 0) \geq − . |G| |Cl(G)| Different groups require different tools. The following bound in terms of char- acter degrees and class sizes was established in joint work of P. X. Gallagher, M. J. Larsen, and the speaker [1]. Lemma 5. For each finite group G and each ǫ > 0, |{(χ, g) \in Irr(G) \times G : gcd(χ(1), |g G |) \geq ǫχ(1)}| Prob(χ(g) 6= 0) \leq + ǫ2 . |Irr(G) \times G| Lemma 5 was used in [1] to establish the GL(n, q) analogue of Theorem 3. Theorem 6. For G = GL(n, q), the proportion Pn,q of pairs (χ, g) \in Irr(G) \times G with χ(g) = 0 satisfies inf Pn,q \to 1 as n \to \infty. q

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.