Why would dim primitive irrep divide size of some conjugacy class ? - MathOverflow most recent 30 from http://mathoverflow.net 2013-06-20T01:13:39Z http://mathoverflow.net/feeds/question/108406 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/108406/why-would-dim-primitive-irrep-divide-size-of-some-conjugacy-class Why would dim primitive irrep divide size of some conjugacy class ? Alexander Chervov 2012-09-29T13:07:13Z 2012-09-29T13:28:01Z <p>From <a href="http://www.uv.es/amoquin/35.pdf" rel="nofollow">Isaacs et.al. 2005</a></p> <blockquote> <p>Conjecture C. Let χ be a primitive irreducible character of an arbitrary ﬁnite group G. Then χ(1) divides | clG(g)| for some element g ∈ G.</p> <p>Here, of course, we have written clG(g) to denote the class of g in G. We have checked that Conjecture C holds for all irreducible characters (primitive or not) of all groups in the Atlas <a href="http://www.uv.es/amoquin/35.pdf" rel="nofollow">1</a>.</p> </blockquote> <p><strong>Question 1</strong> What is motivation for this ? Is it possible to describe what conjugacy class(es) should correspond to irreducible representation in this way ? (at least for some standard groups S_n, A_n, GL_n(F_q),...) What are representative examples? </p> <p><strong>Question 2</strong> Is it still open ? </p> <hr> <p>The authors write:</p> <blockquote> <p>We now digress to explain our original motivation for considering these questions. There are numerous parallels and analogies between theorems concerning the of set irreducible character degrees of a ﬁnite group and theorems concerning the set of conjugacy class sizes of such groups. This suggests that perhaps there are some subtle arithmetic connections between these two sets of integers associated with a given group. One such connection that is easy to see is that each prime number that divides an irreducible character degree of G must also divide some class size of G. If G is solvable, then S. Dolﬁ showed that more is true. He proved [2] that given any two distinct primes p and q such that pq divides some irreducible character degree of a solvable group G, then pq also divides some class size of G. One might conjecture that the analogous assertion for three or more distinct primes is also true, but as far as we know, this remains open.</p> </blockquote> <hr> <p><strong>Partial result:</strong></p> <p>In the following, we use the notation np to denote the p-part of a positive integer n, where p is a prime number.</p> <p>Corollary D. Let χ be a primitive irreducible character of a solvable group G, and let p be a prime divisor of |G|. Then χ(1)p divides (| clG(g)|p) 3 for some element g ∈ G.</p> <hr> <p>Not related results, for complteness:</p> <p>Denote CV(g) fixed point subspace for g in V.</p> <p>Our main result is the following.</p> <p>Theorem A. Let V be a nonzero ﬁnite dimensional completely reducible F G-module, where F is any ﬁeld and G is any ﬁnite group. Assume that CV (G) = 0 and let p be the smallest prime divisor of |G|. Then there exists some element g ∈ G such that</p> <p>$dim CV (g) ≤ (1/p) ~ dim V$.</p> <p>The fraction 1/p cannot, in general, be replaced by any smaller quantity. In particular, this shows that Neumann’s conjecture is valid for odd-order groups, at least...</p> <p>Corollary B. Let V be a nonzero ﬁnite dimensional completely reducible F G-module, where F is an arbitrary ﬁeld and G is any ﬁnite group, and assume that CV (G) = 0. Then</p> <p>$1/ |G| \sum_{g∈G} dim CV (g) ≤ ((p + 1)/ 2p)~~ dim V$ ,</p> <p>where p is the smallest prime divisor of |G|.</p>